A prime number is a number that has only 2 factors:
A number greater than 1 that is divisible only by 1 and itself.
java:
package Learning;
import java.util.Scanner;
public class primenum {
public static void main(String[]args) {
Scanner s=new Scanner(System.in);
System.out.println("Enter the number:");
int n=s.nextInt();
boolean prime=true;
if(n<=1) prime=false;
for(int i=2;i<=Math.sqrt(n);i++) {
if(n%2==0) {
prime=false;
break;
}
}
System.out.println(prime ?"prime" : "not pime");
}
}
JavaScript:
let n = Number(prompt("Enter a number:"));
let isPrime = true;
if (n <= 1) {
isPrime = false;
} else {
for (let i = 2; i < n; i++) {
if (n % i === 0) {
isPrime = false;
break;
}
}
}
console.log(isPrime ? "Prime" : "Not Prime");
Python:
num=int(input("enter a number: "))
div=2
flag=True
while div<=num/2:
if num%div==0:
flag=False
break
div+=1
if flag==True:
print("This number is Prime")
else:
print("This number is not Prime")
Top comments (0)