The document contains Java code for a program that prompts the user to enter a low and a high range, and then prints all prime numbers within that range. It defines a method 'isprime' to check the primality of each number. The example provided shows the program in action with the range from 10 to 30, outputting the prime numbers.

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