Difference between revisions of "ZCubes/Devil Primes"
Jump to navigation
Jump to search
(Created page with "==Devil Primes== <br/> This video computes the devil primes, for example, the number 16661, 1 followed by thirteen 0s then 666 and then thirteen 0s and then ending with one. T...") |
(→Video) |
||
| Line 7: | Line 7: | ||
{{#ev:youtube|VghFFMwMaC0|480|left|Devil Primes}} | {{#ev:youtube|VghFFMwMaC0|480|left|Devil Primes}} | ||
<br/><br/><br/><br/><br/><br/><br/><br/><br/><br/><br/><br/><br/> | <br/><br/><br/><br/><br/><br/><br/><br/><br/><br/><br/><br/><br/> | ||
| + | |||
| + | ==Code-Devil Primes== | ||
| + | ISPRIME(1000000000000066600000000000001<>n) | ||
| + | |||
| + | ops.on; | ||
| + | (n=>(((10n^(n+1)+(666))*(10n^(n-1)))+1))@1..20 | ||
| + | (n=>(((10n^(n+1)+(666))*(10n^(n-1)))+1))@2..200 | ||
| + | a.map((x,i)=>([i,ISPRIME(x)])) | ||
| + | .filter(r=>r[1][0])) | ||
<<[[Main_Page | About ZCubes ]] | <<[[Main_Page | About ZCubes ]] | ||
Revision as of 03:18, 21 August 2020
Devil Primes
This video computes the devil primes, for example, the number 16661, 1 followed by thirteen 0s then 666 and then thirteen 0s and then ending with one. These are called devil primes due to common beliefs around the numbers 666 and 13 etc. ZCubes has function to check if a number is a prime number and also can deal with large integer computations. This ability opens up our capability to discover interesting numbers and patterns and their specialties.
Video
Code-Devil Primes
ISPRIME(1000000000000066600000000000001<>n)
ops.on; (n=>(((10n^(n+1)+(666))*(10n^(n-1)))+1))@1..20 (n=>(((10n^(n+1)+(666))*(10n^(n-1)))+1))@2..200 a.map((x,i)=>([i,ISPRIME(x)])) .filter(r=>r[1][0]))
<< About ZCubes
© Copyright 1996-2020, ZCubes, Inc.