Wiki
Wiki

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

Updated

Taylor expansion on an allowed next digit


This proves L154. Write J⪯pNJ\preceq_pN for the digitwise domination in the statement, and put K=N−JK=N-J. Then 0≤J≤N0\le J\le N, so 0≤j=s+peJ≤n0\le j=s+p^eJ\le n. Since 0≤s≤t<p0\le s\le t<p, the lower ee digits of jj are dominated by those of nn, and the remaining digits are dominated by J⪯pNJ\preceq_pN. Thus p∤(nj)p\nmid\binom nj. For completeness, the Lucas criterion follows by expanding

(1+X)n≡∏r≥0(1+Xpr)nr(modp),(1+X)^n\equiv\prod_{r\ge0}(1+X^{p^r})^{n_r}\pmod p,

where nrn_r are the base-pp digits. The coefficient of XjX^j is ∏r(nrjr)\prod_r\binom{n_r}{j_r}, which is nonzero exactly under domination.

Taylor expansion at the integer point (s,t−s)(s,t-s) has integer coefficients. By the definition of μ\mu and HH,

F(j,n−j)=peμH(J,K)+pe(μ+1)Z,Z∈Z.F(j,n-j)=p^{e\mu}H(J,K)+p^{e(\mu+1)}Z, \qquad Z\in\mathbf Z.

Set x=J mod px=J\bmod p. Domination gives 0≤x≤d0\le x\le d, and K≡d−x(modp)K\equiv d-x\pmod p. The valuation assertion and its equality criterion follow from this display, including the convention for zero.

Because p∤Np\nmid N, d≠0d\ne0 in Fp\mathbf F_p. The polynomial ϕ(X)=H(X,d−X)∈Fp[X]\phi(X)=H(X,d-X)\in\mathbf F_p[X] has degree at most μ\mu and is nonzero. Indeed, homogeneity gives the identity in Fp(X,Y)\mathbf F_p(X,Y)

H(X,Y)=(X+Yd)μϕ ⁣(dXX+Y).H(X,Y)=\left(\frac{X+Y}{d}\right)^\mu \phi\!\left(\frac{dX}{X+Y}\right).

If ϕ\phi vanished identically, every coefficient of HH would vanish modulo pp, contrary to the hypothesis. It has at most μ\mu roots. When d≥μd\ge\mu, the d+1d+1 distinct residues 0,…,d0,\ldots,d therefore include a nonroot xx. Take J=xJ=x, with all higher digits zero. Then J⪯pNJ\preceq_pN, and the equality criterion gives vpF(j,n−j)=eμv_pF(j,n-j)=e\mu as required. □\square