具有四项的指数丢番图方程(Ⅱ)

本文中，我们给出了丢番图方程的解ｘ，ｙ，ｚ，ｗ的上界，其中ｐ，ｑ是给定的互素的正整数，ａ，ｂ，ｃ，ｄ是给定的适合ａｂｅｄ≠０的整数，此外，我们将指出在具体情形下如何把上界降低到方程允许的实际的解．最后，我们将用这个方法来解方程１９．５ｘ·１７ｙ＝１２．５ｚ＋４１．１７ｗ＋１４， ５． ３ｘ· １３ｙ ＋ ２０＝ ７． ３ｚ ＋ １４． １３ｗ和 １３· ２ｘ＋ ５· ３ｙ＝ ２５． ２ｚ＋ １１． ３ｗ．     

具有四项的指数丢番图方程(Ⅲ)

根据定理 １,２和 ３;求任何一个方程 ａ~ｘ－ｂ~ｙ＝ｎ,ａ~ｘｂ~ｙ±ａ~ｚ±ｂ~ｗ±１＝０ 或ａ~ｘ±ｂ~ｙ±ａ~ｚ±ｂ~ｗ＝０（ｘ,ｙ,ｚ,ｗ∈≥０）的解都是很简单的,此处ａ,ｂ是适合 ２ ≤５ ａ,ｂ≤５０的互素的两个整数,ｎ是适合１≤ｎ≤８００００的整数．     

具有四项的指数丢番图方程(Ⅲ)

根据定理 １,２和 ３;求任何一个方程 ａ~ｘ－ｂ~ｙ＝ｎ,ａ~ｘｂ~ｙ±ａ~ｚ±ｂ~ｗ±１＝０ 或ａ~ｘ±ｂ~ｙ±ａ~ｚ±ｂ~ｗ＝０（ｘ,ｙ,ｚ,ｗ∈≥０）的解都是很简单的,此处ａ,ｂ是适合 ２ ≤５ ａ,ｂ≤５０的互素的两个整数,ｎ是适合１≤ｎ≤８００００的整数．     

关于方程a~x b~y=c~z的Terai-Jemanowicz猜想

设ｍ是正整数,证明了：（Ａ）如果ｂ是奇素数,且ａ＝ｍ３－３ｍ,ｂ＝３ｍ２－１,ｃ＝ｍ２＋１, 那么丢番图方程 ａｘ＋ ｂｙ＝ｃｚ（１）仅有正整数解（ｘ,ｙ,ｚ）＝（２,２,３）;（Ｂ）如果ｂ是奇素数,且 ａ＝ｍ｜ｍ４－１０ｍ２＋５｜,ｂ＝５ｍ４－１０ｍ２＋５｜,ｂ＝ ５ｍ４－１０ｍ２＋１, ｃ＝ｍ２＋ １,那么丢番图方程（１）仅有正整数解 （ｘ,ｙ,ｚ）＝（２,２,５）．     

关于丢番图方程x^2±2^m=y^n

本文证明了：方程ｘ２＋２ｍ＝ｙｎ，ｘ，ｙ，ｍ，ｎ∈Ｎ，ｇｃｄ（ｘ，ｙ）＝１，ｎ＞２仅有有限多组解（ｘ，ｙ，ｍ，ｎ），而且当（ｘ，ｙ，ｍ，ｎ）≠（５，３，１，３），（１１，５，２，３），（７，３，５，４）时，ｎ是适合ｎ≡７（ｍｏｄ８）以及２３≤ｎ＜８．５·１０６的奇素数，ｍａｘ（ｘ，ｙ，ｍ）＜Ｃ１；方程ｘ２－２ｍ＝ｙｎ，ｘ，ｙ，ｍ，ｎ∈Ｎ，ｇｃｄ（ｘ，ｙ）＝１，ｙ＞１；ｎ＞２仅有有限多组解（ｘ，ｙ，ｍ，ｎ），而且这些解都满足ｎ＜２·１０９炉以及ｍａｘ（ｘ，ｙ，ｍ）＜Ｃ２，这里Ｃ１，Ｃ２是可有效计算的绝对常数．     

数学问题解答

数学问题解答１９９４年３月号问题解答（解答由问题提供人给出）８８１求方程的一个正整数解．ｘ２ｙ３ｚ５解原方程即为即１９９４·１９９５ｎ＋１９９５ｎ＝１９９５ｎ＋１．由１９９４·１９９５－５＋１９９５－６＝１９９５－５，即１９９４．（１９９５ａ）－２＋...     

关于丢番图方程D1x^2＋2^mD2=y^n的解数

设Ｄ１、Ｄ２、ｍ、ｘ、ｙ是适合Ｄ１〉１，Ｄ２〉１，２├Ｄ１Ｄ２，ｇｃｄ（Ｄ１，Ｄ２）＝ｇｃｄ（ｘ，ｙ）＝１的正整数，ｎ是适合ｎ├ｈ的奇素数，其中ｈ是虚二次域Ｑ（√－２＾ｍＤ１Ｄ２）的类数。本文主要证明了：方程Ｄ１ｘ＾２＋２＾ｍＤ２＝ｙ＾ｎ至多有５．１０＾１６组例外解（Ｄ１，Ｄ２，ｘ，ｙ，ｍ，ｎ）而且这些解都满足了７≤ｎ〈８．５．１０＾６以及ｙ＾ｎ〈ｅｘｐ（ｅｘｐ（ｅｘｐ４６））。     

