Forum: Miscellaneous Math
2021-03-04, 18:03
|
|
Replies: 10
Views: 231
Destroyed?
rate=0.1;year=21;(1+rate)^year ...
Destroyed?
rate=0.1;year=21;(1+rate)^year
rate=0.03;year=3;(1-(1+rate)^(-year))/rate
answer:
%1 = 7.4002499442581601012110000000000000000
%2 = 2.8286113548946809221333416306177114687
|
|
Forum: Factoring
2021-03-03, 15:21
|
|
Replies: 10
Views: 1,110
An early slide from him:...
An early slide from him: https://eurocrypt2009rump.cr.yp.to/e074d37e10ad1ad227200ea7ba36cf73.pdf
Forums about these claims:...
|
|
Forum: Miscellaneous Math
2021-03-02, 20:32
|
|
Replies: 5
Views: 247
Very standard heuristic idea gives that we are...
Very standard heuristic idea gives that we are expecting very few [maybe zero] composites for G=nextprime(n!)-n! [if we exclude the G<2 cases].
As you noted to find composite G we need G>n^2 so...
|
|
Forum: Data
2021-02-24, 20:17
|
|
Replies: 549
Views: 74,883
We had already a Prp-cf test on this: ...
We had already a Prp-cf test on this:
https://www.mersenne.org/report_exponent/?exp_lo=82939&exp_hi=&full=1
Notice that for N=(k*2^n+c)/d we're using a Fermat test using
base^d as base, then...
|
|
Forum: Miscellaneous Math
2021-02-20, 09:53
|
|
Replies: 4
Views: 176
|
|
Forum: Miscellaneous Math
2021-02-19, 20:18
|
|
Replies: 32
Views: 1,401
|
|
Forum: Miscellaneous Math
2021-02-19, 15:18
|
|
Replies: 32
Views: 1,401
|
|
Forum: Miscellaneous Math
2021-02-19, 10:36
|
|
Replies: 32
Views: 1,401
And with linear algebra would you need...
And with linear algebra would you need primepi(100)+eps=25+eps relations ?
OK, take my challenge factor my GRSA100 [G means Gerbicz], n=p*q number with 100 digits. You can use "your" method, and...
|
|
Forum: Miscellaneous Math
2021-02-19, 08:22
|
|
Replies: 32
Views: 1,401
|
|
Forum: Miscellaneous Math
2021-02-19, 01:00
|
|
Replies: 32
Views: 1,401
|
|
Forum: Information & Answers
2021-02-15, 17:10
|
|
Replies: 26
Views: 933
Oh, yes that is even better what I've written,...
Oh, yes that is even better what I've written, and maybe: forcing that the server wouldn't give out the same prime exponent twice per day. In this way even if you have a fully factorized mp you would...
|
|
Forum: Information & Answers
2021-02-14, 23:39
|
|
Replies: 26
Views: 933
Interesting topic. Still don't see a way, my...
Interesting topic. Still don't see a way, my failed approach in the prp(!) setup:
The key idea is to change the base after a successful mining to a random base with say 64 bits.
And then the new...
|
|
Forum: Homework Help
2021-02-13, 21:46
|
|
Replies: 3
Views: 309
If x is composite then we know: ...
If x is composite then we know:
c*x/log(log(x))<phi(x)<=x-sqrt(x), where c>0 is a constant [c=0.25 is good for all x>6].
ok, not very elegant to use these, though this is still elementary.
With...
|
|
Forum: Chess
2021-01-31, 19:40
|
|
Replies: 12
Views: 977
|
|
Forum: Chess
2021-01-31, 15:02
|
|
Replies: 12
Views: 977
Even easier way if you want to encode only a...
Even easier way if you want to encode only a single/few game:
use a generalized number system, say in the i-th move you have only B[i] valid moves you have chosen the r[i]-th move from these. And...
|
|
Forum: Chess
2021-01-31, 13:02
|
|
Replies: 12
Views: 977
You can reach almost the optimal log(13)/log(2)...
You can reach almost the optimal log(13)/log(2) bits difficulty when you have 13 possibilities
for a move. The idea is that for each p number of possibility maintain a seperate array to
extract the...
|
|
Forum: Chess
2021-01-17, 12:50
|
|
Replies: 2
Views: 345
See:...
See: https://chess.stackexchange.com/questions/4490/maximum-possible-movement-in-a-turn
|
|
Forum: Puzzles
2021-01-04, 20:50
|
|
Replies: 13
Views: 1,010
We need for a given x>0 that...
We need for a given x>0 that x=a+..+(a+b)=(2*a+b)*(b+1)/2 with a,b>0
So: 2*x=(2*a+b)*(b+1)
Notice that 2*a+b and b+1 has different parity, hence if x is a power of two
then this equation has no...
|
|
Forum: Forum Feedback
2020-12-26, 16:25
|
|
Replies: 4
Views: 677
|
|
Forum: Programming
2020-12-25, 18:54
|
|
Replies: 38
Views: 11,326
|
|
Forum: Math
2020-12-15, 00:53
|
|
Replies: 16
Views: 972
|
|
Forum: Tales From the Crypt(o)
2020-12-13, 19:55
|
|
Replies: 7
Views: 904
Probably not found, all of them looks like...
Probably not found, all of them looks like gibberish, but here it is:
using a wordlist of size=9027 [basically a 10k list, but deleted all words with length<4 that was not in a 4k list]. All...
|
|
Forum: y-cruncher
2020-12-08, 12:25
|
|
Replies: 49
Views: 29,929
|
|
Forum: y-cruncher
2020-12-08, 10:59
|
|
Replies: 49
Views: 29,929
That's why your suggested methods is just not...
That's why your suggested methods is just not working (needs to repeat the whole computation), but my proposed way is using much less time.
For comparison in this record size the BBP takes less than...
|
|
Forum: y-cruncher
2020-12-07, 14:05
|
|
Replies: 49
Views: 29,929
|
