Primes which contain only one odd digit: Difference between revisions

Content added Content deleted

Inline

@@ Line 7: / Line 7: @@
 =={{header|Julia}}==
-If only one digit of a prime is odd, then that odd digit is the ones place digit. We don't actually need to check for an odd first digit except to exclude 2.
+If only one digit of a prime is odd, then that odd digit is the ones place digit. We don't actually need to check for an odd first digit once we exclude 2.
 <lang julia>using Primes
 function isoneoddprime(n, base = 10)
     d = digits(n, base = base)
-    return isodd(first(d)) && all(iseven, d[begin+1:end])
+    return n != 2 && all(iseven, d[begin+1:end])
 end