42,419 research outputs found

    On formal inverse of the Prouhet-Thue-Morse sequence

    Full text link
    Let pp be a prime number and consider a pp-automatic sequence u=(un)n∈N{\bf u}=(u_{n})_{n\in\N} and its generating function U(X)=∑n=0∞unXn∈Fp[[X]]U(X)=\sum_{n=0}^{\infty}u_{n}X^{n}\in\mathbb{F}_{p}[[X]]. Moreover, let us suppose that u0=0u_{0}=0 and u1≠0u_{1}\neq 0 and consider the formal power series V∈Fp[[X]]V\in\mathbb{F}_{p}[[X]] which is a compositional inverse of U(X)U(X), i.e., U(V(X))=V(U(X))=XU(V(X))=V(U(X))=X. In this note we initiate the study of arithmetic properties of the sequence of coefficients of the power series V(X)V(X). We are mainly interested in the case when un=tnu_{n}=t_{n}, where tn=s2(n)(mod2)t_{n}=s_{2}(n)\pmod{2} and t=(tn)n∈N{\bf t}=(t_{n})_{n\in\N} is the Prouhet-Thue-Morse sequence defined on the two letter alphabet {0,1}\{0,1\}. More precisely, we study the sequence c=(cn)n∈N{\bf c}=(c_{n})_{n\in\N} which is the sequence of coefficients of the compositional inverse of the generating function of the sequence t{\bf t}. This sequence is clearly 2-automatic. We describe the sequence a{\bf a} characterizing solutions of the equation cn=1c_{n}=1. In particular, we prove that the sequence a{\bf a} is 2-regular. We also prove that an increasing sequence characterizing solutions of the equation cn=0c_{n}=0 is not kk-regular for any kk. Moreover, we present a result concerning some density properties of a sequence related to a{\bf a}.Comment: 16 pages; revised version will appear in Discrete Mathematic

    On primitive integer solutions of the Diophantine equation t2=G(x,y,z)t^2=G(x,y,z) and related results

    Full text link
    In this paper we investigate Diophantine equations of the form T2=G(X‾),  X‾=(X1,…,Xm)T^2=G(\overline{X}),\; \overline{X}=(X_{1},\ldots,X_{m}), where m=3m=3 or m=4m=4 and GG is specific homogenous quintic form. First, we prove that if F(x,y,z)=x2+y2+az2+bxy+cyz+dxz∈Z[x,y,z]F(x,y,z)=x^2+y^2+az^2+bxy+cyz+dxz\in\Z[x,y,z] and (b−2,4a−d2,d)≠(0,0,0)(b-2,4a-d^2,d)\neq (0,0,0), then the Diophantine equation t2=nxyzF(x,y,z)t^2=nxyzF(x,y,z) has solution in polynomials x,y,z,tx, y, z, t with integer coefficients, without polynomial common factor of positive degree. In case a=d=0,b=2a=d=0, b=2 we prove that there are infinitely many primitive integer solutions of the Diophantine equation under consideration. As an application of our result we prove that for each n\in\Q\setminus\{0\} the Diophantine equation \begin{equation*} T^2=n(X_{1}^5+X_{2}^5+X_{3}^5+X_{4}^5) \end{equation*} has a solution in co-prime (non-homogenous) polynomials in two variables with integer coefficients. We also present a method which sometimes allow us to prove the existence of primitive integers solutions of more general quintic Diophantine equation of the form T2=aX15+bX25+cX35+dX45T^2=aX_{1}^5+bX_{2}^5+cX_{3}^5+dX_{4}^5, where a,b,c,d∈Za, b, c, d\in\Z. In particular, we prove that for each m,n∈Z∖{0},m, n\in\Z\setminus\{0\}, the Diophantine equation \begin{equation*} T^2=m(X_{1}^5-X_{2}^5)+n^2(X_{3}^5-X_{4}^5) \end{equation*} has a solution in polynomials which are co-prime over Z[t]\Z[t]. Moreover, we show how modification of the presented method can be used in order to prove that for each n\in\Q\setminus\{0\}, the Diophantine equation \begin{equation*} t^2=n(X_{1}^5+X_{2}^5-2X_{3}^5) \end{equation*} has a solution in polynomials which are co-prime over Z[t]\Z[t].Comment: 17 pages, submitte
    • …
    corecore