On the Diophantine System a^2 ＋ b^2 = c^3 and a^x ＋ b^y = c^z for b is an Odd Prime

Let a, b and c be fixed coprime positive integers. In this paper we prove that if a^2 ＋ b^2 = c^3 and b is an odd prime, then the equation a^x ＋ b^y = c^z has only the positive integer solution （x, y, z） = （2,2,3）.     

On Jemanowicz’ Conjecture Concerning Pythagorean Triples

Let(a, b, c) be a primitive Pythagorean triple. Je′smanowicz conjectured in 1956 that for any positive integer n, the Diophantine equation(an)x+(bn)y=(cn)z has only the positive integer solution(x, y, z) =(2, 2, 2). Let p ≡ 3(mod 4) be a prime and s be some positive integer. In the paper, we show that the conjecture is true when(a, b, c) =(4p2s-1, 4p s, 4p2s+ 1) and certain divisibility conditions are satisfied.     

关于商高数的Je\'{s}manowicz猜想

Let(a, b, c) be a primitive Pythagorean triple. Je′smanowicz conjectured in 1956 that for any positive integer n, the Diophantine equation(an)x+(bn)y=(cn)z has only the positive integer solution(x, y, z) =(2, 2, 2). Let p ≡ 3(mod 4) be a prime and s be some positive integer. In the paper, we show that the conjecture is true when(a, b, c) =(4p2s-1, 4p s, 4p2s+ 1) and certain divisibility conditions are satisfied.     

A Remark on Jesmanowicz' Conjecture for the Non-coprimality Case

Let a, b, c be relatively prime positive integers such that a2+ b2= c2. Je′smanowicz'conjecture on Pythagorean numbers states that for any positive integer N, the Diophantine equation(aN)x+(b N)y=(cN)zhas no positive solution(x, y, z) other than x = y = z = 2. In this paper, we prove this conjecture for the case that a or b is a power of 2.     

HYPERSTABILITY OF THE GENERALIZED CAUCHY-JENSEN FUNCTIONAL EQUATION IN ULTRAMETRIC SPACES

In this article, we prove hyperstability results of the generalized Cauchy-Jensen functional equation αf ((x + y)/α+ z) = f(x) + f(y) + αf(z) for any fixed positive integer α≥ 2 in ultrametric Banach spaces by using fixed point method.     

某些Ruzsa数$R_m$的新上界

For A ■ Z m and n ∈ Z m ,let σ A (n) be the number of solutions of equation n = x + y,x,y ∈ A.Given a positive integer m,let R m be the least positive integer r such that there exists a set A ■ Z m with A + A = Z m and σ A (n) ≤ r.Recently,Chen Yonggao proved that all R m ≤ 288.In this paper,we obtain new upper bounds of some special type R kp 2 .     

关于积分∫f(x,{λx})dx渐近展开的一种新推导及余项估计

Assume that f(x,y) is a continuous function defined on unit square 0≤x≤1,0≤y≤1 and having continuous partial derivatives with respect to x, of orders up to r, where r is a positive integer. In a recent work, applying Euler-Maclaurin formula, the following expansion has been proved.     

活用点（x1＋x2，x1x2）的轨迹方程解题

