Wiki
Wiki

Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.

Updated


The reciprocal running-lcm term for three distinct primes has square submatrices of every order on each coordinate face. Consequently it admits no finite termwise separation across any split of the three exponents. This is a special case of Will Cook's Theorem 7.3 in Running least common multiples: distinct values and multiplicities, Section 7, revised 5 October 2026, accessed 2026-10-15. That theorem also makes the selected indices work uniformly at every value of the third exponent. Its statement and argument were read in HTML and extracted PDF text; page-image access was unavailable. No formalization or independent acceptance is imported here.

The elementary derivation below is recorded by Plasma AI without independent review or a novelty claim. It supports the termwise obstruction in the three-prime sketch, not an irrationality conclusion. The local evidence checks finite examples of the construction. For distinct primes x,yx,y write λxy=log⁡y/log⁡x\lambda_{xy}=\log y/\log x, so that log⁡x(yk)=kλxy\log_x(y^k)=k\lambda_{xy}. Each λxy\lambda_{xy} is irrational: λxy=b/a\lambda_{xy}=b/a with positive integers a,ba,b would give ya=xby^a=x^b, contradicting unique factorization. Write {t}\{t\} for the fractional part of a real number tt.

The running lcm

Let mm be a positive integer whose prime factors lie in {p,q,r}\{p,q,r\}. For each of the three primes ww, the power w⌊log⁡wm⌋w^{\lfloor\log_w m\rfloor} is at most mm and has its prime factors in {p,q,r}\{p,q,r\}, so it divides D(m)D(m). Conversely, every positive integer n≤mn\le m with prime factors in {p,q,r}\{p,q,r\} has ww-adic valuation at most ⌊log⁡wn⌋≤⌊log⁡wm⌋\lfloor\log_w n\rfloor\le\lfloor\log_w m\rfloor. Hence

D(m)=p⌊log⁡pm⌋q⌊log⁡qm⌋r⌊log⁡rm⌋.D(m)=p^{\lfloor\log_p m\rfloor}q^{\lfloor\log_q m\rfloor} r^{\lfloor\log_r m\rfloor}.

The face where the exponent at z vanishes

Fix distinct u,v∈{p,q,r}u,v\in\{p,q,r\} with third prime zz, and let i,j≥0i,j\ge0. For m=uivjm=u^iv^j the formula gives ⌊log⁡um⌋=i+⌊jλuv⌋\lfloor\log_u m\rfloor=i+\lfloor j\lambda_{uv}\rfloor, ⌊log⁡vm⌋=j+⌊iλvu⌋\lfloor\log_v m\rfloor=j+\lfloor i\lambda_{vu}\rfloor and ⌊log⁡zm⌋=⌊iλzu+jλzv⌋\lfloor\log_z m\rfloor=\lfloor i\lambda_{zu}+j\lambda_{zv}\rfloor. Splitting the last floor,

⌊iλzu+jλzv⌋=⌊iλzu⌋+⌊jλzv⌋+e(i,j),e(i,j)=⌊{iλzu}+{jλzv}⌋∈{0,1}.\lfloor i\lambda_{zu}+j\lambda_{zv}\rfloor =\lfloor i\lambda_{zu}\rfloor+\lfloor j\lambda_{zv}\rfloor+e(i,j), \qquad e(i,j)=\bigl\lfloor\{i\lambda_{zu}\}+\{j\lambda_{zv}\}\bigr\rfloor\in\{0,1\}.

Therefore

Tuv(i,j)=α(i) β(j) z−e(i,j),T_{uv}(i,j)=\alpha(i)\,\beta(j)\,z^{-e(i,j)},

with the positive factors

α(i)=u−iv−⌊iλvu⌋z−⌊iλzu⌋,β(j)=v−ju−⌊jλuv⌋z−⌊jλzv⌋.\alpha(i)=u^{-i}v^{-\lfloor i\lambda_{vu}\rfloor} z^{-\lfloor i\lambda_{zu}\rfloor}, \qquad \beta(j)=v^{-j}u^{-\lfloor j\lambda_{uv}\rfloor} z^{-\lfloor j\lambda_{zv}\rfloor}.

