丢番图方程(m2+1)x+(cm2-1)y=(am)z

设m,a,c均是大于1的正整数.当am≡1(mod 4)或am≡3(mod 8),3■m或2■a,2|m,3■m时,得到了丢番图方程(m²+1)^x+(cm²-1)^y=(am)^z,1+c=a²,m≥2只有正整数解(x,y,z)=(1,1,2).特别地,当a≡1,3,5 (mod 8),a≠3或a≡7 (mod 8),a≡2(mod 3)时,方程2^x+(a²-2)^y=(a)^z只有正整数解(x,y,z)=(1,1,2).     

关于指数Diophantine方程2~x+p~y=z~2的解的个数的上界估计

设P是一个固定的奇素数.得到了方程2~x+p~y=z~2的所有正整数解(x,y,z)的一个分类.此外,证明了:如果P≡1(mod 4)并且P≠17,那么Diophantine方程2~x+p~y=z~2的全部正整数解(x,y,z)的个数N(p)满足估计N(p)≤4.     

Universal sums of three quadratic polynomials

Let a,b,c,d,e and f be integers with a≥ c≥ e> 0,b>-a and b≡a(mod 2),d>-c and d≡c(mod 2),f>-e and f≡e(mod 2).Suppose that b≥d if a=c,and d≥f if c=e.When b(a-b),d(c-d) and f(e-f) are not all zero,we prove that if each n∈N={0,1,2,...} can be written as x(ax+b)/2+y(cy+d)/2+z(ez+f)/2 with x,y,z∈N then the tuple(a,b,c,d,e,f) must be on our list of 473 candidates,and show that 56 of them meet our purpose.When b∈[0,a),d∈[0,c) and f∈[0,e),we investigate the universal tuples(a,b,c,d,e,f) over Z for which any n∈N can be written as x(ax+b)/2+y(cy+d)/2+z(ez+f)/2 with x,y,z∈Z,and show that there are totally 12,082 such candidates some of which are proved to be universal tuples over Z.For example,we show that any n∈N can be written as x(x+1)/2+y(3y+1)/2+z(5z+1)/2 with x,y,z∈Z,and conjecture that each n∈N can be written as x(x+1)/2+y(3y+1)/2+z(5z+1)/2 with x,y,z∈N.     

关于Fermat方程解的下界的估计

本文证明了:对于适合p≡3(mod4)的素数p,方程x~p+y~p=z~p,p|xyz,0p~(6p-2)/2以及z—x>p~(6p-3)/4。     

ON THE DIOPHANTINE EQUATION X4-Dy2=1(II)

For the Diophantine equation x^4 — Dy^2 = 1 (1) where D>0 and is not a perfect square, we prove the following theorems in this paper. Theorem 1. If D\[{\not \equiv }\]7 (mod 8)，D=p1p2...ps，s≥2，where pi（i = 1，…，s) are distincyt primes，p1≡1(mod 4) such that either 2p1=a^2+b^2，а≡\[ \pm \]3(mod 8)，b三\[ \pm \]3(mod 8) or there is a j(2≤j≤s), for which Legendre symbal \[\left( {\frac{{{p_j}}}{{{p_1}}}} \right) = - 1\],and pi≡7(mod8) (i=2,..., s) or pi≡3(mod 8) (i=2,..., s), then (1) has no solutions in positive integer x,y. Theorem 2. If D=p1...ps,s≥2, where pi（i = 1，…，s) are distinct primes, and pi≡3(mod 4)（i = 1，…，s), then (1) has no solutions in positive integer x, y. Theorem 3. The equation (1) with D=2p1...ps has no solutions in positive integer x, y, if (1) p1≡(mod 4), pi≡7(mod 8) (i = 2, ???, s), snch that either 2p1 = a^2+b^2 a≡\[ \pm \]3(mod 8)，b≡\[ \pm \]3(mod 8)or there is a j (2≤j≤s)，for which \[\left( {\frac{{{p_j}}}{{{p_1}}}} \right) = - 1\]; or (2) p1≡5(mod8),pi≡3(mod8) (i = 2,..., s)； or ⑶p1≡5(mod8)，pi≡7(mod 8) (i=2，…，s). Corollary of theorem 3. If D = 2pq, p≡5(mod 8), q≡3(mod 4), where p, q are distinct primes, then (1) has no solutions in positive integer x, y. Theorem 4. If D=2p1...ps, pi≡3(mod 4)(0 = 1,...,s), then (1) has no solutions In positive integer x, y.     

Diophantine方程y~2=px(x~2+2)

设p是大于3的奇素数.本文证明了:当p≡5或7(mod 8)时,方程y~2=px(x~2+2)无正整数解(x,y);当p≡1(mod 8)时,该方程至多有1组解;当p≡3(mod 8)时,该方程至多有2组解.     

2006高考数学天津卷

