mersenneforum.org  

Go Back   mersenneforum.org > Extra Stuff > Miscellaneous Math

Reply
 
Thread Tools
Old 2021-02-27, 05:35   #12
Dylan14
 
Dylan14's Avatar
 
"Dylan"
Mar 2017

3×191 Posts
Default

Quote:
Originally Posted by bur View Post
So, for n < 1300:

Code:
n     p
317   266998379490113760299377713271194014325338065294581596243380200977777465722580068752870260867389
701   10520271803096747014481979765760257331100679605646347718996561806137464308594161644227333072555176902453965937712356435426038864500367607726255629541303761699910447342256889196383327515768645434542586503471563453
735   180736893357325919804742965901096183254486650358500961579737723575212405143116703993975930943694719806137463391890175780999890999416217020648099397663164550811570949854893831716648452639533025774320471006645409943407035103
Any chance here for future generations to do some work?
For n = 317 - no factors to 2^350.
For n = 701 - no factors to 2^725.
For n = 735 - no factors to 2^750.
Dylan14 is offline   Reply With Quote
Reply

Thread Tools


Similar Threads
Thread Thread Starter Forum Replies Last Post
x^y*y^x+-1 (Generalized HyperCulllen/Woodall) primes sweety439 And now for something completely different 8 2020-12-23 01:56
Cullen-Williams primes and Woodall-Williams primes sweety439 And now for something completely different 5 2020-10-28 00:36
Some new Generalized Cullen and Woodall primes Batalov And now for something completely different 15 2019-11-27 15:11
Super Cullen & Woodall primes Citrix And now for something completely different 1 2017-10-26 09:12
Mersenne Wiki: Improving the mersenne primes web site by FOSS methods optim PrimeNet 13 2004-07-09 13:51

All times are UTC. The time now is 23:28.

Wed Apr 14 23:28:12 UTC 2021 up 6 days, 18:09, 0 users, load averages: 1.73, 1.95, 2.05

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.