title: Writing a method to find prime numbers
body: <p>I'm trying to write a program that uses a predicate method that finds all the prime numbers between 1-100. I know there are more efficient ways of finding prime numbers but right now but I want to use the brute-force strategy and try every possible combination. <br/><br/> Right now the program as it is, just prints true or false 10,000 times  but I want my program to only print the numbers if they are prime. So after the program is done I'll have a list of prime numbers between 1- 100. <br/><br/> 1. Is my program correct for what I'm trying to do? 2. What would be good suggesting to change my program so that it lists all the prime numbers between 1-100.</p>
  
  <pre><code>import acm.program.*;
  public class PrimeNumbers extends ConsoleProgram{
  public void run(){
  
      for (int i =1; i &lt;= 100, i++){
          for (int j =1; j&lt;= 100; j++){
             println(yesPrime(i, j));
         }
       }
     }
  
  private boolean yesPrime (int n, int k){
        return ( n % k == 0)
  
         }
      }
    }
  </code></pre>