Jump to content

Primes with digits in nondecreasing order: Difference between revisions

(Added Visual Basic .NET, (translation of C#).)
Line 233:
const range = 2:999
 
for base in [2:10...;[1016, 17, 27, 31, 62]]
primes = filter(n -> isprime(n) && issorted(digits(n, base=base), rev=true), range)
println("\nBase $base: ", length(primes), " non-descending primes between 1 and ",
Line 272:
277 337 347 349 359 367 379 389 449 457 467 479 499 557 569 577
599 677
Base 1016: 5088 non-descending primes between 1 and 6773df:
2 3 5 7 11 b 13 d 17 11 19 13 23 17 29 1d 37 1f 47 25 59 29 672b 792f 8935
113 3b 127 1373d 139 47 149 15749 167 4f 179 19959 223 67 227 2296b 233 6d 239 2577f 269 89 8b 9d ad bf df
277 ef 337 115 347 119 349 11b 359 125 367 133 379 137 389 139 449 13d 457 14b 467 15b 479 15d 499 167 557 16f 569 17b 577 17f
18d 199 1af 1bb 1cd 1cf 1df 223 22d 233 239 23b 24b 257 259 25f
599 677
269 26b 277 28d 2ab 2bd 2cf 2dd 2ef 335 337 33b 33d 347 355 359
35b 35f 36d 377 38b 38f 3ad 3df
Base 17: 82 non-descending primes between 1 and 37b:
2 3 5 7 b d 12 16 1c 1e 23 27 29 2d 38 3a
4,105

edits

Cookies help us deliver our services. By using our services, you agree to our use of cookies.