We determined the linear complexity of a family of p2-periodic binary threshold sequences and a family of p2-periodic binary sequences constructed using the Legendre symbol,both of which are derived from Fermat quotie...We determined the linear complexity of a family of p2-periodic binary threshold sequences and a family of p2-periodic binary sequences constructed using the Legendre symbol,both of which are derived from Fermat quotients modulo an odd prime p.If 2 is a primitive element modulo p2,the linear complexity equals to p2-p or p2-1,which is very close to the period and it is large enough for cryptographic purpose.展开更多
We analyse the Diophantine equation of Fermat xp yp = zp with p > 2 a prime, x, y, z positive nonzero integers. We consider the hypothetical solution (a, b, c) of previous equation. We use Fermat main divisors, Dio...We analyse the Diophantine equation of Fermat xp yp = zp with p > 2 a prime, x, y, z positive nonzero integers. We consider the hypothetical solution (a, b, c) of previous equation. We use Fermat main divisors, Diophantine remainders of (a, b, c), an asymptotic approach based on Balzano Weierstrass Analysis Theorem as tools. We construct convergent infinite sequences and establish asymptotic results including the following surprising one. If z y = 1 then there exists a tight bound N such that, for all prime exponents p > N , we have xp yp zp.展开更多
0 The Diophantine equation X^(2p)-Dy^2=1Let D be a positive integer which is square free,and p be a prime.In 1966,Ljunggren showed that if p=2 and D=q is a prime,then the Diophantine equationx^(2p)-Dy^2=1(1)has only p...0 The Diophantine equation X^(2p)-Dy^2=1Let D be a positive integer which is square free,and p be a prime.In 1966,Ljunggren showed that if p=2 and D=q is a prime,then the Diophantine equationx^(2p)-Dy^2=1(1)has only positive integer solutions(q,x,y)=(5,3,4),(29,99,1820).In 1979,KoChao and Sun Qi showed that if p=2 and D=2q,then Eq.(1)has no positive inte-展开更多
We generalize the congruences of Friedmann-Tamarkine (1909), Lehmer (1938), and Ernvall-Metsänkyla (1991) on the sums of powers of integers weighted by powers of the Fermat quotients to the next Fermat quotient p...We generalize the congruences of Friedmann-Tamarkine (1909), Lehmer (1938), and Ernvall-Metsänkyla (1991) on the sums of powers of integers weighted by powers of the Fermat quotients to the next Fermat quotient power, namely to the third power of the Fermat quotient. Using this result and the Gessel identity (2005) combined with our past work (2021), we are able to relate residues of some truncated convolutions of Bernoulli numbers with some Ernvall-Metsänkyla residues to residues of some full convolutions of the same kind. We also establish some congruences concerning other related weighted sums of powers of integers when these sums are weighted by some analogs of the Teichmüller characters.展开更多
In this paper,the author partly proves a supercongruence conjectured by Z.-W.Sun in 2013.Let p be an odd prime and let a∈Z^(+).Then,if p≡1(mod 3),[5/6p^(a)]∑k=0(2kk)/16^(k)≡(3/p^(a))(mod p^(2))is obtained,where(■...In this paper,the author partly proves a supercongruence conjectured by Z.-W.Sun in 2013.Let p be an odd prime and let a∈Z^(+).Then,if p≡1(mod 3),[5/6p^(a)]∑k=0(2kk)/16^(k)≡(3/p^(a))(mod p^(2))is obtained,where(■)is the Jacobi symbol.展开更多
基金the National Natural Science Foundation of China，the Open Funds of State Key Laboratory of Information Security (Chinese Academy of Sciences)，the Program for New Century Excellent Talents in Fujian Province University
文摘We determined the linear complexity of a family of p2-periodic binary threshold sequences and a family of p2-periodic binary sequences constructed using the Legendre symbol,both of which are derived from Fermat quotients modulo an odd prime p.If 2 is a primitive element modulo p2,the linear complexity equals to p2-p or p2-1,which is very close to the period and it is large enough for cryptographic purpose.
文摘We analyse the Diophantine equation of Fermat xp yp = zp with p > 2 a prime, x, y, z positive nonzero integers. We consider the hypothetical solution (a, b, c) of previous equation. We use Fermat main divisors, Diophantine remainders of (a, b, c), an asymptotic approach based on Balzano Weierstrass Analysis Theorem as tools. We construct convergent infinite sequences and establish asymptotic results including the following surprising one. If z y = 1 then there exists a tight bound N such that, for all prime exponents p > N , we have xp yp zp.
文摘0 The Diophantine equation X^(2p)-Dy^2=1Let D be a positive integer which is square free,and p be a prime.In 1966,Ljunggren showed that if p=2 and D=q is a prime,then the Diophantine equationx^(2p)-Dy^2=1(1)has only positive integer solutions(q,x,y)=(5,3,4),(29,99,1820).In 1979,KoChao and Sun Qi showed that if p=2 and D=2q,then Eq.(1)has no positive inte-
文摘We generalize the congruences of Friedmann-Tamarkine (1909), Lehmer (1938), and Ernvall-Metsänkyla (1991) on the sums of powers of integers weighted by powers of the Fermat quotients to the next Fermat quotient power, namely to the third power of the Fermat quotient. Using this result and the Gessel identity (2005) combined with our past work (2021), we are able to relate residues of some truncated convolutions of Bernoulli numbers with some Ernvall-Metsänkyla residues to residues of some full convolutions of the same kind. We also establish some congruences concerning other related weighted sums of powers of integers when these sums are weighted by some analogs of the Teichmüller characters.
基金supported by the National Natural Science Foundation of China(Nos.12001288,12071208)
文摘In this paper,the author partly proves a supercongruence conjectured by Z.-W.Sun in 2013.Let p be an odd prime and let a∈Z^(+).Then,if p≡1(mod 3),[5/6p^(a)]∑k=0(2kk)/16^(k)≡(3/p^(a))(mod p^(2))is obtained,where(■)is the Jacobi symbol.
