mersenneforum.org  

Go Back   mersenneforum.org > Search Forums

Showing results 1 to 25 of 1000
Search took 0.29 seconds.
Search: Posts Made By: R. Gerbicz
Forum: Lounge 2020-04-02, 09:27
Replies: 501
Views: 16,693
Posted By R. Gerbicz
https://medium.com/@dinber19/more-with-less-using-...

https://medium.com/@dinber19/more-with-less-using-pooling-to-detect-coronavirus-with-fewer-tests-8ba1a2cd8b67
https://www.medrxiv.org/content/10.1101/2020.03.26.20039438v1

Pretty trivial, I...
Forum: Puzzles 2020-03-28, 14:41
Replies: 6
Views: 591
Posted By R. Gerbicz
OK, done, you know I'm as a Hungarian using that...

OK, done, you know I'm as a Hungarian using that date format, but as "Ibm ponder this" used the different format so used that. We are using lots of other things in different order say the first name...
Forum: Conjectures 'R Us 2020-03-27, 20:31
Replies: 32
Views: 1,382
Posted By R. Gerbicz
You need less, for example for k=9 you need the...

You need less, for example for k=9 you need the algebraic factor only for n==0 mod 6, because the 9*1024^n-1 sequence for
n==1 mod 2 is divisible by 5
n==2 mod 6 is divisible by 7
n==4 mod 6 is...
Forum: Puzzles 2020-03-27, 18:08
Replies: 6
Views: 591
Posted By R. Gerbicz
Thanks, I've not participated on the monthly...

