reviewed
approved
reviewed
approved
proposed
reviewed
editing
proposed
A chop-chop broken line function using the weighted average function of primes and their distribution that is log like. When the floors are left out it reproduces n exactly: the two uses of Floor[] functions chop it twice to give a broken line that is chaotic.
g[n_] = Floor[(Prime[n] - n)/(n - PrimePi[n])];
g[n_] = Floor[(Prime[n] - n)/(n - PrimePi[n])]; digits = 200; a = Table[Floor[(Prime[n] + g[n]*PrimePi[n])/(1 + g[n])], {n, 1, digits200}]
nonn,less
approved
editing
_Roger L. Bagula (rlbagulatftn(AT)yahoo.com), _, Jan 04 2004
Edited by _N. J. A. Sloane (njas(AT)research.att.com), _, Apr 28 2006
nonn,new
nonn
Edited by N. J. A. Sloane (njas, (AT)research.att.com), Apr 28 2006
nonn,new
nonn
Roger L. Bagula (tftnrlbagulatftn(AT)earthinkyahoo.netcom), Jan 04 2004
A chop-chop broken line function using the weighted average function of primes and their distribution that is log like.
Let g[n]=Floor[Prime[n]-n)/((n-PrimePi[n])], then a(n) = Floor[(Prime[n]+g[n]*PrimePi[n])/(1+g[n]).
A chop-chop broken line function using the weighted average function of primes and their distribution that is log like. When the floors are left out it reproduces n exactly: the two uses of Floor[] functions chop it twice to give a broken line that is chaotic.
g[n]=Floor[Prime[n]-n)/((n-PrimePi[n])] a(n) = Floor[(Prime[n]+g[n]*PrimePi[n])/(1+g[n])
g[n_] = Floor[(Prime[n] - n)/((n - PrimePi[n])] ; digits = 200 ; a = Table[Floor[(Prime[n] + g[n]*PrimePi[n])/(1 + g[n]), ], {n, 1, digits}]
nonn,uned,new
nonn
Edited by njas, Apr 28 2006
g[n_]=Floor[Prime[n]-n)/((n-PrimePi[n])] digits=200 a=Table[Floor[(Prime[n]+g[n]*PrimePi[n])/(1+g[n]), {n, 1, digits}]
nonn,uned,new