Write a program in Javascript to find the sum of two numbers if they are prime numbers.
<!DOCTYPE html>
<html lang="en">
<head>
<meta charset="UTF-8">
<meta name="viewport" content="width=device-width, initial-scale=1.0">
<title>Find Sum of two if they are prime</title>
<style>
body {
font-family: sans-serif;
margin-top: 3rem;
}
h1 {
color: white;
margin-bottom: 30px;
}
p {
color: white;
font-weight: 300;
font-size: 14px;
margin: 20px 0;
line-height: 1.9;
}
input {
padding: 10px;
border-radius: 10px;
box-shadow: 0 1px 3px rgba(0, 0, 0, 0.12), 0 1px 2px rgba(0, 0, 0, 0.24);
border: none;
}
button {
background: #ffa500;
padding: 10px 30px;
color: #fff;
border: none;
font-weight: bold;
box-shadow: 0 3px 6px rgba(0, 0, 0, 0.16), 0 3px 6px rgba(0, 0, 0, 0.23);
border-radius: 15px;
}
.main {
margin: auto;
text-align: center;
background: #948cff;
padding: 100px;
width: 40%;
}
#result {
cursor: pointer;
}
span {
background: red;
color: #ffffff;
border-radius: 10px;
padding: 10px;
margin-bottom: 10px;
line-height: 2.9;
}
</style>
</head>
<body>
<div class="main">
<form name="primeForm">
<h1>Find Sum of two Number if prime?</h1>
<input type="number" placeholder="0" id="number1">
<input type="number" placeholder="0" id="number2">
<p id="result">Result Will display here</p>
<button>Caculate</button>
</form>
</div>
<script>
const primeForm = document.forms.primeForm;
primeForm.addEventListener("submit", (e) => {
e.preventDefault();
let showResult = document.getElementById("result");
let num1 = Number(primeForm.number1.value);
let num2 = Number(primeForm.number2.value);
let prime1 = getPrimeNumber(num1);
let prime2 = getPrimeNumber(num2);
(prime1 > 0 && prime2 > 0)
? showResult.innerHTML = (prime1 + prime2)
: ifNotaPrime();
function ifNotaPrime() {
if (prime1 === 0)
showResult.innerHTML =`<span>${num1}</span> is not a Prime Number<br>`;
if (prime2 === 0)
showResult.innerHTML += `<span>${num2}</span> is not a Prime Number`;
}
});
/* getPrimeNumber() is a function
which return prime only if they are
If there is no prime number it return 0*/
function getPrimeNumber(n) {
let i, flag = true;
if (n === 1) return 0;
for (i = 2; i <= n - 1; i++)
if (n % i == 0) {
flag = false;
break;
}
if (flag == true) {
return n;
} else {
return 0;
}
}
</script>
</body>
</html>
0 Comments
If you have any question please ask?