PrimeRange.java import java.util.Scanner;public class PrimeRan.pdf

PrimeRange.java
import java.util.Scanner;
public class PrimeRange {
/**
* @param args
*/
public static void main(String[] args) {
// TODO Auto-generated method stub
Scanner scan = new Scanner(System.in);
System.out.println(\"Enter low range:\");
int low = scan.nextInt();
System.out.println(\"Enter high range:\");
int high = scan.nextInt();
for(int i=low; i<=high; i++){
if(isPrime(i))
System.out.print(i+\" \");
}
}
public static boolean isPrime(int n){
for (int f = 2; f < n / 2; f++) {
if (n % f == 0) {
return false;
}
}
return true;
}
}
Output:
Enter low range:
10
Enter high range:
30
11 13 17 19 23 29
Solution
PrimeRange.java
import java.util.Scanner;
public class PrimeRange {
/**
* @param args
*/
public static void main(String[] args) {
// TODO Auto-generated method stub
Scanner scan = new Scanner(System.in);
System.out.println(\"Enter low range:\");
int low = scan.nextInt();
System.out.println(\"Enter high range:\");
int high = scan.nextInt();
for(int i=low; i<=high; i++){
if(isPrime(i))
System.out.print(i+\" \");
}
}
public static boolean isPrime(int n){
for (int f = 2; f < n / 2; f++) {
if (n % f == 0) {
return false;
}
}
return true;
}
}
Output:
Enter low range:
10
Enter high range:
30
11 13 17 19 23 29.

1. PrimeRange.java

import java.util.Scanner;
public class PrimeRange {
   /**
   * @param args
   */
   public static void main(String[] args) {
       // TODO Auto-generated method stub
       Scanner scan = new Scanner(System.in);
       System.out.println(\"Enter low range:\");
       int low = scan.nextInt();
       System.out.println(\"Enter high range:\");
       int high = scan.nextInt();
       for(int i=low; i<=high; i++){
           if(isPrime(i))
           System.out.print(i+\" \");
       }
   }
   public static boolean isPrime(int n){
       for (int f = 2; f < n / 2; f++) {
   if (n % f == 0) {
   return false;
   }

   }
   return true;
   }
}
Output:
Enter low range:
10
Enter high range:
30
11 13 17 19 23 29

2. Solution

PrimeRange.java

import java.util.Scanner;
public class PrimeRange {
   /**
   * @param args
   */
   public static void main(String[] args) {
       // TODO Auto-generated method stub
       Scanner scan = new Scanner(System.in);
       System.out.println(\"Enter low range:\");
       int low = scan.nextInt();
       System.out.println(\"Enter high range:\");
       int high = scan.nextInt();
       for(int i=low; i<=high; i++){
           if(isPrime(i))
           System.out.print(i+\" \");
       }
   }
   public static boolean isPrime(int n){
       for (int f = 2; f < n / 2; f++) {
   if (n % f == 0) {
   return false;
   }

   }
   return true;
   }
}
Output:
Enter low range:
10
Enter high range:

3. 30
11 13 17 19 23 29