» ampop - PrimeNumbers
This site relies heavily on Javascript. You should enable it if you want the full experience. Learn more.

ampop - PrimeNumbers

Prime (Value)

generate a random prime Number with a choosen number of digits.
There are 2 variants. Both too slow! Plus vvvv handels no numbers with more than 9 digits... 2^32??

A Module, that outputs and stores one or more prime Numbers with a given lenght:
Primes (Value).v4p (18.46 Kb)

A variant of the Prime (Value) Module using a counter to check if a random number is prime:
Primes (Value Variant).v4p (19.27 Kb)

Prime (Spreads)

generates a Spread with prime numbers up to a given number...

pretty useless.
Unless you have infinite processor power... in this case every prime number can be created with this patch *g*
But if u use all of your infinite processor power to calculate every possible prime number, then you wouldn't have any ressources left to display the primes on your screen... or would you?

So if u have such a machine, then try it out. I always wondered, how vvvv behaves if it has to handle infinitely large spreads...

Primes (Spread).zip (3.82 Kb)

Good night!

(PS: The help file contains also some nodes, which can tell you without a doubt, if a certain number is prime or not. Please don't use infinitely large primes for testing... the IO Box isn't big enough, anyway...
Joreg: could we put "infinitely large IO Boxes" on the roadmap for the next beta?? Would be a cool feature.

anonymous user login

Shoutbox

~11h ago

tgd: @karistouf: had the same issue days ago. reinstall Visual C++ Runtime 2012 from downloads

~1d ago

karistouf: arghhh, my dx11 mesh assimp are red nodes !!! any idea ???

~15d ago

SuperflysiNZ: Thanks

~18d ago

sebescudie: @Superfly : ApplicationPath