mersenneforum.org  

Go Back   mersenneforum.org > Search Forums

Showing results 1 to 8 of 8
Search took 0.01 seconds.
Search: Posts Made By: sagan_fan
Forum: Math 2003-03-08, 13:21
Replies: 4
Views: 2,362
Posted By sagan_fan
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
Posted By sagan_fan
Oh, yeah,now I see. He just took the natural...

Oh, yeah,now I see. He just took the natural logarithm of both sides...
Forum: Math 2002-10-08, 19:49
Replies: 7
Views: 2,285
Posted By sagan_fan
I don't really understand your proof. Where did...

I don't really understand your proof. Where did 200390688 come from? What's an ABC conjecture?
Anyway, i guess I have to trust you. Looks like i've gotta rewrite my theories a little....
Forum: Math 2002-10-08, 10:23
Replies: 7
Views: 2,285
Posted By sagan_fan
Yes, it is, that was the way i found the number,...

Yes, it is, that was the way i found the number, I just thought it might be better to write in exponential form.
Forum: Math 2002-10-07, 19:18
Replies: 8
Views: 2,472
Posted By sagan_fan
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
Posted By sagan_fan
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
Posted By sagan_fan
Howlong time would it take to do a test using...

Howlong time would it take to do a test using fermats little theorem with the base 2? That is calculate 2^(p-1) mod p and see if it is 1.
Forum: Math 2002-10-06, 19:17
Replies: 8
Views: 2,472
Posted By sagan_fan
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...
Showing results 1 to 8 of 8

 
All times are UTC. The time now is 17:44.


Fri Jul 16 17:44:06 UTC 2021 up 49 days, 15:31, 1 user, load averages: 1.29, 1.44, 1.48

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2021, Jelsoft Enterprises Ltd.

This forum has received and complied with 0 (zero) government requests for information.

Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published by the Free Software Foundation.
A copy of the license is included in the FAQ.