mersenneforum.org  

Go Back   mersenneforum.org > Search Forums
Reload this Page Search Results
Register FAQ Search Today's Posts Mark Forums Read

Page 1 of 3 1 23
Showing results 1 to 25 of 59
Search took 0.01 seconds. Search: Posts Made By: bbb120
Forum: FermatSearch 2020-11-27, 02:33
Replies: 65
Views: 5,033
Posted By bbb120
http://www.numberworld.org/y-cruncher/internals/bi...

http://www.numberworld.org/y-cruncher/internals/binary-splitting-library.html#pi_chudnovsky
maybe this is answer
Forum: y-cruncher 2020-11-18, 05:33
Replies: 49
Views: 25,463
Posted By bbb120
chinese 10,000=1万=10 thousand ...

chinese
10,000=1万=10 thousand
100,000,000=1亿=100 million

123456789123456789=123_456_789_123_456_789(English)
123456789123456789=12_3456_7891_2345_6789(chinese)
English grouping digits three by...
Forum: y-cruncher 2020-11-18, 01:05
Replies: 49
Views: 25,463
Posted By bbb120
F33 only has no more than 2700 billion digits ...

F33 only has no more than 2700 billion digits
it should be "F33 only has no more than 2700 million digits"
I make a mistake !
floor(2^33*log(2)+1)=floor(2585827973.98)
...
Forum: y-cruncher 2020-11-17, 06:18
Replies: 49
Views: 25,463
Posted By bbb120
What are the advantages of y-cruncher ? Why...

What are the advantages of y-cruncher ?
Why can it calculate so many digits?
https://www.mersenneforum.org/showpost.php?p=562790&postcount=14
why we can calculate 50 trillion digits of Pi ,but...
Forum: Five or Bust - The Dual Sierpinski Problem 2020-11-17, 06:13
Replies: 8
Views: 2,146
Posted By bbb120
How can I run PRP test?

which software can give a PRP test ?
how long does it cost ?
Forum: FermatSearch 2020-11-12, 01:55
Replies: 65
Views: 5,033
Posted By bbb120
you don't know Google and Wikipedia and Twitter...

you don't know Google and Wikipedia and Twitter and Facebook and YouTube
can not be used in some country
Forum: FermatSearch 2020-11-12, 01:17
Replies: 65
Views: 5,033
Posted By bbb120
http://numbers.computation.free.fr/Constants/Algor...

http://numbers.computation.free.fr/Constants/Algorithms/splitting.html

In mathematics, binary splitting is a technique for speeding up numerical evaluation of many types of series with rational...
Forum: FermatSearch 2020-11-11, 02:34
Replies: 65
Views: 5,033
Posted By bbb120
what does binary splitting mean? can you give...

what does binary splitting mean?
can you give more information about binary splitting ?
Forum: FermatSearch 2020-11-11, 02:33
Replies: 65
Views: 5,033
Posted By bbb120
1/(2^33*log(2))=1.679518074832116*10^-10 not...

1/(2^33*log(2))=1.679518074832116*10^-10
not 1/(2^33*log(2))=3.86723328252e-10(wrong caused by sogou pinyin)
Forum: FermatSearch 2020-11-11, 00:45
Replies: 65
Views: 5,033
Posted By bbb120
according to prime number theorem , the...

according to prime number theorem , the probability of F33 is a prime only has
1/(2^33*log(2))=3.86723328252e-10, so it must be a composite number !
Forum: FermatSearch 2020-11-11, 00:37
Replies: 65
Views: 5,033
Posted By bbb120
F33=2^(2^33)+1=2^8589934592+1 ...

F33=2^(2^33)+1=2^8589934592+1
(F33-1)/2=2^4294967296
3^((F33-1)/2)=-1(mod F33) <=> F33 is a prime number
it needs 4294967296 iterations

50 Trillion Digits of Pi，50*10^12，
15digits per...
Forum: FermatSearch 2020-11-10, 06:11
Replies: 65
Views: 5,033
Posted By bbb120
50 Trillion Digits of Pi ...

