Sum of square and cube digits of an integer are primes: Difference between revisions
Sum of square and cube digits of an integer are primes (view source)
Revision as of 19:38, 22 December 2021
, 2 years agoadd FreeBASIC
(add FreeBASIC) |
|||
Line 52:
16 17 25 28 34 37 47 52 64
</pre>
=={{header|FreeBASIC}}==
<lang freebasic>
function digsum(byval n as uinteger, b as const uinteger) as uinteger
'digital sum of n in base b
dim as integer s
while n
s+=n mod b
n\=b
wend
return s
end function
function isprime(n as const uinteger) as boolean
if n<2 then return false
if n<4 then return true
if n mod 2 = 0 then return false
dim as uinteger i = 3
while i*i<=n
if n mod i = 0 then return false
i+=2
wend
return true
end function
for n as uinteger = 1 to 99
if isprime(digsum(n^3,10)) andalso isprime(digsum(n^2,10)) then print n;" ";
next n</lang>
{{out}}<pre>16 17 25 28 34 37 47 52 64</pre>
=={{header|Perl}}==
| |||