mersenneforum.org  

Go Back   mersenneforum.org > Extra Stuff > Miscellaneous Math

Reply
 
Thread Tools
Old 2017-02-24, 05:07   #23
a1call
 
a1call's Avatar
 
"Rashid Naimi"
Oct 2015
Remote to Here/There

79C16 Posts
Default

Note:

The allocatemem()s are commented out.

Code:
print("\nBMT-300-A-Alternative-Factorials=Falsorials-PRPs.gp\n")
/*
allocatemem()
allocatemem()
allocatemem()
allocatemem()
allocatemem()
allocatemem()
allocatemem()
allocatemem()
allocatemem()
allocatemem()
allocatemem()*/

for(n= 3,3,{
  forstep (i=3,3,1,
    falsorial=i;
    while(falsorial<10^1000000,
     
      falsorial=falsorial*(falsorial-1);\\print(falsorial);
      print(#digits(falsorial)," decimal digits.");
    );
  )
})
print("**** End of Run ****")

Code:
BMT-300-A-Alternative-Factorials=Falsorials-PRPs.gp

1 decimal digits.
2 decimal digits.
3 decimal digits.
6 decimal digits.
12 decimal digits.
24 decimal digits.
48 decimal digits.
95 decimal digits.
189 decimal digits.
377 decimal digits.
753 decimal digits.
1505 decimal digits.
3010 decimal digits.
6020 decimal digits.
12040 decimal digits.
24079 decimal digits.
48157 decimal digits.
96314 decimal digits.
192628 decimal digits.
  ***   at top-level: ...ial*(falsorial-1);print(#digits(falsorial)," 
  ***                                             ^--------------------
  *** digits: the PARI stack overflows !
  current stack size: 8000000 (7.629 Mbytes)
  [hint] you can increase GP stack with allocatemem()

**** End of Run ****
a1call is offline   Reply With Quote
Old 2017-02-24, 05:10   #24
a1call
 
a1call's Avatar
 
"Rashid Naimi"
Oct 2015
Remote to Here/There

79C16 Posts
Default

My 80k dd estimate was way off, but the point is Pari can handle arithmetic on far larger integers than its #digits() function can be used to count digits for.
a1call is offline   Reply With Quote
Old 2017-02-24, 12:11   #25
science_man_88
 
science_man_88's Avatar
 
"Forget I exist"
Jul 2009
Dumbassville

26×131 Posts
Default

Quote:
Originally Posted by a1call View Post
My 80k dd estimate was way off, but the point is Pari can handle arithmetic on far larger integers than its #digits() function can be used to count digits for.
you could use length(Str(number))
science_man_88 is offline   Reply With Quote
Old 2017-02-24, 12:24   #26
paulunderwood
 
paulunderwood's Avatar
 
Sep 2002
Database er0rr

5×701 Posts
Default

Quote:
Originally Posted by science_man_88 View Post
you could use length(Str(number))


Code:
? allocatemem(100000000)
  ***   Warning: new stack size = 100000000 (95.367 Mbytes).
? length(Str(10^26000000))
26000001
paulunderwood is offline   Reply With Quote
Old 2017-02-24, 12:30   #27
science_man_88
 
science_man_88's Avatar
 
"Forget I exist"
Jul 2009
Dumbassville

26·131 Posts
Default

another possibility is using digits with a base other than 10 in theory you could square a number and square the base the digits are counted in and end up with the same amount of digits roughly.
science_man_88 is offline   Reply With Quote
Old 2017-02-25, 01:35   #28
a1call
 
a1call's Avatar
 
"Rashid Naimi"
Oct 2015
Remote to Here/There

22×487 Posts
Default

Quote:
Originally Posted by science_man_88 View Post
you could use length(Str(number))
Thank you SM. Will give that a try.
a1call is offline   Reply With Quote
Old 2017-03-02, 15:03   #29
a1call
 
a1call's Avatar
 
"Rashid Naimi"
Oct 2015
Remote to Here/There

22×487 Posts
Default

The title of this thread is too huge to let it sink.
Wouldn't n-1 and n+1 test be ideal for getting large primes using falserials?
You start with known prime factors for 30, see if 30-1 is prime and get 30*29., Know it's prime factors, see if 869 is prime,...
All using n-1 lucas test.
a1call is offline   Reply With Quote
Old 2019-03-25, 03:44   #30
a1call
 
a1call's Avatar
 
"Rashid Naimi"
Oct 2015
Remote to Here/There

22·487 Posts
Default

The following 36716 dd Falserial has been proven Prime using PFGW:



There is currently no established way of showing the integer in a reduced form, but it would be quite easy to invent one.
a1call is offline   Reply With Quote
Old 2019-03-25, 04:07   #31
Batalov
 
Batalov's Avatar
 
"Serge"
Mar 2008
Phi(4,2^7658614+1)/2

25×7×41 Posts
Default

Are you sure that this is a Falserial and not a Ulshmartragorian?
We don't know what either of these words mean.

Your attached document shows nothing pertaining to PFGW.
Could you please attach the full output of PFGW, where it says "is prime"?
Batalov is offline   Reply With Quote
Old 2019-03-25, 04:23   #32
a1call
 
a1call's Avatar
 
"Rashid Naimi"
Oct 2015
Remote to Here/There

194810 Posts
Default

The number is added to pfgw-prime.log using the -t flag which I believe it means it is a deterministic Prime.

I could PM you the the helper file where every Prime is proven Prime by smaller found primes.
The reason I did not post it in the open is to make a point that it can be proven prime if you have the structure in seconds but without it would take months or years.
If the proper notation is invented/used it can also be proven prime in seconds since the structure would be known.
If you would like to verify the primality please add the primes in the PM to a helper file as they are proven prime and move up to the last term.
a1call is offline   Reply With Quote
Old 2019-03-25, 04:32   #33
a1call
 
a1call's Avatar
 
"Rashid Naimi"
Oct 2015
Remote to Here/There

22×487 Posts
Default

Turns out I don't know how to add an attachment to the PM so I will attach it to this post.

Please see the PFGW pfgw-prime.log.

You will have to prove each lower prime 1st and then add it to the helper file for proving the subsequent primes using the N-1 method.

The last 2 primes are of the same order.
Attached Files
File Type: log pfgw-prime.log (107.9 KB, 62 views)
a1call is offline   Reply With Quote
Reply

Thread Tools


All times are UTC. The time now is 02:13.

Sun Dec 6 02:13:26 UTC 2020 up 2 days, 22:24, 0 users, load averages: 2.03, 1.98, 2.29

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.