Thanks, I've not participated on the monthly competition since September 2017.
And these are all of my (unedited) messages, so in rare cases you could see that my first submission was wrong (but in...
Forum: Conjectures 'R Us 2020-03-27, 15:14
Replies: 32
Views: 1,382
Posted By R. Gerbicz
gd_barnes is right, to extend his post: to get...

gd_barnes is right, to extend his post:
to get a riesel/sierpinski cover you have to use d_i divisors in each remainder class in the covering set, you can't use algebraic factors, you can't use even...
Forum: Puzzles 2020-03-26, 23:46
Replies: 6
Views: 591
Posted By R. Gerbicz
Collected Ibm ponder this solutions

See: https://github.com/gerbicz/Ibm-Ponder-This
Forum: Mlucas 2020-03-23, 13:08
Replies: 32
Views: 3,063
Posted By R. Gerbicz
Are you using error checking for the last few...

Are you using error checking for the last few iterations, in your case (928393) ?
You can do this in multiple ways.
Say forcing an error check at 103928000 and then (boring) double checking the...
Forum: enzocreti 2020-03-22, 08:39
Replies: 6
Views: 304
Posted By R. Gerbicz
Multiple the equation by 10^(6*k), since it is...

Multiple the equation by 10^(6*k), since it is cube and square if there is a solution for n=N, then there is a solution for N+6*k.
Forum: enzocreti 2020-03-21, 21:51
Replies: 6
Views: 304
Posted By R. Gerbicz
Yes.

Yes.
Forum: PARI/GP 2020-03-20, 19:13
Replies: 32
Views: 821
Posted By R. Gerbicz
Corrected, there were multiple typos in the post.

Corrected, there were multiple typos in the post.
Forum: PARI/GP 2020-03-20, 18:16
Replies: 32
Views: 821
Posted By R. Gerbicz
No, the rational roots will be shorter, due to...

No, the rational roots will be shorter, due to https://en.wikipedia.org/wiki/Rational_root_theorem

To find "only" the rational roots, you could (fully) factorize the polynom, an easier/faster way...
Forum: GPU Computing 2020-02-27, 17:31
Replies: 293
Views: 24,745
Posted By R. Gerbicz
Correction, you need k*Mn=k*2^n-k, likely it is...

Correction, you need k*Mn=k*2^n-k, likely it is not worth.
It was already suggested, for general number it is still worth, say for N=n! [it has short form, but the prp test isn't faster on this],...
Forum: Lounge 2020-02-27, 09:14
Replies: 4
Views: 348
Posted By R. Gerbicz
It is not that hard to see that in the first n...

It is not that hard to see that in the first n digits there could be only O(n/log(n)) self-repeating positions.

And surprisingly this is reachable by a trancendental number:
let...
Forum: Lounge 2020-02-26, 23:29
Replies: 4
Views: 348
Posted By R. Gerbicz
x=sum(n=1,inf,0.1^(10^(n!))) is a trancendental...

x=sum(n=1,inf,0.1^(10^(n!))) is a trancendental number(!) (see https://en.wikipedia.org/wiki/Liouville_number), and obviously it is self locating at k=10^(n!) positions. OK, this gives only...
Forum: enzocreti 2020-02-17, 16:35
Replies: 5
Views: 305
Posted By R. Gerbicz
There is an exception, for n=0 it is a prime.

There is an exception, for n=0 it is a prime.
Forum: Miscellaneous Math 2020-02-10, 15:41
Replies: 6
Views: 482
Posted By R. Gerbicz
Found only one cycle with start number>1e6, that...

Found only one cycle with start number>1e6, that is n=3958368 with cycle length=16.
It is easy to see that the length should be divisible by four, and n mod 10 is in {2,4,6,8}.

And if we'd delete...
Forum: Cloud Computing 2020-02-08, 00:53
Replies: 939
Views: 33,617
Posted By R. Gerbicz
Nice, the last point is also important: ...

Nice, the last point is also important:

"Where is Colab Pro available?
For now, Colab Pro is only available in the US."
Forum: y-cruncher 2020-02-07, 09:19
Replies: 16
Views: 4,019
Posted By R. Gerbicz
"Sean Shannon (Canada) recited Hamlet's soliloquy...

"Sean Shannon (Canada) recited Hamlet's soliloquy `To be or not to be' (260 words) in a time of 23.8 seconds"

Doable, pretty short words.
Forum: Homework Help 2020-01-30, 09:55
Replies: 8
Views: 1,269
Posted By R. Gerbicz
With proper education you can learn that first at...

With proper education you can learn that first at high school.
Forum: Math 2020-01-28, 15:23
Replies: 3
Views: 494
Posted By R. Gerbicz
See http://oeis.org/A061644 .

See http://oeis.org/A061644 .
Forum: Computer Science & Computational Number Theory 2020-01-28, 08:49
Replies: 79
Views: 9,481
Posted By R. Gerbicz
Trivial note: it is faster to reduce the exponent...

Trivial note: it is faster to reduce the exponent mod (p-1) [use Fermat's little theorem].
Forum: Computer Science & Computational Number Theory 2020-01-25, 20:52
Replies: 79
Views: 9,481
Posted By R. Gerbicz
Have you checked that: (3^(2^(2^m)) mod F_n)...

Have you checked that:
(3^(2^(2^m)) mod F_n) mod q = 3^(2^(2^m)) mod q
is true for the stored interim residues?

Since you have 3^(2^(2^m)) mod F_n then to get the left side is trivial and you...
Forum: Software 2020-01-20, 21:53
Replies: 9
Views: 1,405
Posted By R. Gerbicz
And looks like he is using my error check, very...

And looks like he is using my error check, very good!
Forum: Programming 2020-01-12, 13:51
Replies: 5
Views: 486
Posted By R. Gerbicz
Why not use formula for cos(x+y) and sin(x+y) to...

Why not use formula for cos(x+y) and sin(x+y) to reduce the errors?
Get sin(10*n) from the previously computed sin(5*n),cos(5*n)
sin(9*n) from sin(4*n),cos(4*n) and sin(5*n),cos(5*n)
etc.
Forum: Data 2020-01-01, 15:06
Replies: 109
Views: 13,663
Posted By R. Gerbicz
Probably the main reason is that there is no...

Probably the main reason is that there is no error ?
Showing results 1 to 25 of 1000

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

Sat Apr 4 16:21:07 UTC 2020 up 10 days, 13:54, 1 user, load averages: 2.20, 2.04, 1.88

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2020, 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.