mersenneforum.org  

Go Back   mersenneforum.org > Search Forums

Showing results 1 to 25 of 142
Search took 0.03 seconds.
Search: Posts Made By: JeppeSN
Forum: Conjectures 'R Us 2020-08-05, 17:17
Replies: 78
Views: 12,990
Posted By JeppeSN
Smile Thank you for all the work you did on these two...

Thank you for all the work you did on these two k! I will write a post in this forum if a prime is ever located in one of these two series. /JeppeSN
Forum: Conjectures 'R Us 2020-08-05, 17:12
Replies: 7
Views: 451
Posted By JeppeSN
Thumbs up That private BOINC server now uses the residues...

That private BOINC server now uses the residues from CRUS for these two k, and double checks your work. And it has a status page now:...
Forum: Miscellaneous Math 2020-08-04, 15:52
Replies: 21
Views: 534
Posted By JeppeSN
You consider d(N) as the difference between the...

You consider d(N) as the difference between the number of odd natural numbers under N and the number of even natural numbers under N. Then d(N) does not converge for N tending to infinity, in the...
Forum: Miscellaneous Math 2020-08-04, 01:06
Replies: 21
Views: 534
Posted By JeppeSN
I do see some correct statements above. They...

I do see some correct statements above. They should be moved out of this crackpot subforum, by someone. Am I being trolled? /JeppeSN
Forum: Number Theory Discussion Group 2020-08-03, 18:13
Replies: 13
Views: 569
Posted By JeppeSN
That is true: This PARI/GP function imitates your...

That is true: This PARI/GP function imitates your program, with an optional seed argument:
findPeriod(p,seed=4)=s=Mod(seed,2^p-1);for(i=1,120000,s=s^2-2);S=s;i=0;until(s==S,S=S^2-2;i++);i
...
Forum: Number Theory Discussion Group 2020-08-03, 17:30
Replies: 13
Views: 569
Posted By JeppeSN
It is perhaps also interesting to note the...

It is perhaps also interesting to note the lengths of the "pre-periods", or offsets. That is the number of terms in the LL sequence preceding the first occurrence of the period. With Batalov's data...
Forum: Number Theory Discussion Group 2020-08-03, 07:33
Replies: 13
Views: 569
Posted By JeppeSN
Thumbs up Thanks, Batalov, that confirms my suspicion. For...