不定方程6y^2=x（x＋1）（2x＋1）的解的简洁初等证明

不定方程６ｙ￣２＝ｘ（ｘ＋１）（２ｘ＋１）的解的简洁初等证明汉江机床厂何宗友１８７５年卡斯（Ｌｕｃａｓ）问不定方程或是否仅有非平凡解ｘ＝２４，ｙ＝７０．１９１９年沃森（Ｗａｔｓｏｎ）、１９５２年琼格伦（Ｌｊｕｎｇｇｒｅｎ）分别利用椭圆函数与二次域理论...     

一类不定方程恒有正整数解的几个判别法则

一类不定方程恒有正整数解的几个判别法则邱天绪，树华（老河口师专４４１８００）《数学通讯》１９９５年第１期，在问题征解栏中，有如下一道数学征解题：“证明对于任意自然数ｎ，方程ｘ２＋２ｙ２＝１７ｎ（Ⅰ）恒有整数解．作者发现此不定方程尚可进一步的推广．本文...     

巧解一次方程组

解一次方程组的思想是消元，消元后转化为一元一次方程．但还要注意仔细观察，认真分析题目的特征、巧妙、灵活地运用消元法来解题．例１　解方程组（１）２ｘ＋ｙ－ｚ＝２，ｘ＋２ｙ＋３ｚ＝１３，－３ｘ＋ｙ－２ｚ＝－１１；　①②③（２）ｘ＋２ｙ－３ｚ＝－４，４ｘ＋８ｙ＋９ｚ＝５，２ｘ＋６ｙ－９ｚ＝－１５．　①②③分析　上面两题若逐步消元，都比较麻烦．仔细观察，发现方程组（１）三式相加可得ｙ；而方程组（２）呢，可先整体消元求出ｘ和ｚ，于是得妙解．（１）解　由①＋②＋③得４ｙ＝４，即ｙ＝１．把ｙ＝１代入①、②，得…     

The Equation f(X) = f(Y) in Rational Functions X = X(t), Y = Y(t)

We determine all the complex polynomials f(X) such that, for two suitable distinct, nonconstant rational functions g(t) and h(t), the equality f(g(t)) = f(h(t)) holds. This extends former results of Tverberg, and is a contribution to the more general question of determining the polynomials f(X) over a number field K such that f(X) – has at least two distinct K-rational roots for infinitely many K.     

Sur L'equation Diophantienne (xn-1)/(x-1)=yq, III

In this paper we study the diophantine equation of the title,which was first introduced by Nagell and Ljunggren during thefirst half of the twentieth century. We describe a method whichallows us, on the one hand when n is fixed, to obtain an upperbound for q, and on the other hand when n and q are fixed, toobtain upper bounds for x and y which are far sharper than thosederived from the theory of linear forms in logarithms. We alsoshow how these bounds can be used even when they seem too largefor a straightforward enumeration of the remaining possiblevalues of x. By combining all these techniques, we are ableto solve the equation in many cases, including the case whenn has a prime divisor less than 13, or the case when n has aprime divisor which is less than or equal to 23 and distinctfrom q. 2000 Mathematical Subject Classification: primary 11D41;secondary 11J86, 11Y50.     

On the ratio of values of a polynomial

For given positive integersa andb, the equationa(x + 1)… (x + k) =b(y+1)… (y + k) in positive integers is considered. More general equations are also considered.     

A Generalization of Vinogradov's Mean Value Theorem

We obtain new upper bounds for the number of integral solutionsof a complete system of symmetric equations, which may be viewedas a multi-dimensional version of the system considered in Vinogradov'smean value theorem. We then use these bounds to obtain Weyl-typeestimates for an associated exponential sum in several variables.Finally, we apply the Hardy–Littlewood method to obtainasymptotic formulas for the number of solutions of the Vinogradov-typesystem and also of a related system connected to the problemof finding linear spaces on hypersurfaces. 2000 MathematicsSubject Classification 11D45, 11D72, 11L07, 11P55.     

On the Brocard–Ramanujan Diophantine Equation n! + 1 = m2

In 1876, H. Brocard posed the problem of finding all integral solutions to n! + 1 = m². In 1913, unaware of Brocard's query, S. Ramanujan gave the problem in the form, The number 1 + n! is a perfect square for the values 4, 5, 7 of n. Find other values. We report on calculations up to n = 10⁹ and briefly discuss a related problem.     

A complete diophantine characterization of the rational torsion of an elliptic curve

We give a complete characterization for the rational torsion of an elliptic curve in terms of the (non-)existence of integral solutions of a system of diophantine equations.     

方程y~2=nx(x~2±1)的正整数解数的上界(英文)

设n是无平方因子正整数.本文利用二次和四次Diophantine方程解数的结果,讨论了方程y~2=nx(x~2±1)的正整数解个数的上界,证明了该方程至多有2~w(n)个正整数解(x,y),其中w(n)是n的不同素因数的个数.     

On the equationx(x +d 1)…(x + (k - 1)d 1) =y(y +d 2)…(y + (mk - 1)d 2)

For given positive integersm ≥ 2,d ₁ andd ₂, we consider the equation of the title in positive integersx, y andk ≥ 2. We show that the equation implies thatk is bounded. For a fixedk, we give conditions under which the equation implies that max(x, y) is bounded. Dedicated to the memory of Professor K G Ramanathan