Numbers with prime digits whose sum is 13: Difference between revisions

Content added Content deleted

Inline

@@ Line 875: / Line 875: @@
 There are 349321957098598244959032342621956 prime-digit-only numbers summing to 199.
 </pre>
+=={{header|Kotlin}}==
+{{trans|D}}
+<lang scala>fun primeDigitsSum13(n: Int): Boolean {
+    var nn = n
+    var sum = 0
+    while (nn > 0) {
+        val r = nn % 10
+        if (r != 2 && r != 3 && r != 5 && r != 7) {
+            return false
+        }
+        nn /= 10
+        sum += r
+    }
+    return sum == 13
+}
+fun main() {
+    // using 2 for all digits, 6 digits is the max prior to over-shooting 13
+    var c = 0
+    for (i in 1 until 1000000) {
+        if (primeDigitsSum13(i)) {
+            print("%6d ".format(i))
+            if (c++ == 10) {
+                c = 0
+                println()
+            }
+        }
+    }
+    println()
+}</lang>
+{{out}}
+<pre>   337    355    373    535    553    733   2227   2272   2335   2353   2533
+3235   3253   3325   3352   3523   3532   5233   5323   5332   7222
+22252  22333  22522  23233  23323  23332  25222  32233  32323  32332
+33232  33322  52222 222223 222232 222322 223222 232222 322222 </pre>
 =={{header|Pascal}}==