bbb120

bbb120 · 2019-02-26, 02:24

I register this forum about ten years ago ,
my username is bbb120(from China),but it is
impossible for me to get my password by email ,
because the bbb120 is not in use,
I do not know why !
I register this old name by an new email today ,
but how can I find my old posts(maybe thread),
my English is not very well,there maybe some
mistake in this thread.

bbb120 · 2019-02-26, 04:38

I make a mistake ,
my old username is "aaa120" not "bbb120"
but I forgot the password of aaa120,and I can not
get the password of aaa120

bbb120 · 2019-02-26, 04:44

Quote:

Originally Posted by yoyo

A yoyo@home user found a P73 for R1186 (10^593+1):

Code:

GMP-ECM 7.0.5-dev [configured with GMP 6.1.2, --enable-asm-redc] [ECM]
Input number is 9090909090909090909090909090909090909090909090909090909090909090909090909090909090909090909090909090909090909090909090909090909090909090909090909090909090909090909090909090909090909090909090909090909090909090909090909090909090909090909090909090909090909090909090909090909090909090909090909090909090909090909090909090909090909090909090909090909090909090909090909090909090909090909090909090909090909090909090909090909090909090909090909090909090909090909090909090909090909090909090909090909090909090909090909090909090909090909090909090909090909090909090909090909090909090909090909090909090909091 (592 digits)
[Tue Nov 07 18:14:21 2017]
Using MODMULN [mulredc:4, sqrredc:4]
Using B1=110000000, B2=829850101096, polynomial Dickson(30), sigma=0:16299314430696221325
dF=120960, k=5, d=1291290, d2=17, i0=69
Expected number of curves to find a factor of n digits:
35	40	45	50	55	60	65	70	75	80
34	134	608	3119	17689	110056	743875	5417128	4.2e+07	3.6e+08
Writing checkpoint to checkpnt at p = 20333393
Writing checkpoint to checkpnt at p = 40506859
Writing checkpoint to checkpnt at p = 60560629
Writing checkpoint to checkpnt at p = 80690453
Writing checkpoint to checkpnt at p = 101083799
Writing checkpoint to checkpnt at p = 110000000
Step 1 took 3247765ms
Estimated memory usage: 1.64GB
Initializing tables of differences for F took 1984ms
Computing roots of F took 63375ms
Building F from its roots took 27093ms
Computing 1/F took 12141ms
Initializing table of differences for G took 2609ms
Computing roots of G took 51422ms
Building G from its roots took 26860ms
Computing roots of G took 55781ms
Building G from its roots took 27016ms
Computing G * H took 6610ms
Reducing  G * H mod F took 9781ms
Computing roots of G took 56922ms
Building G from its roots took 26859ms
Computing G * H took 6766ms
Reducing  G * H mod F took 9797ms
Computing roots of G took 57312ms
Building G from its roots took 26594ms
Computing G * H took 6750ms
Reducing  G * H mod F took 9829ms
Computing roots of G took 57171ms
Building G from its roots took 27079ms
Computing G * H took 6422ms
Reducing  G * H mod F took 9390ms
Computing polyeval(F,G) took 57781ms
Computing product of all F(g_i) took 344ms
Step 2 took 644328ms
********** Factor found in step 2: 2909076542620598524499532435958736860811671130747534094532375046661903161
Found prime factor of 73 digits: 2909076542620598524499532435958736860811671130747534094532375046661903161
Probable prime cofactor 3125015432807993452395038634013309617867717582914358894173268713097150537376427232621985983364362381037572308793912508473244215581788783050366433021306602205095695585123360825687037384480936324147844060907653636389193668837605678869741546508709934354266735495475343271268446929051785779649633066534259397463567093895758026730277823815590724554798361272711560580416081789809541777798773606334712701416644206700894936206530047039287732255861170965984971136826555598096883703505206688714709410112221639166983114001153395131 has 520 digits
Report your potential champion to Richard Brent <champs@rpbrent.com>
(see http://wwwmaths.anu.edu.au/~brent/ftp/champs.txt)
Peak memory usage: 1469MB

Great!
Good Job!

bbb120 · 2019-02-26, 04:44

Quote:

Originally Posted by yoyo

A yoyo@home user found a P73 for R1186 (10^593+1):

Code:

GMP-ECM 7.0.5-dev [configured with GMP 6.1.2, --enable-asm-redc] [ECM]
Input number is 9090909090909090909090909090909090909090909090909090909090909090909090909090909090909090909090909090909090909090909090909090909090909090909090909090909090909090909090909090909090909090909090909090909090909090909090909090909090909090909090909090909090909090909090909090909090909090909090909090909090909090909090909090909090909090909090909090909090909090909090909090909090909090909090909090909090909090909090909090909090909090909090909090909090909090909090909090909090909090909090909090909090909090909090909090909090909090909090909090909090909090909090909090909090909090909090909090909090909091 (592 digits)
[Tue Nov 07 18:14:21 2017]
Using MODMULN [mulredc:4, sqrredc:4]
Using B1=110000000, B2=829850101096, polynomial Dickson(30), sigma=0:16299314430696221325
dF=120960, k=5, d=1291290, d2=17, i0=69
Expected number of curves to find a factor of n digits:
35	40	45	50	55	60	65	70	75	80
34	134	608	3119	17689	110056	743875	5417128	4.2e+07	3.6e+08
Writing checkpoint to checkpnt at p = 20333393
Writing checkpoint to checkpnt at p = 40506859
Writing checkpoint to checkpnt at p = 60560629
Writing checkpoint to checkpnt at p = 80690453
Writing checkpoint to checkpnt at p = 101083799
Writing checkpoint to checkpnt at p = 110000000
Step 1 took 3247765ms
Estimated memory usage: 1.64GB
Initializing tables of differences for F took 1984ms
Computing roots of F took 63375ms
Building F from its roots took 27093ms
Computing 1/F took 12141ms
Initializing table of differences for G took 2609ms
Computing roots of G took 51422ms
Building G from its roots took 26860ms
Computing roots of G took 55781ms
Building G from its roots took 27016ms
Computing G * H took 6610ms
Reducing  G * H mod F took 9781ms
Computing roots of G took 56922ms
Building G from its roots took 26859ms
Computing G * H took 6766ms
Reducing  G * H mod F took 9797ms
Computing roots of G took 57312ms
Building G from its roots took 26594ms
Computing G * H took 6750ms
Reducing  G * H mod F took 9829ms
Computing roots of G took 57171ms
Building G from its roots took 27079ms
Computing G * H took 6422ms
Reducing  G * H mod F took 9390ms
Computing polyeval(F,G) took 57781ms
Computing product of all F(g_i) took 344ms
Step 2 took 644328ms
********** Factor found in step 2: 2909076542620598524499532435958736860811671130747534094532375046661903161
Found prime factor of 73 digits: 2909076542620598524499532435958736860811671130747534094532375046661903161
Probable prime cofactor 3125015432807993452395038634013309617867717582914358894173268713097150537376427232621985983364362381037572308793912508473244215581788783050366433021306602205095695585123360825687037384480936324147844060907653636389193668837605678869741546508709934354266735495475343271268446929051785779649633066534259397463567093895758026730277823815590724554798361272711560580416081789809541777798773606334712701416644206700894936206530047039287732255861170965984971136826555598096883703505206688714709410112221639166983114001153395131 has 520 digits
Report your potential champion to Richard Brent <champs@rpbrent.com>
(see http://wwwmaths.anu.edu.au/~brent/ftp/champs.txt)
Peak memory usage: 1469MB

Great!
Good Job!

Batalov · 2019-02-26, 07:43

Quote:

Originally Posted by bbb120

...but how can I find my old posts(maybe thread),

https://mersenneforum.org/search.php?searchid=2471168
https://mersenneforum.org/search.php :: Search by user name

What were you trying to find there?

Batalov · 2019-02-26, 07:49

One thing that we will try to discourage you to do is:
find some 8-year old post then quote it completely and simply add: 'that's great!'

You've already done it twice and it is annoying. This behavior is called 'necroposting'.
Don't do that.

bbb120 · 2019-02-28, 07:05

Quote:

Originally Posted by Puzzle-Peter

Just for fun I tried 2^73360+10711 once again with PRIMO 4.10. This version was successful in test1 thanks to the new discriminant tables. It will be an on-and-off job, but I will continue this run unless somebody else would rather do it.

You can use mathematica ,function PrimeQ[2^73360+10711]

Code:

MillerRabin[n0_,a0_]:=Module[{n=n0,a=a0,s,m,t1,k},
    s=0;m=n-1;While[Mod[m,2]==0,m=m/2;s=s+1];
    t1=PowerMod[a,m,n];
    If[t1==1,Return[True]];
    k=0;While[k<s-1&&t1!=n-1,k=k+1;t1=Mod[t1^2,n]];
    If[t1==n-1,Return[True],Return[False]]
]

Miller Rabin code by using mathematica,

MillerRabin[2^73360+10711, #] & /@ {17, 257, 65537, 10^200 + 267}
{True, True, True, True}
this is too fast,ECPP is too slow,

miller rabin is simple and realible!

bbb120 · 2019-02-28, 07:21

Quote:

Originally Posted by philmoore

Congratulations to Ben Maloney (paleseptember) who discovered the probable prime $2^{1518191}+75353$ . At 457,022 decimal digits, it should soon appear as the new probable prime record at the website of Henri and Renaud Lifchitz,

2887148238050771212671429597130393991977609459279722700926516024197432\
3037991527331163289831446392259419778031109293496555784189494417409338\
0561511397999942154241693397290542371100275104208013496673175515285922\
6962916775325475044445856101949404200039904432116776619949629539250452\
6987193290703735640322737012784538991261203092448414947289768854060249\
76768122077071687938121709811322297802059565867
this 397 digits composite number pass the miller rabin test base from 2 to 306，
so you should use at least one lucas test on probable prime !

Batalov · 2019-02-28, 15:20

You have been previously warned.
For now, your non-sequitur necroposts will be moved here.
Later you may receive a ban.

If you want to say something new about a discussion that ended several years ago - start a new thread!

retina · 2019-02-28, 16:52

Quote:

Originally Posted by Batalov

If you want to say something new about a discussion that ended several years ago - start a new thread!

Why is it necessary to start a new topic? I haven't seen anything on this board that disallows responding to an existing topic with pertinent information.

Uncwilly · 2019-02-28, 19:08

Quote:

Originally Posted by retina

Why is it necessary to start a new topic? I haven't seen anything on this board that disallows responding to an existing topic with pertinent information.

Necroposting a few time is in the spammer's MO. It is also easier to find things to tack onto an old post to appear to be adding valid comments.

2019-02-26, 02:24	#1
bbb120 "谁改我名死全�" Feb 2019 朱晓丹没人草 142₁₀ Posts	bbb120 I register this forum about ten years ago , my username is bbb120(from China),but it is impossible for me to get my password by email , because the bbb120 is not in use, I do not know why ! I register this old name by an new email today , but how can I find my old posts(maybe thread), my English is not very well,there maybe some mistake in this thread.

2019-02-26, 04:38	#2
bbb120 "谁改我名死全�" Feb 2019 朱晓丹没人草 216₈ Posts	I make a mistake , my old username is "aaa120" not "bbb120" but I forgot the password of aaa120,and I can not get the password of aaa120

2019-02-26, 07:49	#6
Batalov "Serge" Mar 2008 San Diego, Calif. 3²·7·163 Posts	One thing that we will try to discourage you to do is: find some 8-year old post then quote it completely and simply add: 'that's great!' You've already done it twice and it is annoying. This behavior is called 'necroposting'. Don't do that.

2019-02-28, 15:20	#9
Batalov "Serge" Mar 2008 San Diego, Calif. 3²×7×163 Posts	You have been previously warned. For now, your non-sequitur necroposts will be moved here. Later you may receive a ban. If you want to say something new about a discussion that ended several years ago - start a new thread!