Comments on: Java program to print the prime numbers

By: Kceejones

Kceejones — Sat, 04 Jul 2015 14:17:32 +0000

Pls i need a program to input the number of sentence and then display:word and it frequecy

By: ashish

ashish — Fri, 12 Jun 2015 17:45:10 +0000

Its a wrong code…..

By: girija

girija — Sun, 17 May 2015 14:44:32 +0000

public class Checkprime {
public boolean prime(int num){
for(int i=2;i<=num-1;i++){
if(num%i==0){
return false;
}
}

return true;

}

public static void main(String[] args) {
Scanner scn = new Scanner(System.in);
System.out.println("enter the range");
int range = scn.nextInt();
Checkprime p = new Checkprime();
for(int j=0;j<=range;j++){
if(p.prime(j)){
System.out.println(j);

}
}
}

}

By: Utkarsh

Utkarsh — Sat, 15 Nov 2014 14:11:50 +0000

Please email me this programme for blue j

By: Manan

Manan — Sat, 21 Sep 2013 11:10:49 +0000

import java.io.*;
import java.util.*;

class prime
{
public static void main(String args[])throws IOException
{
BufferedReader br=new BufferedReader(new InputStreamReader(System.in));

/* Check if a number is prime or not */
int x=0;
int n,m;

System.out.print(“Enter a no. : “);
n= Integer.parseInt(br.readLine());

for(int i=2; i<=n/2; i++)
{
m = n%i;
if(m==0)
{ x++; }
}
if(x==0)
System.out.println("The number is a prime no. ");
else System.out.println("It is not prime no. ");

/* Print List of prime nos. till N'th number */

int a,b;
int c;
int d;
System.out.println("Enter number till which you want prime no.:");
d= Integer.parseInt(br.readLine());

for(a=2;a {
c=0;
for(b=2;b {
if((a%b)==0)
{
c=1;
}
}
if(c==0)
{
System.out.print(a+" ");
}
}

}}

By: Harsh

Harsh — Wed, 22 May 2013 11:46:48 +0000

Java source code to print prime unique numbers between two limits.
import java.io.*;
class primeUniqueNo
{
static int check(int a)
{
int b;
for(b = 2; b <= a/2; b++)
{
if(a%b==0)
{
return 0;
}
}
return 1;
}
long countDigits(long no)
{
return String.valueOf(no).length();
}
boolean checkUnique(long n)
{
int nd = (int)countDigits(n);
long arr[] = new long[nd];
long copy = n;
int digit,term = 0;
while(copy!=0)
{
digit = (int)copy%10;
arr[term] = digit;
term++;
copy/=10;
}
for(int i = 0;i {
for(int j = i+1;j {
if(arr[i] == arr[j])
return false;
}
}
return true;
}
void main() throws IOException
{
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
System.out.println("Enter limits");
int n = Integer.parseInt(br.readLine());
int s = Integer.parseInt(br.readLine());
int count = 0;
for(int i = n;i<=s;i++)
{
if(checkUnique(i)==true)
{
if(check(i)==1)
{
System.out.print(i + " ");
count++;
}
}
}
System.out.println("");
System.out.println(count+" prime unique number(s) had been found.");
}
}

By: ankit

ankit — Wed, 27 Feb 2013 06:29:39 +0000

import java.util.*;

class Prime
{
public static void main(String str[])
{

Scanner in=new Scanner(System.in);
System.out.println(“Enter number upto which you want to find prime numbers: “);
int n=in.nextInt();
System.out.println(“The prime numbers are:”);
for(int i=2;i<=n;i++)
{
int k=0;
for(int j=2;j<=i;j++)
{
if(i%j==0){
k=k+1;
}
}
if(k==1){
System.out.println(i);
}

}

}
}

By: madhu

madhu — Wed, 09 Jan 2013 06:21:55 +0000

class prime should have its own identification

By: mallo

mallo — Fri, 05 Nov 2010 12:02:28 +0000

its not worling n blue j