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 the Terai-Jésmanowicz conjecture

In this paper, we prove that if a, b and c are pairwise coprime positive integers such that a^2＋b^2=c^r,a〉b,a≡3 （mod4）,b≡2 （mod4） and c-1 is not a square, thena a^x＋b^y=c^z has only the positive integer solution （x, y, z） = （2, 2, r）.
Let m and r be positive integers with 2｜m and 2 r, define the integers Ur, Vr by （m ＋√-1）^r=Vr＋Ur√-1. If a = ｜Ur｜,b=｜Vr｜,c = m^2＋1 with m ≡ 2 （mod 4）,a ≡ 3 （mod 4）, and if r 〈 m/√1.5log3（m^2＋1）-1, then a^x ＋ b^y = c^z has only the positive integer solution （x,y, z） = （2, 2, r）. The argument here is elementary.     

A Conjecture Concerning the Pure Exponential Diophantine Equation a^x ＋ b^y = c^z

Let a, b, c, r be fixed positive integers such that a^2 ＋ b^2 = c^r, min（a, b, c, r） 〉 1 and 2 r. In this paper we prove that if a ≡ 2 （mod 4）, b ≡ 3 （mod 4）, c 〉 3.10^37 and r 〉 7200, then the equation a^x ＋ b^y = c^z only has the solution （x, y, z） = （2, 2, r）.     

Composite Integers n for Which φ（n）｜n- 1

In this note, we show that the number of composite integers n ≤ x such that φ（n）｜n - 1 is at most O（x^1/2（loglog x）^1/2）, thus improving earlier results by Pomerance and by Shan.     

Romanoff theorem in a sparse set

Let A be any subset of positive integers,and P the set of all positive primes.Two of our results are:(a) the number of positive integers which are less than x and can be represented as 2k + p(resp.p-2k) with k ∈ A and p ∈ P is more than 0.03A(log x/log 2)π(x) for all sufficiently large x;(b) the number of positive integers which are less than x and can be represented as 2q + p with p,q ∈ P is(1 + o(1))π(log x/log 2)π(x).Four related open problems and one conjecture are posed.     

On the Non-Commutative Neutrix Product of the Distributions x＋^λ and x^＋μ

Let f and g be distributions and let gn = （g ＊ δn）（x）, where δn （x） is a certain converging to the Dirac delta function. The non-commutative neutrix product fog of f and g to be the limit of the sequence {fgn }, provided its limit h exists in the sense that sequence is defined N-lim n-∞（f（x）g,, （x）, φ（x）〉 = （h（x）, φ（x）},for all functions p in 2. It is proved that （x^λ＋1n^px＋）0（x^μ＋1n^qx＋）=x＋^λμ1n^p＋qx＋,（x^λ-1n^qx-）=x-^λ＋μ1n^p＋qx-,for λ＋μ〈-1; λ,μ, λ＋μ≠-1,-2…and p,q=0,1,2……     

Five consecutive positive odd numbers none of which can be expressed as a sum of two prime powers II

In this paper, we find two integers k0, m of 159 decimal digits such that if k ≡ k0 （mod m）, then none of five consecutive odd numbers k, k - 2, k - 4, k - 6 and k - 8 can be expressed in the form 2^n ± p^α, where p is a prime and n, α are nonnegative integers.     

The abc-conjecture for Algebraic Numbers

The abe-conjecture for the ring of integers states that, for every ε 〉 0 and every triple of relatively prime nonzero integers （a, b, c） satisfying a ＋ b = c, we have max（｜a｜, ｜b｜, ｜c｜） 〈 rad（abc）^1＋ε with a finite number of exceptions. Here the radical rad（m） is the product of all distinct prime factors of m. In the present paper we propose an abe-conjecture for the field of all algebraic numbers. It is based on the definition of the radical （in Section 1） and of the height （in Section 2） of an algebraic number. From this abc-conjecture we deduce some versions of Fermat＇s last theorem for the field of all algebraic numbers, and we discuss from this point of view known results on solutions of Fermat＇s equation in fields of small degrees over Q.     

