Forum: Math
2003-03-08, 13:21
|
|
Replies: 4
Views: 2,362
quantum computer
You often hear folks saying a quantum computer would be able to factor numbers into its prime factors very, very fast. Now I wonder, how good will these comptuers be at determine if a number is a...
|
Forum: Math
2002-10-09, 11:58
|
|
Replies: 7
Views: 2,285
|
Forum: Math
2002-10-08, 19:49
|
|
Replies: 7
Views: 2,285
|
Forum: Math
2002-10-08, 10:23
|
|
Replies: 7
Views: 2,285
|
Forum: Math
2002-10-07, 19:18
|
|
Replies: 8
Views: 2,472
If I want to calculate 2^(p-1) mod p, i would...
If I want to calculate 2^(p-1) mod p, i would have to do something like 10^(10^9) multiplications with 2 modulo p. Using a computer which can do 10^12 modulo multiplications per second, the operation...
|
Forum: Math
2002-10-07, 18:54
|
|
Replies: 7
Views: 2,285
Another BIG number
I have a feeling that the number 19683^(387420489)-2 is either a square or on the form a^a. Anybody wanna help me prove it?
ps. If anybody doesnt like me asking non-mersenne questions, then just...
|
Forum: Math
2002-10-07, 08:11
|
|
Replies: 8
Views: 2,472
|
Forum: Math
2002-10-06, 19:17
|
|
Replies: 8
Views: 2,472
testing big numbers
This may be the wrong place to ask, but is there some way to test a number with 10^9 digits for being prime? The number is on the form
a^(a^b) - a - 1, so its not a mersenne prime.
I realize i...
|