Sum of square and cube digits of an integer are primes: Difference between revisions
Content added Content deleted
Not a robot (talk | contribs) (Add MAD) |
Not a robot (talk | contribs) (Add C) |
||
Line 60: | Line 60: | ||
{{out}} |
{{out}} |
||
<pre>⟨ 16 17 25 28 34 37 47 52 64 ⟩</pre> |
<pre>⟨ 16 17 25 28 34 37 47 52 64 ⟩</pre> |
||
=={{header|C}}== |
|||
<lang c>#include <stdio.h> |
|||
#include <stdbool.h> |
|||
int digit_sum(int n) { |
|||
int sum; |
|||
for (sum = 0; n; n /= 10) sum += n % 10; |
|||
return sum; |
|||
} |
|||
/* The numbers involved are tiny */ |
|||
bool prime(int n) { |
|||
if (n<4) return n>=2; |
|||
for (int d=2; d*d <= n; d++) |
|||
if (n%d == 0) return false; |
|||
return true; |
|||
} |
|||
int main() { |
|||
for (int i=1; i<100; i++) |
|||
if (prime(digit_sum(i*i)) & prime(digit_sum(i*i*i))) |
|||
printf("%d ", i); |
|||
printf("\n"); |
|||
return 0; |
|||
}</lang> |
|||
{{out}} |
|||
<pre>16 17 25 28 34 37 47 52 64</pre> |
|||
=={{header|CLU}}== |
=={{header|CLU}}== |