mersenneforum.org  

Go Back   mersenneforum.org > Extra Stuff > Miscellaneous Math

Reply
 
Thread Tools
Old 2010-09-24, 20:21   #683
kar_bon
 
kar_bon's Avatar
 
Mar 2006
Germany

22×727 Posts
Default

Quote:
Originally Posted by science_man_88 View Post
ms = micro seconds ? or do you know a trick you haven't said lol.
ms -> milli seconds = 10^-3
\mus -> micro seconds = 10^-6
kar_bon is offline   Reply With Quote
Old 2010-09-24, 20:30   #684
science_man_88
 
science_man_88's Avatar
 
"Forget I exist"
Jul 2009
Dumbassville

26×131 Posts
Default

Quote:
Originally Posted by kar_bon View Post
ms -> milli seconds = 10^-3
\mus -> micro seconds = 10^-6
I know I thought that but he said about micro seconds by pari reports ms.
science_man_88 is offline   Reply With Quote
Old 2010-09-24, 20:37   #685
CRGreathouse
 
CRGreathouse's Avatar
 
Aug 2006

597910 Posts
Default

Quote:
Originally Posted by science_man_88 View Post
I know I thought that but he said about micro seconds by pari reports ms.
Right. I ran 100,000 tests and divided to get the time per test. Each test took about 0.025 milliseconds.

Last fiddled with by CRGreathouse on 2010-09-24 at 20:38
CRGreathouse is offline   Reply With Quote
Old 2010-09-24, 20:39   #686
kar_bon
 
kar_bon's Avatar
 
Mar 2006
Germany

B5C16 Posts
Default

Quote:
Originally Posted by science_man_88 View Post
I know I thought that but he said about micro seconds by pari reports ms.
Sure you can't output or measure such timings for only one test. But do 10,000,000 tests and divide the total time by the number of tests!

CRG was faster.

Last fiddled with by kar_bon on 2010-09-24 at 20:40
kar_bon is offline   Reply With Quote
Old 2010-09-24, 20:43   #687
3.14159
 
3.14159's Avatar
 
May 2010
Prime hunting commission.

32208 Posts
Default

Quote:
Originally Posted by rajula View Post
I have the impression that 3.14 is testing numbers of the form k*2^m+1 with some small range of k's. That would fit the earlier posts and his use of the expression "no factors below x digits". (But of course you noticed this and just want to point out the silly claim )
Precisely. The strawmen were invalid.

The range I used was k = 1 to 5000.

Last fiddled with by 3.14159 on 2010-09-24 at 20:44
3.14159 is offline   Reply With Quote
Old 2010-09-24, 21:06   #688
3.14159
 
3.14159's Avatar
 
May 2010
Prime hunting commission.

24·3·5·7 Posts
Default

So far, the best idea is to manually use Proth's theorem to prove a number such as 3773512084578210152449 prime, with no computer assistance.

19^((3773512084578210152449-1)/2) modulo 3773512084578210152449, anyone?

Last fiddled with by 3.14159 on 2010-09-24 at 21:11
3.14159 is offline   Reply With Quote
Old 2010-09-24, 21:27   #689
science_man_88
 
science_man_88's Avatar
 
"Forget I exist"
Jul 2009
Dumbassville

26×131 Posts
Default

Quote:
Originally Posted by 3.14159 View Post
So far, the best idea is to manually use Proth's theorem to prove a number such as 3773512084578210152449 prime, with no computer assistance.

19^((3773512084578210152449-1)/2) modulo 3773512084578210152449, anyone?
well if you look at it the exponent simplifies to 1886756042289105076224 if i did the math correct.
science_man_88 is offline   Reply With Quote
Old 2010-09-24, 21:57   #690
science_man_88
 
science_man_88's Avatar
 
"Forget I exist"
Jul 2009
Dumbassville

26·131 Posts
Default

I would think the next attempt should use 19^ n = x mod(what number Pi wants to try modulo the whole thing by)
science_man_88 is offline   Reply With Quote
Old 2010-09-24, 22:16   #691
science_man_88
 
science_man_88's Avatar
 
"Forget I exist"
Jul 2009
Dumbassville

203008 Posts
Default

because:

1111111111


is what:

1111111111
1111111111
1111111111
1111111111
1111111111
1111111111
1111111111
1111111111
1111111111
1111111111

depends on: so really what's the number mod 19 that will help me a lot lol.
science_man_88 is offline   Reply With Quote
Old 2010-09-24, 22:30   #692
science_man_88
 
science_man_88's Avatar
 
"Forget I exist"
Jul 2009
Dumbassville

26×131 Posts
Default

if you want to know what I'm talking of I believe it can be stated as:

x^{y} % z = ((x % z)^{y}) % z

Last fiddled with by science_man_88 on 2010-09-24 at 22:31
science_man_88 is offline   Reply With Quote
Old 2010-09-24, 22:43   #693
3.14159
 
3.14159's Avatar
 
May 2010
Prime hunting commission.

24·3·5·7 Posts
Default

Yes, yes:

x^y mod z = (x mod z)^y. Next?

Last fiddled with by 3.14159 on 2010-09-24 at 22:56
3.14159 is offline   Reply With Quote
Reply

Thread Tools


Similar Threads
Thread Thread Starter Forum Replies Last Post
Prime posting thread, part 2. (With a catch.) 3.14159 Miscellaneous Math 55 2010-11-19 23:55
Tiny range request .... 555.1M petrw1 LMH > 100M 1 2010-07-13 15:35
Other primes thread nuggetprime No Prime Left Behind 32 2009-10-21 21:48
Error: tiny factoring failed 10metreh Msieve 26 2009-03-08 23:28
Tiny error on nfsnet pages. antiroach NFSNET Discussion 1 2003-07-08 00:27

All times are UTC. The time now is 21:46.


Fri Aug 6 21:46:48 UTC 2021 up 14 days, 16:15, 1 user, load averages: 2.41, 2.47, 2.52

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.