50 Trillion Digits of Pi
https://www.mersenneforum.org/showthread.php?t=25155
why we can calculate 50 trillion digits of Pi ,but cannot test a PRP test on F33，
F33 only has no more than 2700...
Forum: FermatSearch 2020-11-10, 00:20
Replies: 32
Views: 1,721
Posted By bbb120
do you find any factor of fermat number ?

do you find any factor of fermat number ?
Forum: FermatSearch 2020-11-08, 00:27
Replies: 32
Views: 1,721
Posted By bbb120
why download software from www.fermatsearch.org? ...

why download software from www.fermatsearch.org?
my mathematica code can get factor correctly,
and it is efficiently ,maybe not the most efficiently.
Forum: FermatSearch 2020-11-07, 00:51
Replies: 32
Views: 1,721
Posted By bbb120
I only know how to find factor of fermat number...

I only know how to find factor of fermat number by writing mathematica code

my code to find F36 factor
Clear["Global`*"];
n=36;(*the nth fermat number*)
Do[p=k*2^(n+2)+1;(*probable factor*)
...
Forum: FermatSearch 2020-11-06, 05:24
Replies: 32
Views: 1,721
Posted By bbb120
How to sieve ? I only know p=k*2^(n+2)+1 must be...

How to sieve ? I only know p=k*2^(n+2)+1 must be a prime,
so we can use primality to sieve any potential p=k*2^(n+2)+1,
is there any more efficient method to sieve potential p=k*2^(n+2)+1?
Forum: FermatSearch 2020-11-06, 04:45
Replies: 32
Views: 1,721
Posted By bbb120
I do not want to find any factor of fermat number...

I do not want to find any factor of fermat number ,because it is very difficult to find one ,I only want to know the algorithm behind it
Forum: FermatSearch 2020-11-06, 02:50
Replies: 32
Views: 1,721
Posted By bbb120
reading codes whrite by others is not an easy...

reading codes whrite by others is not an easy thing,
so I only take interest in algorithm in it
Forum: FermatSearch 2020-11-06, 00:28
Replies: 32
Views: 1,721
Posted By bbb120
Fn=2^(2^n)+1 has factors in k*2^(n+2)+1 this...

Fn=2^(2^n)+1 has factors in k*2^(n+2)+1 this form,
so we can test a primality on p=k*2^(n+2)+1 before we
calculate Fn Mod p, do you have any algorithm which can be more faster to get
factor?
Forum: FermatSearch 2020-11-06, 00:12
Replies: 32
Views: 1,721
Posted By bbb120
you know too much than me ,I only can write...

you know too much than me ,I only can write simple program.
Forum: GMP-ECM 2020-11-06, 00:10
Replies: 28
Views: 2,519
Posted By bbb120
not strange， I take Great curiosity on...

not strange，
I take Great curiosity on primality and integer factorization.
Forum: FermatSearch 2020-11-05, 06:23
Replies: 32
Views: 1,721
Posted By bbb120
so it is impossible for me to get f118 factor...

so it is impossible for me to get f118 factor without GPU at present ?
I have no GPU ,I only have CPU
Forum: FermatSearch 2020-11-05, 05:45
Replies: 32
Views: 1,721
Posted By bbb120
how to get F118 factor 1527888802614951*2^120+1?

1527888802614951*2^120 + 1
1527888802614951 has 16 digits ,
if we calculate and try 10^5 per second ,
it will cost 10^15/(365*24*60*60)/10^5=317.1years for us to find this factor ,


Peter...
Forum: GMP-ECM 2020-11-05, 05:13
Replies: 28
Views: 2,519
Posted By bbb120
are you Ryan Propper？？？

are you Ryan Propper？？？
Forum: GMP-ECM 2020-11-05, 01:26
Replies: 28
Views: 2,519
Posted By bbb120
I have one personal computer ,Windows 7 operating...

I have one personal computer ,Windows 7 operating system ,but works slowly , so
I want to know what kind of hardware helps Ryan Propper to get that 83digits factor
Showing results 1 to 25 of 59
Page 1 of 3 1 23

 
All times are UTC. The time now is 20:30.

Wed Jan 27 20:30:22 UTC 2021 up 55 days, 16:41, 0 users, load averages: 4.26, 4.69, 4.90

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.