fork(6) download
  1.  
  2. public class Main {
  3.  
  4. public static void main(String[] args) {
  5. prime_Generation(17,50);
  6. }
  7.  
  8. public static void prime_Generation (int seed, int number_of_primes) {
  9. if(!isPrime(seed)) {
  10. System.out.println("Seed is not prime"); // simple out statement saying that "seed" is not prime
  11. }else {
  12. int primes = 1;
  13. int from_seed = seed;
  14. while(primes <= number_of_primes) {
  15. if(isPrime(from_seed)) {
  16. System.out.println(from_seed);
  17. primes++;
  18. from_seed++;
  19. }else {
  20. from_seed++;
  21. }
  22. }
  23. }
  24.  
  25. }
  26.  
  27. // simple primality test - can be modified to be more complex and more efficient
  28. public static boolean isPrime(int n) {
  29. if(n <= 2){
  30. return false;
  31. }else {
  32. for(int i = 2;i<=Math.sqrt(n);i++) {
  33. if(n % i == 0) {
  34. return false;
  35. }
  36. }
  37. }
  38. return true;
  39. }
  40.  
  41. }
  42.  
Success #stdin #stdout 0.06s 380224KB
stdin
Standard input is empty
stdout
17
19
23
29
31
37
41
43
47
53
59
61
67
71
73
79
83
89
97
101
103
107
109
113
127
131
137
139
149
151
157
163
167
173
179
181
191
193
197
199
211
223
227
229
233
239
241
251
257
263