A triangular pattern of carry digits

Because λzu\lambda_{zu} and λzv\lambda_{zv} are irrational, the fractional parts {iλzu}\{i\lambda_{zu}\} for i≥1i\ge1 are pairwise distinct, nonzero and dense in [0,1)[0,1), and the same holds for {jλzv}\{j\lambda_{zv}\} with j≥1j\ge1; this is the density of the orbit of an irrational rotation of the circle. Fix N≥1N\ge1. Choose j1,…,jN≥1j_1,\ldots,j_N\ge1 such that yt={jtλzv}y_t=\{j_t\lambda_{zv}\} satisfy

0<y1<y2<⋯<yN<1,0<y_1<y_2<\cdots<y_N<1,

and put y0=0y_0=0. For s=1,…,Ns=1,\ldots,N the interval (1−ys, 1−ys−1)(1-y_s,\,1-y_{s-1}) is a nonempty open subinterval of (0,1)(0,1), so there is is≥1i_s\ge1 with xs={isλzu}x_s=\{i_s\lambda_{zu}\} in it. Then e(is,jt)=1e(i_s,j_t)=1 exactly when yt≥1−xsy_t\ge1-x_s. Since ys−1<1−xs<ysy_{s-1}<1-x_s<y_s, this happens exactly when t≥st\ge s, and equality yt=1−xsy_t=1-x_s never occurs. Hence

e(is,jt)={1,t≥s,0,t<s.e(i_s,j_t)=\begin{cases}1,&t\ge s,\\0,&t<s.\end{cases}

Invertibility

By the two previous sections,

(Tuv(is,jt))s,t=diag⁡(α(is)) M diag⁡(β(jt)),Mst={z−1,t≥s,1,t<s.\bigl(T_{uv}(i_s,j_t)\bigr)_{s,t} =\operatorname{diag}\bigl(\alpha(i_s)\bigr)\,M\, \operatorname{diag}\bigl(\beta(j_t)\bigr), \qquad M_{st}=\begin{cases}z^{-1},&t\ge s,\\1,&t<s.\end{cases}

The diagonal factors are invertible. Subtracting row s+1s+1 of MM from row ss for s=1,…,N−1s=1,\ldots,N-1 leaves the multiple (z−1−1)(z^{-1}-1) of the ss-th unit row vector in row ss, and the last row (1,…,1,z−1)(1,\ldots,1,z^{-1}). Expanding,

det⁡M=z−1(z−1−1)N−1≠0,\det M=z^{-1}\bigl(z^{-1}-1\bigr)^{N-1}\ne0,

since z≥2z\ge2. This proves the first assertion.

No finite separation

Let B1,B2B_1,B_2 be a partition of {p,q,r}\{p,q,r\} into nonempty sets, and suppose T=f1g1+⋯+fKgKT=f_1g_1+\cdots+f_Kg_K at every exponent triple, with each fkf_k a function of the exponents at the primes of B1B_1 and each gkg_k a function of the exponents at the primes of B2B_2. Choose u∈B1u\in B_1 and v∈B2v\in B_2, and let zz be the third prime, which lies in B1B_1 or in B2B_2. At an exponent triple with exponent 00 at zz, each fkf_k becomes a function φk(i)\varphi_k(i) of the exponent ii at uu and each gkg_k a function γk(j)\gamma_k(j) of the exponent jj at vv, so that

Tuv(i,j)=∑k=1Kφk(i)γk(j)(i,j≥0).T_{uv}(i,j)=\sum_{k=1}^K\varphi_k(i)\gamma_k(j) \qquad(i,j\ge0).

For any exponents i1,…,iNi_1,\ldots,i_N and j1,…,jNj_1,\ldots,j_N the matrix (Tuv(is,jt))(T_{uv}(i_s,j_t)) is then the product of the N×KN\times K matrix (φk(is))(\varphi_k(i_s)) and the K×NK\times N matrix (γk(jt))(\gamma_k(j_t)), so its rank is at most KK. Taking N=K+1N=K+1 and the exponents of the first assertion gives an invertible (K+1)×(K+1)(K+1)\times(K+1) matrix of rank at most KK, a contradiction. This proves the second assertion.