No, this has nothing to do with Transformers (more than meets the eye :o).
A few nights ago, I was watching NUMB3RS, this cop show dealy where they solve problems using math (crazy I know). But in the most recent episode, they talked about internet encryption and whatnot. This is the same kind of stuff we talked about in discrrete mathematics. How the encryption key can be factorised into the prime numbers that were used to create it. This is cause every number can only be factorised in ONE UNIQUE WAY.
So I proceeded to make a program that lists all primes, it did all the primes less than 1000 in a few seconds; pretty good. So I put in a big number, ooh, say, I don't know, 1 billion? That should do it. The program ran while I was asleep, and it wasn't even up to 2 million D: I might do something like make a program to implement the Euclidean algorithm, then again, I'm not entirely sure whether that's useful for breaking a number into it's primes... Although! ... I don't know, I'll think about this some more when I can be bothered.
Kinda makes you think. Simply printing the primes take forever. Imagine breaking down a number, with several hundred digits, in a series of primes. Crazy shit.
I... Am so nerdy at times...
Subscribe to:
Post Comments (Atom)
No comments:
Post a Comment