GeezerVisonThe World Wide Web, restored to 800 pixels of glory. |
| Home|About|Gaming cabinet|Archives|How it works|Starter sites |
GeezerVison is showing github.com — Java/Programs/primeNumbers.java at main · PandaWire/Java Expand file tree/ Copy pathprimeNumbers.javaMore file actions 31 lines (31 loc) · 765 Bytes / Copy pathprimeNumbers.javaFile metadata and controls31 lines (31 loc) · 765 Bytes 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 // Program to find out the prime numbers in a given range in Java - package primeNo; import java.util.Scanner; // To take input from user public class PrimeNo { public static void main(String[] args) { // TODO Auto-generated method stub Scanner sc = new Scanner(System.in); int a, b; System.out.println("Enter first value: "); a = sc.nextInt(); System.out.println("Enter last value: "); b = sc.nextInt(); int i, j, num = 0, c = 0; System.out.println("List of prime numbers from " + a + " to " + b + ": "); for (i = a; i <= b; i++) { num = i; c = 0; j = 2; // Start checking from 2 while (j < num) { if ((num % j) == 0) { c = 1; break; } j++; } if (c == 0) { System.out.println(num); } } } } |
| You are visitor 01402520 — 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. |