一、选择题:共6小题,每小题4分,共24分.1.i是虚数单位,1i+i=A.12+21i B.-21+21iC.21-21i D.-12-21i2.如果双曲线的两个焦点分别为F1(-3,0)、F2(3,0),一条渐近线方程为y=2x,那么它的两条准线间的距离是A.63B.4C.2D.13.设变量x、y满足约束条件y≤xx+y≥2y≥3x-6,则目标函数z=2x+y的最小值为A.2B.3C.4D.94.设集合M={x|0相似文献   

On universal sums of polygonal numbers

For m = 3, 4,..., the polygonal numbers of order m are given by pm(n) =(m- 2) n2 + n(n= 0, 1, 2,...). For positive integers a, b, c and i, j, k 3 with max{i, j, k} 5, we call the triple(api, bpj, cpk)universal if for any n = 0, 1, 2,..., there are nonnegative integers x, y, z such that n = api(x) + bpj(y)+ cpk(z). We show that there are only 95 candidates for universal triples(two of which are(p4, p5, p6) and(p3, p4, p27)), and conjecture that they are indeed universal triples. For many triples(api, bpj, cpk)(including(p3, 4p4, p5),(p4, p5, p6) and(p4, p4, p5)), we prove that any nonnegative integer can be written in the form api(x) + bpj(y) + cpk(z) with x, y, z ∈ Z. We also show some related new results on ternary quadratic forms,one of which states that any nonnegative integer n ≡ 1(mod 6) can be written in the form x2+ 3y2+ 24z2 with x, y, z ∈ Z. In addition, we pose several related conjectures one of which states that for any m = 3, 4,...each natural number can be expressed as pm+1(x1) + pm+2(x2) + pm+3(x3) + r with x1, x2, x3 ∈ {0, 1, 2,...}and r ∈ {0,..., m- 3}.     

综合题新编选登

题164下面玩掷骰子放球游戏,若掷出1点,甲盒中放一球;若掷出2点或3点,乙盒中放一球;若掷出4点、5点或6点,丙盒中放一球.设掷n次后,甲、乙、丙各盒内的球数分别为x,y,z.1)当n=3时,求x,y,z成等差数列的概率;2)当n=6时,求x,y,z成等比数列的概率:解1)∵x y z=3,2y=x z.①x=0,y=1,z=     

关于三项纯指数Diophantine方程ax+by=cz

设a、b、c是互素的正整数.本文证明了:当a b2l-1=c2,b≡5(mod 12),c是适合c≡-1(mod b2l)的奇素数,其中l是正整数时,方程ax by=cz仅有正整数解(x,y,z)=(1,2l-1,2).     

数学问题解答

20 0 4年 1月号问题解答(解答由问题提供人给出 )1 471　求方程组 x+y =ztz+t =xy的非负整数解 .解　因为方程组中x与y ,z与t可以互换 ,所以可以先求满足 0 ≤x≤y ,0 ≤z≤t的整数解组 (x,y ,z,t) .( 1 )若x、z中有一个为零 ,不妨设x=0 ,则由原方程组消去t得 :y+z2 =0所以y =z=0 ,t= 0 .即 ( 0 ,0 ,0 ,0 )是原方程组求的一组解 .( 2 )若x ,z都不是 0 ,但是有一个为 1 ,设x=1 ,则由原方程组消去y得 :t+z=zt - 1所以 (z- 1 ) (t- 1 ) =2 ,因为z,t为正整数且z≤t,所以z - 1 =1t- 1 =2 得z=2 ,t =3,y=5即 ( 1 ,5 ,2 ,3)是原方程组的一组解 ,同…     

趣味数学几例

1.今年元旦是星期日,试问今年元旦后的第1984~(1984)天是星期几。解:∵1984~(1984)=(283×7+3)~(1984) =7m+3~(1984),m∈N。而 3~6≡1(mod7),3~(1984)=3~4×3~(6×330) 3~4≡4(mod7),∴1984~(1984)≡4 (mod7)。答:今年元旦后的第1984~(1984)天是丛期四。 2.若f(x+1)=|x-1|,求f(1984)。解:令 x+1=1984,则x-1=1982, ∴ f(1984)=1982。 3.已知 f(x)=3x+1,g(x)=2x-1,h(g〔f(x)〕)=f(x)。求h(1984)。解:∵ f(y)=3y+1, ∴ g〔f(y)〕=2(3y+1)-1=6y+1, 故h(6y+1)=3y+1。令6y+1=1984,     

数学问题解答

