mersenneforum.org  

Go Back   mersenneforum.org > Search Forums

Showing results 1 to 18 of 18
Search took 0.01 seconds.
Search: Posts Made By: Batalov
Forum: And now for something completely different 2021-06-24, 21:48
Replies: 47
Views: 20,888
Posted By Batalov
Is that a riddle? We give up. What is the answer?...

Is that a riddle? We give up. What is the answer? :rolleyes:
Forum: And now for something completely different 2020-05-20, 00:05
Replies: 47
Views: 20,888
Posted By Batalov
I think I see. Does it take care of...

I think I see.

Does it take care of Conjecture 2, as well?
Forum: And now for something completely different 2020-05-19, 20:34
Replies: 47
Views: 20,888
Posted By Batalov
David Broadhurst wrote: ...and I can see...

David Broadhurst wrote:

...and I can see that first proposition holds really well, just try it in PARI and you will find that Mod(2,p)^((p-1)/2) is -1 for even n, and +1 for odd n values.
...
Forum: And now for something completely different 2020-05-18, 18:09
Replies: 47
Views: 20,888
Posted By Batalov
I have identified two enormous new top entries...

I have identified two enormous new top entries for the "Divides Phi" category; they will probably appear in a few days. (they are previously identified as primes)

One of them has m << n *. I even...
Forum: And now for something completely different 2019-03-07, 20:50
Replies: 47
Views: 20,888
Posted By Batalov
"...right now"!? Are you for real? Isn't it...

"...right now"!? Are you for real?
Isn't it self-explanatory using just this one post why you are on the ignore list?
And with posts like this you are not going to get off it, I can guarantee you...
Forum: And now for something completely different 2019-03-07, 20:39
Replies: 47
Views: 20,888
Posted By Batalov
The category is called "Divides Phi". Not...

The category is called "Divides Phi".
Not "Divides Phi(b^n,2)".


It is an obvious extension (a superset) of the set of "Divides Fermat Number (https://primes.utm.edu/top20/page.php?id=8)"....
Forum: And now for something completely different 2019-03-07, 00:45
Replies: 47
Views: 20,888
Posted By Batalov
What could it be? /scratches head/

What could it be?
/scratches head/
Forum: And now for something completely different 2019-03-06, 16:18
Replies: 47
Views: 20,888
Posted By Batalov
And wrong again. You appear to look but not...

And wrong again.
You appear to look but not see. (Also explains your endless threads with miniature results.)

Look carefully at these first two lines (posted before) --
----- ...
Forum: And now for something completely different 2019-03-06, 04:23
Replies: 47
Views: 20,888
Posted By Batalov
Wrong again. 2*695^94625+1 Divides...

Wrong again.
2*695^94625+1 Divides Phi(695^94625/5^4,2) [g427] [268924 digits] L1471 2011
Forum: And now for something completely different 2019-03-05, 17:06
Replies: 47
Views: 20,888
Posted By Batalov
That is false. ----- ...

That is false.
----- -------------------------------- ------- ----- ---- --------------
rank description digits who year comment
----- --------------------------------...
Forum: And now for something completely different 2019-01-26, 23:54
Replies: 47
Views: 20,888
Posted By Batalov
It's a lot of iron and a good choice of...

It's a lot of iron and a good choice of candidates :rolleyes:
...and having the DivPhi self-compiled binary.
Put these three together and you got something.
Forum: And now for something completely different 2015-06-03, 00:02
Replies: 47
Views: 20,888
Posted By Batalov
After the recent George's fix to the foundation...

After the recent George's fix to the foundation (which allows choosing fast special FFT where available, much faster than a general mod), the search for a 2*67607^n+1 prime (and a likely Divides Phi...
Forum: And now for something completely different 2014-10-10, 18:25
Replies: 47
Views: 20,888
Posted By Batalov
Thanks. Of course a prime q=383, 647, 947 or...

Thanks.

Of course a prime q=383, 647, 947 or 67607 (no known primes) would have been so much nicer, but after quite a bit of time spent on them nothing yet was found. So, a small fishing...
Forum: And now for something completely different 2014-10-03, 19:32
Replies: 47
Views: 20,888
Posted By Batalov
the order-of-2 (mod p) test

I have modded LLR to run a naively refactored order-of-2-mod p test instead of Proth.exe (and even though naive, this is a fast solution; as fast as the primality test, 1-2 hr max; this is what I...
Forum: And now for something completely different 2014-09-28, 01:52
Replies: 47
Views: 20,888
Posted By Batalov
Certainly. But this time with a proof of...

Certainly.

But this time with a proof of Dividing Phi first, and submitting second. It should show up in the top in about two hours, with overall rank ~271.
Forum: And now for something completely different 2014-09-27, 21:04
Replies: 47
Views: 20,888
Posted By Batalov
All of these initial labels get manually promoted...

All of these initial labels get manually promoted by C. "The Prime Mogul " C.

Or 'demoted' as the case may be for "Divides xGF(n,a,b)!!!!" that get automatically submitted by the PrimeGrid's...
Forum: And now for something completely different 2014-09-27, 17:53
Replies: 47
Views: 20,888
Posted By Batalov
Keller (with Ingo Buechel) once reported to have...

Keller (with Ingo Buechel) once reported to have searched k=2 for bases 383 (limit 433k), 467 (347k; a prime found in 2006!), 647 (322k), 947 (105k), 67607 (412k !!). These series have no known...
Forum: And now for something completely different 2014-09-27, 03:02
Replies: 47
Views: 20,888
Posted By Batalov
Post "Divides Phi" category

This is an interesting category, and Keller, Broadhurst and others submitted many such primes. The test for it is implemented in the old Y.Gallot's Proth.exe (the newest executable is >10 years old...
Showing results 1 to 18 of 18

 
All times are UTC. The time now is 09:32.


Wed Dec 1 09:32:26 UTC 2021 up 131 days, 4:01, 1 user, load averages: 1.28, 1.27, 1.28

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.