mersenneforum.org  

Go Back   mersenneforum.org > Search Forums

Showing results 1 to 25 of 184
Search took 0.04 seconds.
Search: Posts Made By: JeppeSN
Forum: Software 2022-12-07, 09:38
Replies: 13
Views: 559
Posted By JeppeSN
Thumbs up As far as I understand Pavel Atnashev...

As far as I understand Pavel Atnashev (https://mersenneforum.org/member.php?u=16221) who made LLR2, it can do a test of such numbers (c ≠ ±1), even with Gerbicz hardware error check and Pietrzak fast...
Forum: Software 2022-12-05, 13:05
Replies: 13
Views: 559
Posted By JeppeSN
For what it is worth, PARI/GP's function...

For what it is worth, PARI/GP's function ispseudoprime(6^85481+85481) returns 1 (i.e. this is a probable prime). I believe its implementation is independent of gwnum? It does a test that is more...
Forum: Math 2022-08-30, 16:41
Replies: 117
Views: 24,551
Posted By JeppeSN
Plus Kellen Shenton found PRP 200^262144 + 119^262144,...

Kellen Shenton found PRP 200^262144 + 119^262144, and A291944 is updated. /JeppeSN
Forum: Math 2022-08-21, 19:44
Replies: 117
Views: 24,551
Posted By JeppeSN
Ryan Propper found PRPs (35963^524288+1)/2...

Ryan Propper found PRPs (35963^524288+1)/2 (http://www.primenumbers.net/prptop/searchform.php?form=%28b%5Er%2B1%29%2F2) and (187503^262144+1)/2 and added them to A275530 (https://oeis.org/A275530)....
Forum: Other Mathematical Topics 2022-08-10, 21:49
Replies: 11
Views: 4,347
Posted By JeppeSN
You will be interested in the thread Integers n...

You will be interested in the thread Integers n for which the digit sum of n exceeds the digit sum of n^5 (https://math.stackexchange.com/questions/1401871/) in which I once wrote comments. /JeppeSN
Forum: Other Mathematical Topics 2022-08-10, 19:49
Replies: 7
Views: 1,072
Posted By JeppeSN
For these, the exponent must be a power of two,...

For these, the exponent must be a power of two, so you would check:

62^64+1; 126^128+1; 254^256+1; 510^512+1; ...

The first many of them are already proven composite by Generalized Fermat prime...
Forum: And now for something completely different 2022-08-06, 20:23
Replies: 84
Views: 12,291
Posted By JeppeSN
For people who know and love some mathematics,...

For people who know and love some mathematics, but are not specialists, there is an easy-to-read paper from 1974 about how they discovered this: Ian Richards, On the incompatibility of two...
Forum: Math 2022-08-02, 15:30
Replies: 117
Views: 24,551
Posted By JeppeSN
Thumbs up Kellen Shenton found the PRP 1196^131072 +...

Kellen Shenton found the PRP 1196^131072 + 595^131072, to appear on PRP Top.

As soon as it is verified that 1196 is minimal for this exponent, OEIS will be updated.

/JeppeSN
Forum: And now for something completely different 2021-12-15, 17:30
Replies: 151
Views: 41,584
Posted By JeppeSN
Plus There is a Numberphile video out today where Neil...

There is a Numberphile video out today where Neil Sloane describes these efforts:
https://www.youtube.com/watch?v=vKlVNFOHJ9I
/JeppeSN
Forum: Charles Kusniec 2021-11-22, 23:20
Replies: 16
Views: 2,501
Posted By JeppeSN
Lightbulb You forgot 228 in your first list/table. /JeppeSN

You forgot 228 in your first list/table. /JeppeSN
Forum: Charles Kusniec 2021-11-22, 22:39
Replies: 16
Views: 2,501
Posted By JeppeSN
For what it's worth, an attempt to format the...

For what it's worth, an attempt to format the tables.

-----------------------
Table I:
Tally Composite C d_s [C] C-(d_s [C]+1) C-1 C+1 C+(d_s [C]+1)
1 12 4 ...
Forum: Factoring 2021-11-09, 22:40
Replies: 17
Views: 2,502
Posted By JeppeSN
Thanks. Note that a lot of ECM (elliptic-curve...

Thanks. Note that a lot of ECM (elliptic-curve factorization) had already been attempted on these two numbers even before their values were disclosed. For that reason I expect it to be quite...
Forum: Factoring 2021-11-09, 22:24
Replies: 17
Views: 2,502
Posted By JeppeSN
Plus The b such that b^2048+1 is prime, are 1, 150,...

The b such that b^2048+1 is prime, are 1, 150, 2558, 4650, 4772, 11272, 13236, ... (https://oeis.org/A088361).

The game here is to skip forward in this sequence to the first values b such that...
Forum: Factoring 2021-11-09, 12:56
Replies: 17
Views: 2,502
Posted By JeppeSN
Exclamation It is not "my page". The page is on a BOINC...

It is not "my page". The page is on a BOINC server (https://primes.utm.edu/bios/page.php?id=5191) set up by user stream (https://mersenneforum.org/member.php?u=14491) who runs this project. /JeppeSN
Forum: Factoring 2021-11-08, 23:56
Replies: 17
Views: 2,502
Posted By JeppeSN
Thumbs up Thank you for providing some insightful numbers. ...

Thank you for providing some insightful numbers.

Clearly, I am not saying this is the cheapest way to find a megaprime (for that, you can join PrimeGrid's Proth Prime Mega subproject, or their...
Forum: Factoring 2021-11-08, 22:02
Replies: 17
Views: 2,502
Posted By JeppeSN
Lightbulb Help factor some b such that b^4096+1 are mega(PR)primes

While Mersenne primes can be thought of as primes that precede a perfect power, a so-called generalized Fermat prime is defined (here) as a prime following a perfect power, so a prime of form b^N+1...
Forum: And now for something completely different 2021-04-21, 07:16
Replies: 72
Views: 15,424
Posted By JeppeSN
Good one! Maybe it will be clear when the...

Good one!

Maybe it will be clear when the PRP Top entry becomes visible, but what types of PRP tests has this one "passed", as of now?

/JeppeSN
Forum: Miscellaneous Math 2021-04-20, 14:03
Replies: 12
Views: 2,031
Posted By JeppeSN
I guess it is true that every odd factor of...

I guess it is true that every odd factor of Phi(n,b)/gcd(Phi(n,b),n) (with b≥2) (where Phi is the cyclotomic polynomial, and gcd is greatest common divisor) is of the form kn+1. /JeppeSN
Forum: Riesel Prime Search 2021-02-19, 08:48
Replies: 307
Views: 66,407
Posted By JeppeSN
Arrow This beats an idea of simply doing 10^999999 +...

This beats an idea of simply doing 10^999999 + k*10^(333333-m) ± 1 with m very small. Such a prime would be simpler to test than Serge Batalov's, but not quite as close to 10^999999. /JeppeSN
Forum: FermatSearch 2021-02-16, 12:31
Replies: 12
Sticky: gfn results
Views: 11,447
Posted By JeppeSN
I added the information to...

I added the information to https://primes.utm.edu/primes/page.php?id=131760#comments

It had already appeared on http://www.prothsearch.com/GFNfacs.html

/JeppeSN
Forum: Math 2021-01-18, 15:43
Replies: 8
Views: 2,293
Posted By JeppeSN
Thumbs down The official policy of OEIS disagrees. On...

The official policy of OEIS disagrees.

On https://oeis.org/SubmitB.html you can read:



So just because it is faster to calculate a sequence than to fetch it over the internet, does not mean...
Forum: FermatSearch 2021-01-17, 23:57
Replies: 345
Views: 99,944
Posted By JeppeSN
You may be aware that PrimeGrid found:...

You may be aware that PrimeGrid found: https://primes.utm.edu/primes/page.php?id=131583
27*2^7963247 + 1 divides Fermat F(7963245)
/JeppeSN
Forum: FermatSearch 2020-11-19, 10:33
Replies: 65
Views: 15,177
Posted By JeppeSN
Wink And the difference between F0 and pi is negative....

And the difference between F0 and pi is negative. /JeppeSN
Forum: FermatSearch 2020-11-19, 00:41
Replies: 65
Views: 15,177
Posted By JeppeSN
MM82589933 = 2^(2^82589933-1) - 1 is a prime. ...

MM82589933 = 2^(2^82589933-1) - 1 is a prime.

Now please prove me wrong - any prime factor of that number would be the largest prime ever found.

/JeppeSN
Forum: FermatSearch 2020-10-12, 22:20
Replies: 345
Views: 99,944
Posted By JeppeSN
Lightbulb But before that, Ravi Fernando showed me: ...

But before that, Ravi Fernando showed me:

Let p = k * 2^n + 1 be a prime that divides a Fermat number. From the formula, we can write k = -1/2^n (mod p). But the order of 2 (mod p) is a power of...
Showing results 1 to 25 of 184

 
All times are UTC. The time now is 09:05.


Sat Dec 10 09:05:39 UTC 2022 up 114 days, 6:34, 0 users, load averages: 1.02, 0.87, 0.82

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2022, 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.

≠ ± ∓ ÷ × · − √ ‰ ⊗ ⊕ ⊖ ⊘ ⊙ ≤ ≥ ≦ ≧ ≨ ≩ ≺ ≻ ≼ ≽ ⊏ ⊐ ⊑ ⊒ ² ³ °
∠ ∟ ° ≅ ~ ‖ ⟂ ⫛
≡ ≜ ≈ ∝ ∞ ≪ ≫ ⌊⌋ ⌈⌉ ∘ ∏ ∐ ∑ ∧ ∨ ∩ ∪ ⨀ ⊕ ⊗ 𝖕 𝖖 𝖗 ⊲ ⊳
∅ ∖ ∁ ↦ ↣ ∩ ∪ ⊆ ⊂ ⊄ ⊊ ⊇ ⊃ ⊅ ⊋ ⊖ ∈ ∉ ∋ ∌ ℕ ℤ ℚ ℝ ℂ ℵ ℶ ℷ ℸ 𝓟
¬ ∨ ∧ ⊕ → ← ⇒ ⇐ ⇔ ∀ ∃ ∄ ∴ ∵ ⊤ ⊥ ⊢ ⊨ ⫤ ⊣ … ⋯ ⋮ ⋰ ⋱
∫ ∬ ∭ ∮ ∯ ∰ ∇ ∆ δ ∂ ℱ ℒ ℓ
𝛢𝛼 𝛣𝛽 𝛤𝛾 𝛥𝛿 𝛦𝜀𝜖 𝛧𝜁 𝛨𝜂 𝛩𝜃𝜗 𝛪𝜄 𝛫𝜅 𝛬𝜆 𝛭𝜇 𝛮𝜈 𝛯𝜉 𝛰𝜊 𝛱𝜋 𝛲𝜌 𝛴𝜎𝜍 𝛵𝜏 𝛶𝜐 𝛷𝜙𝜑 𝛸𝜒 𝛹𝜓 𝛺𝜔