Prime Number Finder

 package loops;

import java.util.Scanner;

public class PrimeNumberFinder {


public static void main(String[] args) {


Scanner sc = new Scanner(System.in);

int n = sc.nextInt();

boolean isPrime = true;

for(int i= 2; i*i <=n; i++) {

if(n%i ==0) isPrime = false; break;

}


if(n<2) isPrime = false;

System.out.println("Is prime " + isPrime);

}

}

 

Comments

Popular posts from this blog

Type Casting

Arithmetic

Pattern 1