20 0 0年 6月号问题解答(解答由问题提供人给出 )1 2 56　求 77 7　 (n个 7,n≥ 3)的末四位数 .解　∵ 74≡ 1 (mod1 0 0 )∴　 74 x ≡ 1 ((mod1 0 0 ) ,x∈ N又　 7≡ - 1 (mod4) ,故 77≡ (- 1 ) 7≡- 1 (mod4) .因而 77 7　 (n - 1个 7,n - 1≥ 2 )≡- 1 (mod4) .所以可设77 7　 (n - 1个 7,n - 1≥ 2 ) =4x 3,x∈N∴　 77 7≡ 74 x 3≡ 73≡ 43(mod1 0 0 )于是可设 77 7　 (n个 7,n≥ 3) =710 0 m 4 3,m∈ N (1 )而　 74 ≡ 2 4 0 1 (mod1 0 0 0 0 )∴　 78≡ 480 1 (mod1 0 0 0 0 )716≡ 960 1 (mod1 0 0 0 0 )732 ≡ 92 0 1 (mod1…     

椭圆曲线y2=2px(x2+1)上正整数点的个数

设p是奇素数,N(p)是椭圆曲线E:y2=2px(x2+1)的正整数点(x,y)的个数.主要讨论了N(p)的性质,运用初等方法及四次Diophantine方程的性质,对某些特殊素数p,给出了N(p)的上界.证明了当p≡1(mod 8)且p=s2+32t,其中s,t是正整数时,N(p)≤3;当p≡1(mod 8)且p+s...     

关于一个双参数三元不等式的研究

文[1]给出如下结论:设x,yz∈R+,则x/2x+y+z+y/2y+x+z+z/2z+x+y≤3/4.文[2]将这一结论进行指数推广,得到 　　定理A 设x,y,z ∈R+,0相似文献   

上期课外练习参考解答

初一年级1.∵4x+5y+6z=36, ∴(4x+4y+4z)+(y+2z)=36, ∴4(x+y+z)=36-(y+2z), ∴x+y+z=9-y+2z/4. ∵y、z为非负数, ∴y+2z/4的最小值为0(y=0,z=0) 故x+y+z的最大值为9. 下面求x+y+z的最小值. ∵4x+5y+6z=36, ∴(6x+6y+6z)-(2x+y)=36,     

一道考研试题的注记

20 0 3年全国硕士研究生入学考试数学试卷 (一 )的第八题为 :设函数 f ( x)连续且恒大于零 ,F( t) = Ω( t)f ( x2 + y2 + z2 ) dv D( t)f ( x2 + y2 ) dσ,　 G( t) = D( t)f ( x2 + y2 ) dσ∫t- tf ( x2 ) dx,其中Ω ( t) ={( x,y,z) | x2 + y2 + z2 ≤ t2 },D( t) ={( x,y) | x2 + y2 ≤ t2 }.( 1 )讨论 F( t)在区间 ( 0 ,+∞ )内的单调性 ;( 2 )证明当 t>0时 ,F( t) >2πG( t) .本文在这里将给出这一问题的一个一般性命题 ,即如下的 :命题　设函数 f ( x)连续且恒大于零 ,F( t) =∫…∫Vl( t)f ( x21+… + x2l) dx1… dxl∫…∫Vp…     

关于Diophantine方程a~x+b~y=c~z的Terai猜想

设m是正偶数.证明了(A)若b是奇素数,且a=m|m~6-21m~4+35m~2-7|,b=|7m~6-35m~4+21m~2-1|,c=m~2+1,则Diophantine方程G:a~x+b~y=c~z仅有正整数解(x,y,z)=(2,2,7);(B)若m2863,且a=m|m~8-36m~6+126m~4-84m~2+9|,b=|9m~8-84m~6+126m~4-36m~2+1|,c=m~2+1,则Diophantine方程G仅有正整数解(x,y,z)=(2,2,9);(C)若a,b,c适合a=m|∑_(i=0)~((r-1)/2)(-1)~i(_(2i)~r)m~(r-2i-1)|,b=|∑_(i=0)~((r-1)/2)(-1)~i(_(2i+1)~r)m~(r-2i-1)|,c=m~2+1,r≡1(mod4),2|x,2|y,且b为奇素数或m145r(log r),则方程G仅有解(x,y,z)=(2,2,r).     

一个分式不等式的探讨

文 [1]提出如下有趣问题 :设λ、μ、ν为不全为零的非负实数 ,求使不等式xλx+ μy +νz + yλy+ μz +νx +zλz+ μx+νy ≥ 3λ+ μ+ν (1)对任意正实数x ,y ,z都成立的充要条件 .经探讨 ,我们得到了下面的定理 1　当λ、μ、ν≥ 0且 μ ,ν不全为零时 (若 μ =ν =0 ,λ ≠ 0 ,则 (1)为恒等式 ) ,(1)对任意x ,y,z>0成立的充要条件是2λ≤ μ +ν .证明　用 ∑f(x ,y ,z)表示 f(x ,y ,z)+ f(y ,z ,x) + f(z ,x ,y) ,经演算有∑x(λy + μz+νx) (λz+ μx +νz)=λμν∑x3 + (λ3 + μ3 +ν3 + 3λμν)xyz +(λ2 μ+ μ2 ν+ν2 λ) …     

椭圆曲线y~2=x(x-p)(x-q)的整数点(Ⅰ)

设p,q为奇素数,m为正奇数,且p+2~m=q,p≡3(mod4).证明了:当m=1或3时,椭圆曲线y~2=x(x-p)(x-q)(xq)至多有1对整数点(x,y);当m≥5时,该椭圆曲线至多有2对整数点(x,y).同时具体给出了(p,q)=(71,103)时椭圆曲线的全部整数点.