![]() |
|
|
#12 |
|
May 2003
30138 Posts |
Theoretically, will B(3) be the maximum of the B(n)?
|
|
|
|
|
|
#13 | |
|
"Robert Gerbicz"
Oct 2005
Hungary
2·743 Posts |
Quote:
Conjecture: B(n)>=2 only for the following n values: n=3,6,9,12,15,18,21,30,33,45,60,105,210 The approximations for these B(n): Code:
Using primes up to x=2^27 B(3)=2.442231269392689804114732068 B(6)=2.201030111019210864675522552 B(9)=2.003385568331636746610271054 B(12)=2.124422255535451994857424058 B(15)=2.388569586152179981872294340 B(18)=2.030799435427551083938044648 B(21)=2.102082829864169356075057696 B(30)=2.204198213726053404129335028 B(33)=2.053021584235230176112771307 B(45)=2.152161728195823869080966493 B(60)=2.067666234021665015724540739 B(105)=2.119764793288551158021767410 B(210)=2.039955879804044710971032031 |
|
|
|
|
|
|
#14 | |
|
Feb 2006
Denmark
2×5×23 Posts |
Quote:
The largest found B_n was B_(496562420542/2) = 3307. I submitted some related sequences to OEIS: First occurrence of nth prime |
|
|
|
|
|
|
#15 | |
|
Nov 2003
22·5·373 Posts |
Quote:
I was not aware of these references. Thank you.
|
|
|
|
|
![]() |
Similar Threads
|
||||
| Thread | Thread Starter | Forum | Replies | Last Post |
| Various and Constant BSOD's. | badbud65 | Software | 46 | 2016-05-02 23:18 |
| Explicit constant? | Zeta-Flux | Math | 4 | 2007-11-30 08:56 |
| Constant n-Search for k*2^n-1 | kar_bon | Riesel Prime Search | 45 | 2007-11-27 19:15 |
| Fermat last theorem generalization | Damian | Math | 5 | 2007-02-06 00:43 |
| Kaprekar's constant | mfgoode | Math | 10 | 2004-06-02 04:06 |