Breaking News: Grepper is joining You.com. Read the official announcement!

java check prime number

Add Answer

PureForWhite answered on June 17, 2021 Popularity 9/10 Helpfulness 3/10

answer java check prime number

related prime check java

related Check prime number in java

related java prime numbers

related how to find the prime numbers in java

related how to find prime numbers in java

java check prime number

Comment

import java.util.Scanner;
class main {
	public static void main(String [] args) {
		Scanner kb = new Scanner(System.in);
		System.out.print("? ");
		int num1 = kb.nextInt();
        boolean res = isprime(num1);
        System.out.println(res);
	}

	public static boolean isprime(int num1) {
        boolean ans = true;
        int i = 1;
        for(i = 2;i < num1;i++) {
            if((num1 % i == 0) && (num1 != 2)) {
                ans = false;
                break;
            }else{
                ans = true;
                break;
            }
        }
        return ans;
	}
}

Popularity 9/10 Helpfulness 3/10 Language java

Source: Grepper

Tags: java

Link to this answer
Share Copy Link

Contributed on Nov 06 2022

PureForWhite

0 Answers Avg Quality 2/10

Closely Related Answers

prime check java

Comment

  static boolean isPrime(int n){
        boolean result=true;
        if(n <= 1) return false;
        for(int i = 2; i <= n/2; i++){ //n/2 because the largest factor of any number is either it's half or less than it
            if(n % i == 0){
                result = false; //if some number divides it, then prime=false;
                break;
            }
        }
        return result;
    }

Popularity 10/10 Helpfulness 10/10 Language java

Source: Grepper

Tags: java

Link to this answer
Share Copy Link

Contributed on Jun 17 2021

Shristi Gautam

0 Answers Avg Quality 2/10

Check prime number in java

Comment

public class PrimeChecker {
    public static boolean isPrime(int num) {
        if (num <= 1) {
            return false;
        }
        for (int i = 2; i <= Math.sqrt(num); i++) {
            if (num % i == 0) {
                return false;
            }
        }
        return true;
    }

    public static void main(String[] args) {
        int number = 17; // Replace with the number to be checked
        if (isPrime(number)) {
            System.out.println(number + " is a prime number.");
        } else {
            System.out.println(number + " is not a prime number.");
        }
    }
}

Popularity 8/10 Helpfulness 5/10 Language java

Source: Grepper

Link to this answer
Share Copy Link

Contributed on Sep 12 2023

YOU.com

0 Answers Avg Quality 2/10

java prime numbers

Comment

for(int i = 2 ; i <= num ; i++)
        {
            if(isPrime(i))
            {
                System.out.print("  " + i);
                cnt++;
            }
        }
        System.out.println("Prime numbers = " + cnt);
    }

    public static boolean isPrime(int i) {
        for (int j = 2; j <= Math.sqrt(i); j++) {

            if(i % j == 0)
            {
                return false;
            }

        }
        return true;
    }

Popularity 10/10 Helpfulness 4/10 Language java

Source: Grepper

Tags: java

Link to this answer
Share Copy Link

Contributed on Sep 22 2022

Alive Ant

0 Answers Avg Quality 2/10

how to find the prime numbers in java

Comment

import java.util.*;
class Example{
	public static boolean isPrime(int num){
		for(int i=2; i<num; i++){
			if(num%i==0){
				return false; 
			}
		}
		return true;
	} 
	public static void main(String args[]){
		for (int i = 0; i < 1000; i++){
			if(isPrime(i)){
				System.out.println(i);	
			}
		}
	}
}

Popularity 10/10 Helpfulness 4/10 Language java

Source: Grepper

Tags: find

Link to this answer
Share Copy Link

Contributed on Jul 22 2022

Ishan Lahiru

0 Answers Avg Quality 2/10

how to find prime numbers in java

Comment

public class PrimeExample2{    

  static void checkPrime(int n){  
    int i,m=0,flag=0;      
    m=n/2;      
    if(n==0||n==1){  
     System.out.println(n+" is not prime number");      
    }else{  
       for(i=2;i<=m;i++){      
        if(n%i==0){      
         System.out.println(n+" is not prime number");      
         flag=1;      
         break;      
      }      
     }      
     if(flag==0)  { System.out.println(n+" is prime number"); }  
    }//end of else  
  }  
 public static void main(String args[]){    
  checkPrime(1);  
  checkPrime(3);  
  checkPrime(17);  
  checkPrime(20);  
}    
}

Popularity 10/10 Helpfulness 4/10 Language java

Source: Grepper

Tags: find

Link to this answer
Share Copy Link

Contributed on Jan 17 2022

android developer

0 Answers Avg Quality 2/10

java check prime number

Contents

More Related Answers

java check prime number

Closely Related Answers

prime check java

Check prime number in java

java prime numbers

how to find the prime numbers in java

how to find prime numbers in java

Grepper

Documentation

Social

Legal

Contact

Oops, You will need to install Grepper and log-in to perform this action.