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?
/ 
Reply
Quote
rebirtherVolunteer moderator
Project administrator
Project developer
Project tester
Project scientist
Send message
Joined: 2 Jan 13
Posts: 8000
Credit: 44,538,964
RAC: 1
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.
/ Reply
Quote
Ah, errrm, glad that is all clear now ----- not.
/ Reply
Quote
rebirtherVolunteer moderator
Project administrator
Project developer
Project tester
Project scientist
Send message
Joined: 2 Jan 13
Posts: 8000
Credit: 44,538,964
RAC: 1
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.
/ Reply
Quote
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/
/ Reply
Quote