Solve a base
log in

Advanced search

Message boards : Cafe : Solve a base

Author Message
Thalus
Send message
Joined: 7 Mar 17
Posts: 34
Credit: 2,584,831
RAC: 0
Message 3302 - Posted: 18 Mar 2017, 19:45:36 UTC

Just wondering how to "Solve a Base"? When/How is a base solved? Is there only 1 solution for each base or could there be multiple?

Profile rebirther
Volunteer moderator
Project administrator
Project developer
Project tester
Project scientist
Avatar
Send message
Joined: 2 Jan 13
Posts: 3222
Credit: 22,879,153
RAC: 9
Message 3303 - Posted: 18 Mar 2017, 19:57:05 UTC - in response to Message 3302.

Just wondering how to "Solve a Base"? When/How is a base solved? Is there only 1 solution for each base or could there be multiple?


Every base has max k values. If we have reduced them by finding a factor to 0 then the base is solved. You can find the remaining factors with the current runs here or for all bases at mersenne.

Profile adrianxw
Send message
Joined: 23 Apr 17
Posts: 6
Credit: 4,194
RAC: 0
Message 3442 - Posted: 23 Apr 2017, 20:15:36 UTC - in response to Message 3303.

Ah, errrm, glad that is all clear now ----- not.

Profile rebirther
Volunteer moderator
Project administrator
Project developer
Project tester
Project scientist
Avatar
Send message
Joined: 2 Jan 13
Posts: 3222
Credit: 22,879,153
RAC: 9
Message 3443 - Posted: 23 Apr 2017, 21:34:56 UTC - in response to Message 3442.

Ah, errrm, glad that is all clear now ----- not.


In the science thread you can find every base. Here is an example:

base S504 (running) (4k)

(4k) is the amount of factors left for base S504

If there is a larger base you will find some ranges in brackets.

Profile Aurel
Send message
Joined: 5 Dec 15
Posts: 12
Credit: 401,663
RAC: 2
Message 3470 - Posted: 1 May 2017, 12:41:13 UTC - in response to Message 3443.

If you have still questions about it, here is a detailed description:

srbase aims to prove the Riesel and Sierpinski-Bases (b) up to 1030.
This will give the following form: k*b^n+/-1 [Riesel -1/Sierp +1]

The k can be calculated with the "conjectured k (=Riesel/Sierpinski-Number)", that means an combination from k and b and n will never create a prime. Example: Rieselbase 9

conjectured k: 74
->Every n-value for 74*9^n-1 will give you an composite number.

The question is: Is the conjectured k the smallest Rieselnumber?

To prove that theorem we need to find primes for every k.
Notice: For odd bases you need even k´s and for even bases odd k´s. Example: R1019

ck: 4
k remain:2
->There is no prime n<400K, but maybe n>400K.

You can find detailed stats there: http://www.noprimeleftbehind.net/crus/


Post to thread

Message boards : Cafe : Solve a base


Main page · Your account · Message boards


Copyright © 2014-2017 BOINC Confederation / rebirther