Thanks, Batalov, that confirms my suspicion. For example for p=37 (the first one Viliam Furik's method failed for), we start with:

4 -> 14 -> 194 -> 37634 -> 1416317954 -> (period starts here)...
Forum: Number Theory Discussion Group 2020-08-02, 09:26
Replies: 13
Views: 569
Posted By JeppeSN
Cool The LL sequence starts 4, 14, 194, ... Since...

The LL sequence starts 4, 14, 194, ...

Since we calculate modulo 2^p - 1, there are only finitely many values we can hit, so sooner or later we are going to hit a value we have seen before.

For...
Forum: Miscellaneous Math 2020-08-02, 01:02
Replies: 46
Views: 2,278
Posted By JeppeSN
Cool. The next one can be relevant for the Top...

Cool. The next one can be relevant for the Top 5000 of the Prime Pages (Caldwell). /JeppeSN
Forum: Math 2020-07-30, 08:35
Replies: 22
Views: 692
Posted By JeppeSN
For the LCM, with PARI, using...

For the LCM, with PARI, using lcm(apply(x->x-1,primes([3,23]))), you get 7920.

When you try to find the member from 2^1, 2^2, 2^3, ..., 2^7920 (mod 23#) with the least hammingweight, then nothing...
Forum: Math 2020-07-29, 19:06
Replies: 22
Views: 692
Posted By JeppeSN
An improvement (i.e. lower hammingweight) I can...

An improvement (i.e. lower hammingweight) I can get with that method, is the multiple 2^2513+1098793. It has pops 8. It is a multiple of 23# / 2. /JeppeSN
Forum: Math 2020-07-29, 18:42
Replies: 22
Views: 692
Posted By JeppeSN
Question I try the first one. With PARI/GP, I try znlog(j,...

I try the first one. With PARI/GP, I try znlog(j, Mod(2, 3 * 5 * 7 * 11 * 13 * 17 * 19 * 23)) for all j = -1, -2, -3, ... The first time it gives anything, is for j = -69613. Then my multiple is...
Forum: Math 2020-07-28, 16:49
Replies: 22
Views: 692
Posted By JeppeSN
https://oeis.org/A091317 says these primes have...

https://oeis.org/A091317 says these primes have density 7/24. /JeppeSN
Forum: Math 2020-07-22, 23:28
Replies: 0
Views: 130
Posted By JeppeSN
Question Minimal Riesel number with (apparently) no covering

Hello all,

For the purpose of this post, I define a Riesel number as a positive odd number k for which k*2^n - 1 is composite for all n > 0. Note that I do not require the existence of a (full)...
Forum: Miscellaneous Math 2020-07-21, 23:02
Replies: 55
Views: 2,040
Posted By JeppeSN
I also find it problematic that he got that...

I also find it problematic that he got that response ("look like an idiot", "just shut up"), and got a 7-day quarantine, because he asked for a group theory subforum. A bad and silly question, but...
Forum: Miscellaneous Math 2020-07-17, 23:59
Replies: 18
Views: 507
Posted By JeppeSN
Thumbs up Very nice explicit number simultaneously...

Very nice explicit number simultaneously Sierpinski to bases 2 and 3. I wonder if anyone has located numbers of this type before. Maybe someone can suggest what the smallest such number should be?
...
Forum: Miscellaneous Math 2020-07-14, 13:33
Replies: 55
Views: 2,040
Posted By JeppeSN
Unhappy Silverman, in my opinion many of your posts are...

Silverman, in my opinion many of your posts are unnecessarily offensive. It is nice that you spend time to help people who do not have the mathematical insight you have, but you do it in a way that...
Forum: Miscellaneous Math 2020-07-14, 11:17
Replies: 14
Views: 371
Posted By JeppeSN
Question I do not understand how it works. If we said 33...

I do not understand how it works. If we said 33 was a prime, then σ(4488) = σ(8*17*33) = σ(8)*σ(17)*σ(33) =! 15*18*34 = 9180 (under the false hypothesis "!" that 33 is prime). I cannot see how that...
Forum: Miscellaneous Math 2020-07-14, 08:13
Replies: 14
Views: 371
Posted By JeppeSN
Smile It is true that one of them is divisible by 3....

It is true that one of them is divisible by 3. Modulo 3, we have 2^n + 1 ≡ (-1)^n + 1, so every second n produces zero modulo 3.

As mentioned above, n=0 and n=1 both work, because 2^0+1; 2^1+1;...
Forum: Miscellaneous Math 2020-07-14, 07:50
Replies: 8
Views: 644
Posted By JeppeSN
Smile To make what everybody else said already, more...

To make what everybody else said already, more explicit:

Your exponent 283243137 is divisible by 3. So 283243137 = 3*N.

Then the number you propose, namely 2^283243137 - 1, is equal to 2^(3*N)...
Forum: Miscellaneous Math 2020-07-14, 07:28
Replies: 18
Views: 507
Posted By JeppeSN
Thumbs up I agree with you it should be possible to find...

I agree with you it should be possible to find "simultaneous" Sierpinski numbers to multiple bases, by picking disjoint covering sets (one covering set for the first base, and a non-overlapping...
Forum: Miscellaneous Math 2020-07-13, 09:11
Replies: 3
Views: 704
Posted By JeppeSN
What does that mean? I see three rows with ", [7,...

What does that mean? I see three rows with ", [7, 271]", i.e. three different Carmichael numbers whose minimal prime is 7 and maximal prime is 271. One of them has one more prime factor than the...
Forum: Prime Gap Searches 2020-07-09, 07:49
Replies: 51
Views: 6,796
Posted By JeppeSN
True. You can still see the historic versions,...

True. You can still see the historic versions, for example:
A326747 revision #56 (https://oeis.org/history/view?seq=A326747&v=56)
A326829 revision #34...
Forum: Aliquot Sequences 2020-07-08, 09:41
Replies: 15
Views: 391
Posted By JeppeSN
You must first find the full factorization of A,...

You must first find the full factorization of A, and then use the formulas here: Wikipedia: divisor function (https://en.wikipedia.org/wiki/Divisor_function) /JeppeSN
Forum: Aliquot Sequences 2020-07-08, 09:30
Replies: 15
Views: 391
Posted By JeppeSN
Do you mean when the full factorization of the...

Do you mean when the full factorization of the argument is known? /JeppeSN
Showing results 1 to 25 of 142

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

Sun Aug 9 02:41:58 UTC 2020 up 22 days, 22:28, 3 users, load averages: 2.13, 1.91, 1.79

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.