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 8 1 2345 Last »
Showing results 1 to 25 of 176
Search took 0.03 seconds. Search: Posts Made By: JeppeSN
Forum: And now for something completely different 2021-12-15, 17:30
Replies: 151
Views: 36,340
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: Miscellaneous Math 2021-11-22, 23:20
Replies: 16
Views: 1,698
Posted By JeppeSN
Lightbulb You forgot 228 in your first list/table. /JeppeSN

You forgot 228 in your first list/table. /JeppeSN
Forum: Miscellaneous Math 2021-11-22, 22:39
Replies: 16
Views: 1,698
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: 1,819
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: 1,819
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: 1,819
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: 1,819
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: 1,819
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: 12,180
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: 1,767
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: 59,338
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: 10,799
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: 1,992
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: 92,304
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: 13,692
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: 13,692
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: 92,304
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...
Forum: FermatSearch 2020-10-12, 20:10
Replies: 345
Views: 92,304
Posted By JeppeSN
Thumbs up Cool. It should be added as a User comment on...

Cool. It should be added as a User comment on https://primes.utm.edu/primes/page.php?id=131289. If you have at least one prime on primes.utm.edu, you can do it. Ask me if you do not know how to do...
Forum: FermatSearch 2020-10-11, 12:18
Replies: 345
Views: 92,304
Posted By JeppeSN
Thumbs up Very good. Thank you. So in this case the number...

Very good. Thank you. So in this case the number will be carefully checked and double checked. But I also wrote to Ryan P. to make sure future primes are not forgotten. /JeppeSN
Forum: FermatSearch 2020-10-10, 20:49
Replies: 345
Views: 92,304
Posted By JeppeSN
Dear rynp, Congratulations with this...

Dear rynp,

Congratulations with this remarkable discovery!

Has the above PFGW run completed by now? I see no User comment mentioning the GF(-, 7) divisor on...
Forum: Math 2020-10-06, 20:28
Replies: 5
Views: 2,420
Posted By JeppeSN
This part is explained in...

This part is explained in https://en.wikipedia.org/wiki/Second_Hardy%E2%80%93Littlewood_conjecture – if the First Hardy–Littlewood conjecture is true, then this implies that the second...
Forum: Miscellaneous Math 2020-09-21, 07:11
Replies: 9
Views: 3,440
Posted By JeppeSN
Red face I see an easy factorization of 2^n - 1 by...

I see an easy factorization of 2^n - 1 by induction: Suppose 2^(n-1) - 1 is factored. Then the factorization of 2^n - 2 is trivial. If we could somehow get the factorization from 2^n - 1 from that,...
Forum: Miscellaneous Math 2020-09-13, 09:34
Replies: 8
Views: 3,489
Posted By JeppeSN
Question How? For example, 7 divides 70, but s(7) = 2*7^2...

How? For example, 7 divides 70, but s(7) = 2*7^2 - 1 = 97 does not divide s(70) = 2*70^2 - 1 = 9799. Clearly enough, 97 divides 9797, hence 97 leaves a remainder of 2 when dividing into 9799?

It...
Forum: Information & Answers 2020-09-08, 08:09
Replies: 4
Views: 2,815
Posted By JeppeSN
16777216 = 2^24. Note that 2^16777216 + 1 =...

16777216 = 2^24.

Note that 2^16777216 + 1 = F(24) is the 24th Fermat number. No factors are known. You are probably searching for one.

However M(16777216) = 2^16777216 - 1 =...
Forum: Math 2020-09-02, 10:40
Replies: 3
Views: 5,933
Posted By JeppeSN
I wrote that OEIS entry. Did you ever complete...

I wrote that OEIS entry. Did you ever complete that ABC file to 2976221 or beyond? /JeppeSN
Showing results 1 to 25 of 176
Page 1 of 8 1 2345 Last »

 
All times are UTC. The time now is 06:18.


Sat May 21 06:18:22 UTC 2022 up 37 days, 4:19, 0 users, load averages: 1.71, 1.34, 1.44

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.

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