Sum of square and cube digits of an integer are primes: Difference between revisions

Content added Content deleted

Inline

@@ Line 447: / Line 447: @@
 </pre>
+=={{header|OCaml}}==
+<syntaxhighlight lang="ocaml">let is_prime n =
+  let rec test x =
+    let q = n / x in x > q || x * q <> n && n mod (x + 2) <> 0 && test (x + 6)
+  in if n < 5 then n lor 1 = 3 else n land 1 <> 0 && n mod 3 <> 0 && test 5
+let rec digit_sum n =
+  if n < 10 then n else n mod 10 + digit_sum (n / 10)
+let is_square_and_cube_digit_sum_prime n =
+  is_prime (digit_sum (n * n)) && is_prime (digit_sum (n * n * n))
+let () =
+  Seq.ints 1 |> Seq.take_while ((>) 100)
+  |> Seq.filter is_square_and_cube_digit_sum_prime
+  |> Seq.iter (Printf.printf " %u") |> print_newline</syntaxhighlight>
+{{out}}
+<pre> 16 17 25 28 34 37 47 52 64</pre>
 =={{header|Perl}}==