NOTES ON GLAISHER''''S CONGRUENCES

Let p be an odd prime and let n ≥ 1,k ≥ 0 and r be integers. Denote by Bk the kth Bernoulli number. It is proved that (i) If r≥1 is odd and suppose p≥r+4, thenp-1∑j=11/(np+j)=-(2n+1+(x+1)/2(x+2)Bp-r-2p2(modp3).(ii)IFr≥2is even and suppose p≥r+3,thenp-1∑j=11/(np+j)+=r/r+1Bp-x-1p(modp2).(iii)p-1∑j=11/(np+j)p-2=-(2n+1)p(modp2).Thisesult generalizes the Glaisher's congruence. As a corollary, a generalization of the Wolstenholme's theorem is obtained.     

New Lower Bounds for the Least Common Multiples of Arithmetic Progressions

Abstract For relatively prime positive integers u0 and r, and for 0 〈 k ≤ n, define uk ：= u0 ＋ kr. Let Ln ：= 1cm（u0,u1,... ,un） and let a,l≥2 be any integers. In this paper, the authors show that, for integers α≥ a, r ≥max（a,l - 1） and n ≥lατ, the following inequality holds Ln≥u0r^（l-1）α＋a-l（r＋1）^n.Particularly, letting l = 3 yields an improvement on the best previous lower bound on Ln obtained by Hong and Kominers in 2010.     

Traveling Waves and Capillarity Driven Spreading of Shear-Thinning Fluids

We study capillary spreadings of thin films of liquids of power-law rheology. These satisfy ut＋（u^λ＋2｜uxxx｜^λ-1uxxx）x=0,where u （x, t） represents the thickness of the one-dimensional liquid and λ 〉 1. We look for traveling wave solutions so that u（x,t） =g（x＋ct） and thus g satisfies g＇＇＇=｜g-ε｜^1/λ/g^1＋2/λ sgn（g-ε） We show that for each ε 〉 0 there is an infinitely oscillating solution, gε, such that limt→∞ gε=ε and that gε→ g0 as ε → O, where g0≡ 0 for t ≥ 0 and g0=cλ｜t｜3λ/2λ＋1 for t〈0 for some constant cλ.     

On the Schinzel identity ofCyclotomic Polynomial

For integer n > 0, let n.(x) denote the nth cyclotomic polynomialwhere is a primitive nib root of unity and (j, n) denotes the greatest common divisor of j andn.Although 4.(x) is irreducible over the integers, 4.(x) may be reducible over certain quadraticfield. Let n > 1 be an odd square-free number. Aurifeuille and Le Lasseur[1] proved thatLater on Schinzel[2] proved that (1) can be improved aswhere m|n,(3) denotes the Jacobi symbol, andwhere both Pn,m(x) and Qn,m(x) are polynomials with i…     

任意长圈覆盖指定的独立的点

An invariant σ2（G） of a graph is defined as follows： σ2（G） ：= min{d（u） ＋ d（v）｜u, v ∈V（G）,uv ∈ E（G）,u ≠ v} is the minimum degree sum of nonadjacent vertices （when G is a complete graph, we define σ2（G） = ∞）. Let k, s be integers with k ≥ 2 and s ≥ 4, G be a graph of order n sufficiently large compared with s and k. We show that if σ2（G） ≥ n ＋ k- 1, then for any set of k independent vertices v1,..., vk, G has k vertex-disjoint cycles C1,..., Ck such that ｜Ci｜ ≤ s and vi ∈ V（Ci） for all 1 ≤ i ≤ k.
The condition of degree sum σs（G） ≥ n ＋ k - 1 is sharp.     

New series of odd non-congruent numbers Dedicated to Professor Sheng GONG on the occasion of his 75th birthday

We determine all square-free odd positive integers n such that the 2-Selmer groups Sn and Sn of the elliptic curve En: y2 = x(x -n)(x - 2n) and its dual curve En: y2 = x3 6nx2 n2x have the smallest size: Sn = {1}, Sn = {1,2,n,2n}. It is well known that for such integer n, the rank of group En(Q) of the rational points on En is zero so that n is a non-congruent number. In this way we obtain many new series of elliptic curves En with rank zero and such series of integers n are non-congruent numbers.     

Sums of primes and quadratic linear recurrence sequences

Let u be a sequence of positive integers which grows essentially as a geometric progression. We give a criterion on u in terms of its distribution modulo d, d = 1, 2,..., under which the set of positive integers expressible by the sum of a prime number and an element of u has a positive lower density. This criterion is then checked for some second order linear recurrence sequences. It follows, for instance, that the set of positive integers of the form p ＋ [（2 ＋ √3）n], where p is a prime number and n is a positive integer, has a positive lower density. This generalizes a recent result of Enoch Lee. In passing, we show that the periods of linear recurrence sequences of order m modulo a prime number p cannot be ＂too small＂ for most prime numbers p.     

强正则自补图的一个注记

Kotzig put forward a question on strongly-regular self-complementary graphs, that is, for any natural number k, whether there exists a strongly-regular self- complementary graph whose order is 4k 1, where 4k 1=x2 y2, x and y are positive integers; what is the minimum number that made there exist at least two non-isomorphic strongly-regular self-complementary graphs. In this paper, we use two famous lemmas to generalize the existential conditions for strongly-regular self-complementary circular graphs with 4k 1 orders.     

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.     

On the generalization of the D. H. Lehmer problem

Let n ≥ 2 be a fixed positive integer, q ≥ 3 and c be two integers with （n, q） = （c, q） = 1. We denote by rn（51, 52, C; q） （δ 〈 δ1,δ2≤ 1） the number of all pairs of integers a, b satisfying ab ≡ c（mod q）, 1 〈 a ≤δ1q, 1 ≤ b≤δ2q, （a,q） = （b,q） = 1 and nt（a＋b）. The main purpose of this paper is to study the asymptotic properties of rn （δ1, δ2, c; q）, and give a sharp asymptotic formula for it.     

The Rainbow Vertex-disconnection in Graphs

Let G be a nontrivial connected and vertex-colored graph. A subset X of the vertex set of G is called rainbow if any two vertices in X have distinct colors. The graph G is called rainbow vertex-disconnected if for any two vertices x and y of G, there exists a vertex subset S of G such that when x and y are nonadjacent, S is rainbow and x and y belong to different components of G-S; whereas when x and y are adjacent, S + x or S + y is rainbow and x and y belong to different components of(G-xy)-S. For a connected graph G, the rainbow vertex-disconnection number of G, denoted by rvd(G), is the minimum number of colors that are needed to make G rainbow vertexdisconnected. In this paper, we characterize all graphs of order n with rainbow vertex-disconnection number k for k ∈ {1, 2, n}, and determine the rainbow vertex-disconnection numbers of some special graphs. Moreover, we study the extremal problems on the number of edges of a connected graph G with order n and rvd(G) = k for given integers k and n with 1 ≤ k ≤ n.     

Liouvillian and analytic integrability of the quadratic vector fields having an invariant ellipse

We characterize the Liouvillian and analytic integrability of the quadratic polynomial vector fields in R2 having an invariant ellipse.More precisely,a quadratic system having an invariant ellipse can be written into the form x=x2＋y2-1＋y（ax＋by＋c）,y=x（ax＋by＋c）,and the ellipse becomes x2＋y2=1.We prove that（i） this quadratic system is analytic integrable if and only if a=0;（ii） if x2＋y2=1 is a periodic orbit,then this quadratic system is Liouvillian integrable if and only if x2＋y2=1 is not a limit cycle;and（iii） if x2＋y2=1 is not a periodic orbit,then this quadratic system is Liouvilian integrable if and only if a=0.