package main
import (
"fmt"
)
/*
Print the first 100 prime numbers.
The program is structured for clarity:
- A helper function determines whether a number is prime.
- A generator function collects primes until reaching the desired count.
- Comments explain the reasoning behind each step.
*/
func isPrime(n int) bool {
/*
Return true if n is a prime number.
The function uses a straightforward and efficient approach:
- Reject numbers below 2.
- Only test divisors up to the square root of n.
Using i*i <= n avoids repeated math.Sqrt calls.
*/
if n < 2 {
return false
}
for i := 2; i*i <= n; i++ {
if n%i == 0 {
return false // Found a divisor → not prime
}
}
return true // No divisors found → prime
}
func firstNPrimes(count int) []int {
/*
Generate a slice containing the first `count` prime numbers.
The function increments through natural numbers,
checks primality, and collects primes until the slice is full.
*/
primes := make([]int, 0, count)
number := 2 // Start from the first prime candidate
for len(primes) < count {
if isPrime(number) {
primes = append(primes, number)
}
number++
}
return primes
}
func main() {
/*
Compute and print the first 100 prime numbers.
Each prime is printed on its own line.
*/
primes := firstNPrimes(100)
for _, p := range primes {
fmt.Println(p)
}
}
/*
run:
2
3
5
7
11
13
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
269
271
277
281
283
293
307
311
313
317
331
337
347
349
353
359
367
373
379
383
389
397
401
409
419
421
431
433
439
443
449
457
461
463
467
479
487
491
499
503
509
521
523
541
*/
