Posted By

gdonald on 09/27/06

Tagged

number generator prime

Versions (?)

Who likes this?

1 person have marked this snippet as a favorite

indra

Java prime number generator

/ Published in: Java

Expand | Embed | Plain Text

package com.destiney.Prime;
class Prime
{
  public static void main( String args[] )
  {
    int x, y, c = 0;
    for( x = 2; x < 1000; x++ )
    {
      if( x % 2 != 0 || x == 2 )
      {
        for( y = 2; y <= x / 2; y++ )
        {
          if( x % y == 0 )
          {
            break;
          }   
        }
 
        if( y > x / 2 )
        {
          System.out.println( x );
          c++;
        }
      }
    }
    System.out.println( "\nTotal: " + c );
  }    
}

Report this snippet Tweet

Comments

Subscribe to comments

Posted By: jfurnish on December 18, 2006

Thanks works great!

Posted By: dreadrx7 on January 4, 2007

This works great but I need one that uses arrays. Thanks anyway

Posted By: sky on October 9, 2007

This might help!!

/** * */ package main; import java.util.Arrays;

/** * @author Shri Krishan Yadav * This program find and displays prime numbers between 1 and a given number. * It doesn't include the number entered. */ public class PrimeNumbers {

/**
 * @param args
 */
public static void main(String[] args) {
    if(args.length==0)
    {
        System.out.print("Please ennter a Number.");
        System.exit(0);
    }
    int count=0;
    int number= Integer.parseInt(args[0]);
    int[] numColl= new int[number];
    for (int i=1;i<number;i++)
    {
        if(i==1)
        {
            continue;
        }
        else if(i==2||i==3||i==5||i==7)
        {
            count++;
            numColl[i]= i;
            continue;
        }
        else
        {
            if(i%2==0||i%3==0||i%5==0||i%7==0)
                continue;
            else 
            {
                numColl[i]= i;
                count++;
                continue;
            }
        }
    }
    Arrays.sort(numColl);

    System.out.println("Prime numbers between 1 and "+number+" are "+ count);
    int N=1;
    for(int i=0;i<numColl.length;i++)
    {
        if(numColl[i]==0)
            continue;
        else
        {
            System.out.println("Prime number " +N+ " is: "+numColl[i]); 
            N++;
        }

    }

}

}

Posted By: Drukqs on April 30, 2009

import java.util.Scanner; public class Primes {

public static void main(String[] args) {

    System.out.print("Enter number prog: ");
    Scanner sc = new Scanner(System.in);

int n = sc.nextInt(); int x, y, c = 0; for( x = 2; x < n ; x++ ) { if( x % 2 != 0 || x == 2 ) { for( y = 2; y x / 2 ) { System.out.println( x ); c++; } } } System.out.println( "\nTotal: " + c );}

} //simple user input

Comment:

You need to login to post a comment.