NOTE: use Perl; is on undef hiatus. You can read content, but you can't post it. More info will be forthcoming forthcomingly.
All the Perl that's Practical to Extract and Report
Stories, comments, journals, and other submissions on use Perl; are Copyright 1998-2006, their respective owners.
Well... (Score:2)
I googled for it.
Re:Well... (Score:2)
Which works for stage 2 of the problem as well.
Isn't google wonderful..."
Re:Well... (Score:1)
Re:Well... (Score:1)
my guess was wrong (Score:1)
The digits of e go on forever and don't repeat, so I guessed that any consecutive sequence of 10 digits is found in e. Then just google for a list of prime numbers and find the first one in this list [prime-numbers.org]. However, I didn't find that URL. Now I realize that what they really meant was to find the first 10-digit sequence in e (like by dragging a 10-digit window from left to right along the number) which happens to be a prime number, not the first prime number that happens to be in e.
Next I'd try to find an alphab
Lemme guess (Score:1)
Of course you can just use [cpan://Math::Pari] to do the calculation for you. I did it using factorint and looking for a ; in the complete factorization. Who cares how much computer effort that wastes when it takes under a tenth of a second to run?
Re:Lemme guess (Score:2)
Got it! (Score:1)
Re:Got it! (Score:1)