An analogue of a theorem of Szüsz for formal Laurent series over finite fields

About 40 years ago, Szüsz proved an extension of the well-known Gauss-Kuzmin theorem. This result played a crucial role in several subsequent papers (for instance, papers due to Szüsz, Philipp, and the author). In this note, we provide an analogue in the field of formal Laurent series and outline applications to the metric theory of continued fractions and to the metric theory of diophantine approximation.     

关于指数丢番图方程a~x+b~y=c~z的Terai猜想

本文证明了:当a=|m(m4-10m2+)|,b=5m4-10m2+1,c=m2+1,其 中m是偶数时,如果m≥542,则方程ax+by=cz仅有正整数解(x,y,z)=(2,2,5).     

关于丢番图方程的一个注记

本文得到了Ｓｈｏｒｅｙ和Ｔｉｊｄｅｍａｎ关于不定方程的一个猜想的一个结果，并且基本上解决了Ｅｄｇａｒ的关于上述不定方程的一个猜想．     

On the Diophantine Equation x+q=y

In this paper it has been proved that if q is an odd prime, q?7 (mod 8), n is an odd integer ?5, n is not a multiple of 3 and (h,n)=1, where h is the class number of the filed Q(√−q), then the diophantine equation x²+q^2k+1=yⁿ has exactly two families of solutions (q,n,k,x,y).     

算术数列中的素变数丢番图逼近

证明了:设λ1,λ2,λ3是非零实数,并且不同一符号,η是实数,λ1/λ2是无理数,h是一个给定的正整数,l1,l2,l3是整数,如果广义黎曼猜想成立,那么有无穷多有序素数对p1,p2,p3(pj≡lj(mod h),j=1,2,3)使得|λ1p1 λ2p2 λ3p3 η|＜(max pj)-(1)(10)(log max pj)5.     

一类广义Catalan数及其应用

引进了一类广义Catalan数,并赋予这类广义Catalan数组合意义,用这类广义Catalan数得到一类不定方程的解数.     

孪生素数椭圆曲线E_的整数点

设p和q是孪生素数.本文讨论了椭圆曲线E_上的非平凡整数点.运用初等数论方法证明了该椭圆曲线至多有1组非平凡整数点(x,±y).     

Groupe modulaire, fractions continues et approximation diophantienne en caractéristique p

The aim of this paper is to give a geometric interpretation of the continued fraction expansion in the field of formal Laurent series in X ^–1 over , in terms of the action of the modular group on the Bruhat–Tits tree of , and to deduce from it some corollaries for the diophantine approximation of formal Laurent series in X ^–1 by rational fractions in X.     

Almost Squares in Arithmetic Progression

It is proved that a product of four or more terms of positive integers in arithmetic progression with common difference a prime power is never a square. More general results are given which completely solve (1.1) with gcd(n, d)=1, k3 and 1<d104.     

Counting solutions to trinomial Thue equations: a different approach

We consider the problem of counting solutions to a trinomial Thue equation -- that is, an equation

where is an irreducible form in with degree at least three and with three non-zero coefficients. In a 1987 paper J. Mueller and W. Schmidt gave effective bounds for this problem. Their work was based on a series of papers by Bombieri, Bombieri-Mueller and Bombieri-Schmidt, all concerned with the ``Thue-Siegel principle" and its relation to . In this paper we give specific numerical bounds for the number of solutions to by a somewhat different approach, the difference lying in the initial step -- solving a certain diophantine approximation problem. We regard this as a real variable extremal problem, which we then solve by elementary calculus.