PracticeUp | Java Programming

Output: *** Check For Any Prime Number *** Enter any number: 7895462 7895462 is not a Prime Number ----------------------------------- *** Check For Any Prime Number *** Enter any number: 784129 784129 is a Prime Number Click Here For  Java Online Compiler Solution: import java.util.Scanner ; public class CheckPrime { public static void main ( String args []) { int temp ; boolean isPrime = true ; Scanner scan = new Scanner ( System . in ); System . out . println ( "*** Check For Any Prime Number ***" + "\n" ); System . out . print ( "Enter any number: " ); int num = scan . nextInt (); for ( int i = 2; i <= num / 2; i ++) { temp = num % i ; if ( temp == 0) { isPrime = false ; break ; } } if ( isPrime ) { System . out . println ( num...

Output: *** First 10 Prime Numbers *** First 10 prime numbers are: 2 3 5 7 11 13 17 19 23 29 Click Here For  Java Online Compiler Solution: public class First10PrimeNumbers { public static void main ( String args []) { int n ; int status = 1; int num = 3; System . out . println ( "*** First 10 Prime Numbers ***" + "\n" ); System . out . println ( "First 10 prime numbers are:" ); System . out . println (2); for ( int i = 2; i <= 10;) { for ( int j = 2; j <= num / 2; j ++) { if ( num % j == 0) { status = 0; break ; } } if ( status != 0) { System . out . println ( num ); i ++; } status = 1; num ++; } } }

Output: *** First 'n' Prime Numbers *** Enter the value of n: 8 First 8 prime numbers are: 2 3 5 7 11 13 17 19 Click Here For  Java Online Compiler Solution: import java.util.Scanner ; class FirstNPrimeNumbers { public static void main ( String args []) { int n ; int status = 1; int num = 3; Scanner scanner = new Scanner ( System . in ); System . out . println ( "*** First 'n' Prime Numbers ***" + "\n" ); System . out . print ( "Enter the value of n: " ); n = scanner . nextInt (); if ( n >= 1) { System . out . println ( "First " + n + " prime numbers are:" ); System . out . println (2); } for ( int i = 2; i <= n ;) { for ( int j = 2; j <= Math . sqrt ( num ); j ++) { if ( num % j == 0) { ...