在学习直线与圆锥曲线的位置关系时,不少学生使用韦达定理具有一定的盲目性.特别是遇到较复杂的问题时,更是如此.对此,在教学中我们给学生装上“轨迹思想”的方向盘,使问题有了很好的解决.我们引入弦的端点坐标(x1,y1),(x2,y2),构造点(x2+x2,x1x2),或点(y1+y2,y1y2),先求出点的轨迹方程,再结合韦达定理求出该点的坐标,代入所求轨迹方程,或利用点的存在域x1x2≤14(x1+x2)2,然后求解.这样处理,思路清晰,许多问题迎刃而解.例1已知A,B为抛物线y2=2px(p>0)上两点,且OA⊥OB,原点O在AB上的射影为D(2,1),求此抛物线方程.解设A,B的坐标分别为(x1…     

On the Addition of Two Cubes of Units and Nonunits mod p~α

Let p ≡ 2(mod 3) be an odd prime and α be a positive integer. In this paper,for any integer c, we obtain a formula for the number of solutions of the cubic congruence x~3+ y~3≡ c(mod p~α) with x, y units, nonunits and mixed pairs, respectively. We resolve a problem posed by Yang and Tang.     

话说不等式x1x2＜0

1 高中教师的赛题以下的这道赛题,本来是用来考高中教师的:赛题试求最大的常数λ,使得下列不等式对于满1足条件x+y+z=0的实数x,y,z恒成立:1/5x2+6x+12+1/5y2+6y+12+1/5z2+6z+12≤λ.     

话说不等式x1x2＜0

1 高中教师的赛题以下的这道赛题,本来是用来考高中教师的:赛题试求最大的常数λ,使得下列不等式对于满足条件x+y+z=0的实数x,y,z恒成立:1/5x2+6x+12+1/5y2+6y+12+1/5z2+6z+12≤λ趣事 一位初中学生看到了这道题目,他说式中的λ=1/4.     

LIMIT CYCLES OF THE GENERALIZED POLYNOMIAL LINARD DIFFERENTIAL SYSTEMS

Using the averaging theory of first and second order we study the maximum number of limit cycles of generalized Linard differential systems{x = y + εh_l~1(x) + ε~2h_l~2(x),y=-x- ε(f_n~1(x)y~(2p+1) + g_m~1(x)) + ∈~2(f_n~2(x)y~(2p+1) + g_m~2(x)),which bifurcate from the periodic orbits of the linear center x = y,y=-x,where ε is a small parameter.The polynomials h_l~1 and h_l~2 have degree l;f_n~1and f_n~2 have degree n;and g_m~1,g_m~2 have degree m.p ∈ N and[·]denotes the integer part function.     

椭圆曲线y2=px（x2＋2）的正整数点

本文研究了椭圆曲线y2＝px(x2+2)的正整数点(x,y).通过改进四次Diophantine方程解数的上界,证明了:当p≠3时,该椭圆曲线至多有2组正整数点(x,y).     

Weighted polyharmonic equation with Navier boundary conditions in a half space

We study positive solutions of the following polyharmonic equation with Hardy weights associated to Navier boundary conditions on a half space:?????(-?)~mu(x)=u~p(x)/|x|~s,in R_+~n,u(x)=-?u(x)=…=(-?)~(m-1)u(x)=0,on ?R_+~n,(0.1)where m is any positive integer satisfying 02mn.We first prove that the positive solutions of(0.1)are super polyharmonic,i.e.,(-?)~iu0,i=0,1,...,m-1.(0.2) For α=2m,applying this important property,we establish the equivalence between (0.1) and the integral equation u(x)=c_n∫R_+~n(1/|x-y|~(n-α)-1/|x~*-y|~(n-α))u~p(y)/|y|~sdy,(0.3) where x~*=(x1,...,x_(n-1),-x_n) is the reflection of the point x about the plane R~(n-1).Then,we use the method of moving planes in integral forms to derive rotational symmetry and monotonicity for the positive solution of(0.3),in whichαcan be any real number between 0 and n.By some Pohozaev type identities in integral forms,we prove a Liouville type theorem—the non-existence of positive solutions for(0.1).     

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}.     

圈的$L(d_1,d_2,\ldots,d_t)$-数$\lambda(C_n;d_1,d_2,\ldots,d_t)$

An L（d0,d2,...,dt）-labeling of a graph G is a function f from its vertex set V（G） to the set {0,1,..., k} for some positive integer k such that If（x） - f（y）l ≥di, if the distance between vertices x and y in G is equal to i for i = 1,2,...,t. The L（d1,d2,...,dt）-number λ（G;d1,d2,... ,dt） of G is the smallest integer number k such that G has an L（d1,d2,...,dr）- labeling with max{f （x）｜x ∈ V（G）} = k. In this paper, we obtain the exact values for λ（Cn; 2, 2, 1） and λ（Cn; 3, 2, 1）, and present lower and upper bounds for λ（Cn; 2,..., 2, 1,..., 1）     

L(d1, d2,..., dt)-Number λ(Cn; d1, d2,...,dt) of Cycles

An L(d1,d2,...,dt)-labeling of a graph G is a function f from its vertex set V(G) to the set {0, 1,..., k} for some positive integer k such that {f(x) - f(y)| ≥ di, if the distance between vertices x and y in G is equal to i for i = 1,2,...,t. The L(d1,d2,...,dt)-number λ(G;d1,d2,... ,dt) of G is the smallest integer number k such that G has an L(d1,d2,... ,dt)labeling with max{f(x)|x ∈ V(G)} = k. In this paper, we obtain the exact values for λ(Cn; 2, 2,1) and λ(Cn; 3, 2, 1), and present lower and upper bounds for λ(Cn; 2,..., 2,1,..., 1)     

关于不定方程y(y+1)(y+2)(y+3)=4n~2x(x+1)(x+2)(x+3)

设1n∈N*,运用Pell方程的一些结果以及代数数论和p-adic分析方法证明了不定方程y(y+1)(y+2)(y+3)=4n~2x(x+1)(+2)(x+3)(x,y∈N*)除开n=1189时仅有一组解(x,y)=(33,1680)外,无其他解.     

On the elliptic curve y 2 = x 3 −2rDx and factoring integers

Let D=pq be the product of two distinct odd primes.Assuming the parity conjecture,we construct infinitely many r≥1 such that E2rD:y2=x3-2rDx has conjectural rank one and vp(x([k]Q))≠vq(x([k]Q))for any odd integer k,where Q is the generator of the free part of E(Q).Furthermore,under the generalized Riemann hypothesis,the minimal value of r is less than c log4 D for some absolute constant c.As a corollary,one can factor D by computing the generator Q.     

浅谈求函数y=a1x2+b1x+c1/a2x2+b2x+c2值域的判别式法

函数y=a1x2+b1x+c1/a2x2+b2x+c2值域的求法,很多资料上给出方法是判别式(即△)法,而一旦自变量的范围给以限定,当△法失效时,还有其他方法吗?一般资料上就避而不谈了.要全面系统解决函数y=a1x2+b1x+c1/a2x2+b2x+c2值域的问题,本文以为需解决以下三个事情:①判别式法的过程和依据,②自变量有限制时还能用判别式法吗?③自变量有范围限制,问题可以归结为三类常见函数:反比例函数;y=t+c/t(c＞0);y=t+c/t(c＜0)的值域求法.