[QUOTE=science_man_88;244031]what says we can't do something like what we've been doing to get the line[/QUOTE]

I say that. Your project is flawed through lack of understandings of random processes, especially the Poisson and exponential distributions.

You're welcome to spend whatever time you like on this, but it will be a waste. That may not bother you.

[QUOTE=CRGreathouse;244079]I say that. Your project is flawed through lack of understandings of random processes, especially the Poisson and exponential distributions.

You're welcome to spend whatever time you like on this, but it will be a waste. That may not bother you.[/QUOTE]

So what articles should I read to get better understanding? How I read Wikipedia a Poisson distribution rely's on a Vec() filled with random data. and i've basically stated this but nobody has pointed me to a good enough article on it so that's that. Exponential distrubutions I'm guessing would rely on a base raised to a power multiplied by the first value making them non random.

[CODE](15:20)>solve(x=1,10,(x^6/2^5)-1)
%236 = 1.781797436280678609480452411181025015974425231756320806767513984503861606631524985275051534501114395[/CODE]

I had a dream once involving a power of 5 and power of 6 relationship and Mersenne primes this is devilishly close in my mind to the base I was using in my assessment.

[QUOTE=science_man_88;244120]How I read Wikipedia a Poisson distribution rely's on a Vec() filled with random data.[/QUOTE]

Yes, I have no idea ( not even a little bit of one) as to what that means. It's as though you said "baking is a quickly sleep oven furiously".

[QUOTE=science_man_88;244273][CODE](15:20)>solve(x=1,10,(x^6/2^5)-1)
%236 = 1.781797436280678609480452411181025015974425231756320806767513984503861606631524985275051534501114395[/CODE]

I had a dream once involving a power of 5 and power of 6 relationship and Mersenne primes this is devilishly close in my mind to the base I was using in my assessment.[/QUOTE]

You understand that solve(x=1,10,(x^6/2^5)-1) gives a solution to x^6/32 - 1 = 0, that is, a sixth root of 32?

[QUOTE=CRGreathouse;244319]You understand that solve(x=1,10,(x^6/2^5)-1) gives a solution to x^6/32 - 1 = 0, that is, a sixth root of 32?[/QUOTE]

my point was I've talked of a x^6/y^5 type relationship and it comes close to the 1.78 I tried in the equation.

Getting back to the OP:

[quote]Wagstaff Conjecture
OK
Not proved.
A few subtleties.
Some folk can't get their head round it.
But is there anything simpler going around to base our assumptions on?
[/quote]How about this three-parter conjecture:

Let M[sub]n[/sub] = the nth Mersenne Prime exponent (MPE).

(1) The ratios R[sub]n[/sub] = M[sub]n+1[/sub]/M[sub]n[/sub] are bounded above.

(2) In particular, 1 < R[sub]n[/sub] < 10 for all integral n >= 1.

(2') Consequently, there is at least one MPE for each number of
decimal digits > 0.

(2'') This implies the Mersenne Prime sequence is infinite.

(2''') This implies the Even Perfect Number sequence is infinite.

(3) The YJ-Conjecture:
lim (n->infinity) R[sub]n[/sub]= M[sub]n+1[/sub]/M[sub]n[/sub] = 3/2 = 1.500.

Take this as:

define function yj(K,M,N) = K * M^N

then there exists a real K in 0.5 < K < 2.0 and an M in 1 < M < 2 s.t.
the values of R[sub]n[/sub] hover around yj(K,M,N), i.e.
(similarly to the prime distribution function hovering around li(x))
the values of R[sub]n[/sub] grow like yj(K,M,N) and continue to
exceed it and then be exceeded by it infinitely often (cyclicly, i.e.
repeatedly), at varying intervals which may be estimated based on
the "best" values for K and M and for no other such values

(3') base M = 3/2 = 1.500, with best coefficient K t.b.d.
(possibly K = 1.0 or 2/3 or 4/3 or 3/2 or 2.0).

(Note especially MPE23 = 11213 for my best guess for K).

(3'') There's more, it's conjecturalisimo, and controversial.

My counter-conjectures:

Let q[SUB]n[/SUB] be the n-th Mersenne prime exponent, A000043.

(1) The ratios q[SUB]n+1[/SUB]/q[SUB]n[/SUB] can be arbitrarily close to 1 or [TEX]+\infty.[/TEX]

(1') This implies that there are infinitely many Mersenne primes and hence even perfect numbers.

(2) In particular, for any N and ε > 0, there are m,n > N with q[SUB]m+1[/SUB]/q[SUB]m[/SUB] < 1 + ε and q[SUB]n+1[/SUB]/q[SUB]n[/SUB] < 1 / ε.

(2') Consequently, there are infinitely many numbers for which no Mersenne prime exponents with that number of decimal digits exists.

(3) [TEX]\lim_{n\to\infty}q_{n+1}/q_n[/TEX] does not exist.

(3')* [TEX]\sqrt[n]{q_n}=2^{e^{-\gamma}}+o(1)[/TEX]


I reserve the right to modify or retract conjecture 3' if I miscalculated the expected value or error. I'm quite confident about the others, at least as confident as one can be about non-foundational conjectures in mathematics.

In short, I think that your conjectures (1), (2), (2'), (3), and (3') are wrong.

[QUOTE=CRGreathouse;245433]My counter-conjectures:

Let q[SUB]n[/SUB] be the n-th Mersenne prime exponent, A000043.

(1) The ratios q[SUB]n+1[/SUB]/q[SUB]n[/SUB] can be arbitrarily close to 1 or [TEX]+\infty.[/TEX]

(1') This implies that there are infinitely many Mersenne primes and hence even perfect numbers.

(2) In particular, for any N and ε > 0, there are m,n > N with q[SUB]m+1[/SUB]/q[SUB]m[/SUB] < 1 + ε and q[SUB]n+1[/SUB]/q[SUB]n[/SUB] < 1 / ε.

(2') Consequently, there are infinitely many numbers for which no Mersenne prime exponents with that number of decimal digits exists.

(3) [TEX]\lim_{n\to\infty}q_{n+1}/q_n[/TEX] does not exist.

(3')* [TEX]\sqrt[n]{q_n}=2^{e^{-\gamma}}+o(1)[/TEX]


I reserve the right to modify or retract conjecture 3' if I miscalculated the expected value or error. I'm quite confident about the others, at least as confident as one can be about non-foundational conjectures in mathematics.

In short, I think that your conjectures (1), (2), (2'), (3), and (3') are wrong.[/QUOTE]

While you have expressed this better than I could have, using Tex and all,
I and others understood that this is the current conjecture. Our key
difference is my claims based on my conjecture (1), that the ratio is in
fact bounded above, which denies the fundamental assumption of the
current conjecture, namely that the distribution of primes can be "modeled"
as a random (poisson or otherwise) process. They can not, except as an
approximation. The primes, just as the integers, are immutable, not random.

[QUOTE=CRGreathouse;245433]

(3')* [TEX]\sqrt[n]{q_n}=2^{e^{-\gamma}}+o(1)[/TEX][/QUOTE]

if I knew what the smal o was for maybe I could calculate how close you were.

[QUOTE=science_man_88;245534]if I knew what the smal o was for maybe I could calculate how close you were.[/QUOTE]

[url]http://en.wikipedia.org/wiki/Big_O_notation#Little-o_notation[/url]