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

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 Exceptional Set in the Two Prime Squares and a Prime Problem

In this paper we prove that, with at most O（N^5/12＋ε） exceptions, all positive odd integers n ≤ N with n ≡ 0 or 1（mod 3） can be written as a sum of a prime and two squares of primes.     

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

Some Results Connected with the Class Number Problem in Real Quadratic Fields

We investigate arithmetic properties of certain subsets of square-free positive integers and obtain in this way some results concerning the class number h（d） of the real quadratic field Q（√d）. In particular, we give a new proof of the result of Hasse, asserting that in this case h（d） = 1 is possible only if d is of the form p, 2q or qr. where p.q. r are primes and q≡r≡3（mod 4）.     

On a variant of Giuga numbers

In this paper, we characterize the odd positive integers n satisfying the congruence∑n -1 j=1 j n-1/2 ≡ 0 (mod n). We show that the set of such positive integers has an asymptotic density which turns out to be slightly larger than 3/8.     

2类6点7边图的$\lambda$-填充与$\lambda$-覆盖

A maximum （v, G, λ）-PD and a minimum （v, G, λ）-CD axe studied for 2 graphs of 6 vertices and 7 edges. By means of ＂difference method＂ and ＂holey graph design＂, we obtain the result： there exists a （v, Gi, λ）-OPD （OCD） for v ≡ 2, 3, 4, 5, 6 （mod 7）, λ ≥ 1, i = 1, 2.     

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.     

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.     

关于数论函数$\sigma(n)$的一个注记

对于两个不相同的正整数$m$和$n$, 如果满足$\sigma(m)=\sigma(n)=m+n$, 则称之为一对亲和数, 这里$\sigma(n)=\sum_{d|n}d$.本文给出了$f(x,y)=x^{2^{x}}+y^{2^{x}}(x>y\geq{1},(x,y)=1)$不与任何正整数构成亲和数对的结论, 这里$x$,$y$具有不同的奇偶性, 即, 关于$z$的方程$\sigma(f(x,y))=\sigma(z)=f(x,y)+z$不存在正整数解.     

置换多项式$x^{1+\frac{q-1}{m}}+ax$

设$m$为正整数, $F_{q^r}$是特征为$p$的有限域. 本文证明了如果$p>m^2-m$且$q\equiv 1\pmod{m}$, 则多项式$x^{1+\frac{q-1}{m}}+ax~(a\neq0)$不是$F_{q^r}~(r\geq2)$上的置换多项式. 本文还证明了$q\equiv 1\pmod{7}$且$p\neq 2, 3$时, $x^{1+\frac{q-1}{7}}+ax~(a\neq0)$不是$F_{q^r}~(r\geq2)$上的置换多项式     

An application of Baker’s method to the Jeśmanowicz’ conjecture on primitive Pythagorean triples

Periodica Mathematica Hungarica - Let m, n be positive integers such that $$m>n$$, $$\gcd (m,n)=1$$ and $$m \not \equiv n \pmod {2}$$. In 1956, L. Je?manowicz conjectured that...     

A note on the exceptional solutions of Jeśmanowicz’ conjecture concerning primitive Pythagorean triples

Periodica Mathematica Hungarica - Let $$(m,\ n)$$ be fixed positive integers such that $$m>n,\ \gcd (m,\ n)=1$$ and $$ mn\equiv 0 \pmod 2$$ . Then the triple $$(m^2-n^2,\ 2mn,\ m^2+n^2)$$ is...     

THE GOLDBACH-VINOGRDOV THEOREM WITH THREE PRIMES IN A THIN SUBSET

1.IntroductionandStatementofResultsIn1937,Vinogradovi7]provedthatJ(N),thenumberofrepresefltationsofanilltegerNassumsofthreeprimes,satisfiesthefollowingasymptoticformulawherea(N)isthesingularseries,andu(N)>>1foroddN.Itthereforefollowsthateverysufficientlylargeoddintegeristhesumofthreeprimes.ThissettledtheternaryGoldbachproblem,andtheresultisreferredtoastheGoldbach-Vinogradovtheorein.ManyauthorshaveconsideredthecorrespondingproblemswithrestrictedconditionsposedonthethreeprimesintheGoldbach…     

关于模$p^{\alpha}$的单位与非单位的立方和

设奇素数$p\equiv 2~({\rm mod}\,3)$, $\alpha$是正整数. 对于任意整数$c$, 本文研究了$x, y$分别是单位,非单位,以及两者混合时,三次同余方程$x^{3}+y^{3}\equiv c~({\rm mod}\, p^{\alpha})$解的个数公式. 我们解决了杨全会和汤敏提出的一个问题.     

LIE ALGEBRA K$(n,\mu _j,m)$ OF CARTAN TYPE OF CHARACTERISTIC p=2

Let $K(n,\mu _j,m),n=2r+1$,denote the Lie algebra of characteristic p=2,which is defined in [4].In the paper the restrictability of $K(n,\mu _j,m)$ is discussed and it is proved that,when $r\equiv 1(mod 2)$ and $r>1,I(ad f)=n+1$ if and only if $0\neq f \in $. Then the invariance of some filtrations of K(n,\mu,m) and the condition of isomorphism of K(n,\mu _i,m) and K(n',\mu _j ^',m') are obtained.Besides,the generators and the derivation algebra of K(n,\mu _i,m) are discussed.The results also hold,when $r\equiv 0 (mod 2)$ and r>0.     

Unit groups of some multiquadratic number fields and 2-class groups

Periodica Mathematica Hungarica - Let $$p\equiv -q \equiv 5\pmod 8$$ be two prime integers. In this paper, we investigate the unit groups of the fields $$ L_1 =\mathbb {Q}(\sqrt{2}, \sqrt{p},...     

On the family of elliptic curves $$\varvec{y^2=x^3-m^2x+p^2}$$

In this paper, we study the torsion subgroup and rank of elliptic curves for the subfamilies of \(E_{m,p} : y^2=x^3-m^2x+p^2\), where m is a positive integer and p is a prime. We prove that for any prime p, the torsion subgroup of \(E_{m,p}(\mathbb {Q})\) is trivial for both the cases {\(m\ge 1\), \(m\not \equiv 0\pmod 3\)} and {\(m\ge 1\), \(m \equiv 0 \pmod 3\), with \(gcd(m,p)=1\)}. We also show that given any odd prime p and for any positive integer m with \(m\not \equiv 0\pmod 3\) and \(m\equiv 2\pmod {32}\), the lower bound for the rank of \(E_{m,p}(\mathbb {Q})\) is 2. Finally, we find curves of rank 9 in this family.     

Sharpening ``Primes is in P' for a large family of numbers

We present algorithms that are deterministic primality tests for a large family of integers, namely, integers for which an integer is given such that the Jacobi symbol , and integers for which an integer is given such that . The algorithms we present run in time, where is the exact power of dividing when and if . The complexity of our algorithms improves up to when . We also give tests for a more general family of numbers and study their complexity.