OFFSET
0,1
COMMENTS
The potential is inversely proportional to the distance: a positive charge at p has potential 1/abs(x-p). Starting from a positive charge at 0 and a negative charge at 1, the potential is zero at the midpoint 1/2, so another positive charge is added there. Then the potential is zero at 0.7886... and a negative charge is added there, and so on. The first few zero potential points are: 0.5, 0.7886..., 0.6325..., 0.7179..., 0.6714..., ... The limit is the constant of this sequence.
After initial points p_0 = 0 and p_1 = 1, each new zero point fits between previous two points and is the solution to Sum_{n>=0} 1/(x-p_n) = 0.
LINKS
Rok Cestnik, Visualization
EXAMPLE
0.68784181032838926327134404409883348611583979...
MATHEMATICA
p={0, 1};
For[r=1, r<39, ++r, p=Append[p, x/.NSolve[{Sum[1/(x-p[[k]]), {k, 1, Length[p]}]==0, (x-p[[-1]])*(x-p[[-2]])<0}, x, WorkingPrecision -> 30][[1, 1]]]; ];
A365125 = RealDigits[Floor[10^10*p[[-1]]]][[1]]
PROG
(Python)
from decimal import Decimal, getcontext, ROUND_UP, ROUND_DOWN
getcontext().prec = 100
def nm(f, df, x):
for i in range(10):
x -= f(x)/df(x)
return x
def flip_rounding():
if getcontext().rounding == ROUND_UP: getcontext().rounding = ROUND_DOWN
else: getcontext().rounding = ROUND_UP
def get_zero(vs, rounding):
getcontext().rounding = rounding
def p(x, v):
flip_rounding(); t = x-v
flip_rounding(); return 1/t
def dp(x, v):
flip_rounding(); t = x-v; t = t**2
flip_rounding(); return -1/t
def f(x): return sum(p(x, vs[n]) for n in range(len(vs)))
def df(x): return sum(dp(x, vs[n]) for n in range(len(vs)))
sign = -1 if rounding == ROUND_DOWN else 1
return nm(f, df, (vs[-1]+vs[-2])/2+sign*abs(vs[-1]-vs[-2])/3)
v_lo = [Decimal(0), Decimal(1)]
v_up = [Decimal(0), Decimal(1)]
for r in range(150):
v_lo.append(get_zero(v_lo, ROUND_DOWN))
v_up.append(get_zero(v_up, ROUND_UP))
lower_bounds = [v_lo[i] for i in range(0, len(v_lo), 2)]
upper_bounds = [v_up[i] for i in range(1, len(v_up), 2)]
right = True
A365125 = [int(l) for l, u in zip(str(lower_bounds[-1])[2:], str(upper_bounds[-1])[2:]) if right and (right := (l == u))]
CROSSREFS
KEYWORD
nonn,cons
AUTHOR
Rok Cestnik, Aug 22 2023
STATUS
approved