GeezerVisonThe World Wide Web, restored to 800 pixels of glory. |
| Home|About|Gaming cabinet|Archives|How it works|Starter sites |
GeezerVison is showing codescracker.com — Java Program to Print Prime Numbers
Java Program to Print Prime NumbersThis article covers multiple programs in Java to print prime numbers. Here are the list of programs covered in this article:
Note - A number that can only be divisible by 1 and the number itself is called a prime number. For example: 2, 3, 5, 7, 11, 13, 17 etc., are all prime numbers. Print Prime Numbers from 1 to 100 in JavaThe question is, write a Java program to print prime numbers from 1 to 100. The program given below is its answer: public class CodesCracker { public static void main(String[] args) { int i, j, chk; System.out.println("---Prime Numbers from 1 to 100---"); for(i=2; i<=100; i++) { chk = 0; for(j=2; j<i; j++) { if(i%j==0) { chk++; break; } } if(chk==0) System.out.println(i); } } } The snapshot given below shows the sample output produced by above program, on printing of all prime numbers from 1 to 100: Print First 10 Prime Numbers in JavaThis program almost uses the same concept as of previous program, to print the first 10 prime numbers. In this program, I've used a variable named count, whose initial value is 0. And its value gets incremented each time by 1, after printing a prime number. And the loop continue its execution, to print prime numbers, until the value of count becomes equal to 10, or until the condition count<10 evaluates to be False. public class CodesCracker { public static void main(String[] args) { int i, j, chk, count=0; System.out.println("First 10 Prime Numbers are:"); for(i=2; count<10; i++) { chk = 0; for(j=2; j<i; j++) { if(i%j==0) { chk++; break; } } if(chk==0) { System.out.print(i+ " "); count++; } } } } The output produced by above program on printing of first 10 prime numbers, is shown in the snapshot given below: Print Prime Numbers from 1 to n in JavaNow this program prints prime numbers from 1 to n. And of course, the value of n would be received by user at run-time of the program. import java.util.Scanner; public class CodesCracker { public static void main(String[] args) { Scanner scan = new Scanner(System.in); System.out.print("Enter the Value of n: "); int n = scan.nextInt(); System.out.println("\n---Prime Numbers from 1 to " +n+ "---"); for(int i=2; i<=n; i++) { int chk = 0; for(int j=2; j<i; j++) { if(i%j==0) { chk++; break; } } if(chk==0) System.out.println(i); } } } Here is its sample run with user input 10 as value of n to print prime numbers from 1 to 10 Print Prime Numbers in Given Range in JavaNow this program allows user to define the range, the start and end value, to print all prime numbers in between the given range. import java.util.Scanner; public class CodesCracker { public static void main(String[] args) { Scanner scan = new Scanner(System.in); System.out.print("Enter the Range: "); int start = scan.nextInt(); int end = scan.nextInt(); System.out.println("\n---Prime Numbers from " +start+" to " +end+ "---"); for(int i=start; i<=end; i++) { int chk = 0; for(int j=2; j<i; j++) { if(i%j==0) { chk++; break; } } if(chk==0) System.out.println(i); } } } The sample run with user input 500 and 550 as range, is shown in the snapshot given below: Print Prime Numbers in Java using while LoopThe previous program can also be written using while loop, instead of for. For this, just replaced the for loop's block of code, with following block of code: int i=start; while(i<=end) { int chk = 0; int j=2; while(j<i) { if(i%j==0) { chk++; break; } j++; } if(chk==0) System.out.println(i); i++; } Same Program in Other Languages« Previous Program Next Program » Practice Quizzes
Test your programming and computer science knowledge with interactive MCQs and topic-based quizzes. Popular Topics
Explore the most popular programming and computer science tutorials on CodesCracker. |
| You are visitor 01402503 — GeezerVison does not store the pages you look up. Best viewed with Netscape Navigator 4.7 or Internet Explorer 6 at 800×600. No cookies required. |