A yuge number - Page 2

enzocreti · 2018-12-06, 15:59

Quote:

Originally Posted by axn

Code:

mod_check(p)=my(r=Mod(2,p)^7891455); (r*2-1)*Mod(10,p)^2375565+r==1
forprime(p=2,,if(mod_check(p),print(p)))

Here you go...

the program does not display where it arrived, I mean I would know: there is no factor below 4*10^32 for example

axn · 2018-12-06, 16:58

Quote:

Originally Posted by enzocreti

the program does not display where it arrived, I mean I would know: there is no factor below 4*10^32 for example

Run it for as long as you have patience (say 24 hours). Then hit Ctrl-C. You'll get a "break>" prompt. Type p in there to show the current value of the loop variable. That's how far you've reached. If you want to continue from where you interrupted just hit ENTER (or edit the forprime loop to start from new value)

enzocreti · 2018-12-07, 17:58

99999000001

divides

(2^7891456-1)*10^2375565+2^7891455-1!!!

science_man_88 · 2018-12-07, 18:11

Quote:

Originally Posted by enzocreti

99999000001

divides

(2^7891456-1)*10^2375565+2^7891455-1!!!

!!! means triple factorial right ... assuming not you are incorrect it has remainder 50542755186 on division by it.

enzocreti · 2018-12-07, 18:16

Quote:

Originally Posted by Batalov

Why not use Sage for that, though?

A mistake!

MisterBitcoin · 2018-12-07, 18:17

Quote:

Originally Posted by enzocreti

99999000001

divides

(2^7891456-1)*10^2375565+2^7891455-1!!!

If you say so.

enzocreti · 2018-12-07, 18:31

Quote:

Originally Posted by MisterBitcoin

If you say so.

sorry a mistake!

CRGreathouse · 2018-12-08, 04:50

Quote:

Originally Posted by enzocreti

99999000001

divides

(2^7891456-1)*10^2375565+2^7891455-1!!!

Quote:

Originally Posted by science_man_88

!!! means triple factorial right ... assuming not you are incorrect it has remainder 50542755186 on division by it.

I concur:

Code:

p=99999000001; t=Mod(2,p)^7891455; T=Mod(10,p)^2375565; (2*t-1)*T+t-1

Quote:

Originally Posted by enzocreti

sorry a mistake!

No worries, it happens.

a1call · 2018-12-08, 05:08

Quote:

Originally Posted by axn

... Then hit Ctrl-C. You'll get a "break>" prompt.... If you want to continue from where you interrupted just hit ENTER...

IINM That only works on the Linux versions.

CRGreathouse · 2018-12-08, 05:14

Quote:

Originally Posted by a1call

IINM That only works on the Linux versions.

AFAIK it should work with any version with breakloop = 1. Set default(breakloop, 1) then try it.

a1call · 2018-12-08, 05:27

Quote:

Originally Posted by CRGreathouse

AFAIK it should work with any version with breakloop = 1. Set default(breakloop, 1) then try it.

Will do Mr Greathouse.
Thank you very much.

2018-12-07, 17:58	#14
enzocreti Mar 2018 2×5×53 Posts	GREAT DISCOVERY!!! 99999000001 divides (2^7891456-1)*10^2375565+2^7891455-1!!!

Similar Threads
Thread	Thread Starter	Forum	Replies	Last Post
Finding multiples of a real number that are close to a whole number	mickfrancis	Math	16	2017-03-01 07:17
Estimating the number of primes in a partially-factored number	CRGreathouse	Probability & Probabilistic Number Theory	15	2014-08-13 18:46
Number 59649589127497217 is a factor of Fermat number F7	literka	Miscellaneous Math	73	2013-11-17 10:33
Number of distinct prime factors of a Double Mersenne number	aketilander	Operazione Doppi Mersennes	1	2012-11-09 21:16
Fermat number F6=18446744073709551617 is a composite number. Proof.	literka	Factoring	5	2012-01-30 12:28