1) Diophantine Equations
丢蕃图方程
1.
The Applications of Continued Fractions in Diophantine Equations and Continued Fractions Algorithm in Algebraic equation p-adic solution;
连分数解丢蕃图方程的p-adic算法
2) Diophantine equation
丢番图方程
1.
On the Diophantine equation x~p-1=Dy~n;
关于丢番图方程x~p-1=Dy~n
2.
On the solution of the Diophantine equations x~2-2p=y~n;
关于丢番图方程x~2-2p=y~n的解
3.
On the Diophantine equation(15n)~x+(112n)~y=(113n)~z;
关于丢番图方程(15n)~x+(112n)~y=(113n)~z
3) diophantine equations
丢番图方程
1.
On the Diophantine equations x~4±y~6=z~2 and x~2+y~4=z~6;
关于丢番图方程x~4±y~6=z~2与x~2+y~4=z~6
2.
When p is a odd prime and p ≠1 (mod 8), we get all solutions of diophantine equations ( x(x+1)(2x+1)=2p~ky~(2n) ) with elementary theory of number.
若p为奇素数,且p≠1(mod8)时,本文给出了丢番图方程x(x+1)(2x+1)=2pky2n的所有正整数解,并给出了Lucas猜想的一个简单证明。
3.
With the help of the elementary theory of number and Fermat method of infinite descent,some necessary conditions have been proved provided that the Diophantine equations x 4+mx 2y 2+ny 4=z 2 has positive Integer solutions that fit (x,y) =1 m.
利用数论方法及Fermat无穷递降法 ,证明了丢番图方程x4 +mx2 y2 +ny4 =z2 在 (m ,n) =(± 6,-3 ) ,(6,3 ) ,(± 3 ,3 ) ,(-12 ,2 4) ,(± 12 ,-2 4) ,(± 6,15 ) ,(-6,-15 ) ,(3 ,6)仅有平凡整数解 ,并且获得了方程在 (-6,3 ) ,(12 ,2 4) ,(3 ,-6) ,(-6,3 3 )时的无穷多组正整数解的通解公式 ,从而完善了Aubry等人的结
4) diophantus equation
丢番图方程
1.
Let p>3 be a prime integer prime,when the elementary grade method and the Diophantus Equation theories are used.
设p>3为素数,证明了丢番图方程x6-y6=2pz2无正整数解,证明了丢番图方程x6+y6=2pz2在p 1(mod24)时无正整数解,同时获得了方程在p≡1(mod24)时有正整数解的计算公式。
2.
In this paper two theorems are given by using matrixvector description of polynomial multiplication, which are useful to resolve the Diophantus equation.
采用多项式乘积的矩阵－向量表示方法，证明了对求解丢番图方程极为有用的定理１和定理２，从丢番图方程的基本解法着手，给出了各种设计要求下的极点配置算法。
6) higher degree diophantine equation
高次丢番图方程
补充资料：丢丢秀秀
1.形容身躯细小，脚步轻盈。
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条