//  Data Structures with Java by John R. Hubbard
//  Copyright McGraw-Hill, 2001
//  Problem 2.29 on page 50
//  Finding Babbage primes

import schaums.dswj.Primes;

public class Pr0229
{ public static void main(String[] args) 
  { final int N=10000;
    Primes.setSize(N);
    for (int x=0; x<50; x++)
    { System.out.print(x);
      int n = x*x + x + 41;
      if (Primes.isPrime(n))
        System.out.println("\t"+n+" is prime");
      else System.out.println();
    }
  }
}