Thread: strange problem

hey doods
i am begginer and i am trying to write a programe which print the first 100 primers numbers.
here is the code - and i don't understand why its not even run...
*****there is a Terminal class which is special but dont mind it is just an input/output class....the bug not that way...
i am realy need help and i don't want to look for programe already done on the net
thank u very much

public class Premiers{
public static void main(String[]args){
int n=2;
boolean p=true;
for(int i=1;i<=100;i=i+1){
for(int d=1;d<n;d=d+1){
if(n%d==0){
p=false;
}
}
if(p!=false){
Terminal.ecrireStringln(n+" est un n.primer");
}
n=n+1;
}
}
}

Please read the Announcement topic at the top of the sub-forum to learn how to post code in code or highlight tags and other useful info for newcomers.

First, simplify what you have to an algorithm that can simply find prime numbers. Start with finding all prime numbers between zero and 100. Come back when you have that working and we'll go from there.

first thank you for fast response..
second the algorithm is:
for n check if all the numbers except 1 and it self divide without living a "rest" (% function) if its passes the test then the boolean variable stay true and the nomber will be shown on the screen...
FINALLY i have succeeded the problem was that i forgot to "initialize" the boolean valeur to true after the inner loop....
thanks a lot guys-really

 
public class Premiers{
  public static void main(String[]args){
    int n=2;
    boolean p=true;
    for(int i=1;i<=100;i=i+1){
      for(int d=2;d<n;d=d+1){
        if(n%d==0){
          p=false;
        }
      }
      if(p!=false){
        Terminal.ecrireStringln(n+" est un n.primer");
      }
      n=n+1;
      p=true;
    }
  }
}

If your original problem statement is correct, then you need to continue the program until you find 100 prime numbers, not just those between zero and 100.

You don't need to compare a boolean to false or true, you can simply check the boolean, as in:

if ( p ) or if ( !p ).

You can optimize your algorithm further. For example, there's no need to check even numbers after 2. There are other facts about finding prime numbers you can find with a quick search of the Internet that you could use.

thank you for your help...
i had already noticed the problem and i fixed it..
i don't understood your [you can simply check the boolean, as in: if ( p ) or if ( !p )] if you can kindely explain...(sorry ,i am a beginner...)
here is my new code...this time its do the job !

public class Premiers{
  public static void main(String[]args){
    int n=2,pn=0;
    boolean p=true;
    while(pn<100){
      for(int d=2;d<n;d=d+1){
        if(n%d==0){
          p=false;
        }
      }
      if(p!=false){
        Terminal.ecrireStringln(n+" est un n.primer");
        pn=pn+1;
      }
      n=n+1;
      p=true;
    }
  Terminal.ecrireIntln(n);
  }
}