ZCubes/Devil Primes

From ZCubes Wiki
Revision as of 02:18, 21 August 2020 by Devika (talk | contribs) (Video)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to: navigation, search

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


Devil Primes














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.