Z Score,T Score, Percential Rank and Box Plot Graph
PrimeRange.java import java.util.Scanner;public class PrimeRan.pdf
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:
![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](https://image.slidesharecdn.com/primerange-230408173832-d6e2849e/85/PrimeRange-java-import-java-util-Scanner-public-class-PrimeRan-pdf-1-320.jpg)
![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:](data:image/gif;base64,R0lGODlhAQABAIAAAAAAAP///yH5BAEAAAAALAAAAAABAAEAAAIBRAA7)