2023-09-16 17:28:03 -07:00
|
|
|
func prime n .
|
2025-06-11 20:16:52 -04:00
|
|
|
if n mod 2 = 0 and n > 2 : return 0
|
2023-09-16 17:28:03 -07:00
|
|
|
i = 3
|
|
|
|
|
sq = sqrt n
|
|
|
|
|
while i <= sq
|
2025-06-11 20:16:52 -04:00
|
|
|
if n mod i = 0 : return 0
|
2023-09-16 17:28:03 -07:00
|
|
|
i += 2
|
2023-07-01 11:58:00 -04:00
|
|
|
.
|
2023-09-16 17:28:03 -07:00
|
|
|
return 1
|
2023-07-01 11:58:00 -04:00
|
|
|
.
|
2023-09-16 17:28:03 -07:00
|
|
|
func digsum n .
|
2023-07-01 11:58:00 -04:00
|
|
|
while n > 0
|
|
|
|
|
sum += n mod 10
|
|
|
|
|
n = n div 10
|
|
|
|
|
.
|
2023-09-16 17:28:03 -07:00
|
|
|
return sum
|
2023-07-01 11:58:00 -04:00
|
|
|
.
|
|
|
|
|
for i = 2 to 500
|
2023-09-16 17:28:03 -07:00
|
|
|
if prime i = 1
|
|
|
|
|
s = digsum i
|
2025-06-11 20:16:52 -04:00
|
|
|
if prime s = 1 : write i & " "
|
2023-07-01 11:58:00 -04:00
|
|
|
.
|
|
|
|
|
.
|
