Small Modular Solutions to Fermat’s Last Theorem

The proof by Andrew Wiles of Fermat’s Last Theorem in 1995 resolved the existence question for non-trivial solutions in integers x,y,zto the equation xn+yn=znfor n>2. There are none. Surprisingly, there are infinitely many solutions if the problem is recast in terms of modular arithmetic. Over a hundred years ago Issai Schur was able to show that for any n there is always a sufficiently large prime p0such that for all primes p≥p0the congruence xn+yn≡zn(modp)has a non-trivial solution. Schur’s argument wasnon-constructive, and there is no systematic method available at present to construct specific examples for small primes. We offer a simple method for constructing all possible solutions to a large class of congruences of this type.

On the Formation of Abstract Prime Number Theorem

In this paper we prove a zero-free region for L-functions LG（z,Х）. As an application, an abstract prime number theorem with sharp error-term for formations is established.

On the Prime Geodesic Theorem for Non-Compact Riemann Surfaces

We use B. Randol’s method to improve the error term in the prime geodesic theorem for a noncompact Riemann surface having at least one cusp. The case considered is a general one, corresponding to a Fuchsian group of the first kind and a multiplier system with a weight on it.

On Prime Numbers between kn and (k + 1) n

In this paper along with the previous studies on analyzing the binomial coefficients, we will complete the proof of a theorem. The theorem states that for two positive integers n and k, when n ≥ k - 1, there always exists at least a prime number p such that kn p ≤ (k +1)n. The Bertrand-Chebyshev’s theorem is a special case of this theorem when k = 1. In the field of prime number distribution, just as the prime number theorem provides the approximate number of prime numbers relative to natural numbers, while the new theory indicates that prime numbers exist in the specific intervals between natural numbers, that is, the new theorem provides the approximate positions of prime numbers among natural numbers.

基于中国剩余定理的NFC安全认证算法

针对近场通信技术在应用中出现的安全隐患问题,给出一种基于中国剩余定理的算法。算法利用中国剩余定理实现对传送信息进行加密,中国剩余定理基于数学中大素数分解难题,使得攻击者无法进行破解;所有信息加密过程中混入随机数,用于保证消息的新鲜性;算法在进行信息更新时采用伪随机函数计算,因伪随机函数具备的单向性,使得攻击者无法分析出有用隐私信息。将不同算法对比安全分析,表明该算法能够抵抗重放攻击、异步攻击等多种攻击。通过性能角度及仿真实验对多个算法进行分析,结果表明该算法计算时间复杂度低于其他算法。

The Numbers of Thousand Place of Mersenne Primes

Mersenne primes are a special kind of primes, which are an important content in number theory. The study of Mersenne primes becomes one of hot topics of the nowadays science. Searching for Mersenne primes is very challenging in scientific researches. In this paper, the numbers of thousand place of Mersenne primes are studied, and the conclusion is presented by using the Chinese remainder theorem.

Very Original Proofs of Two Famous Problems: “Are There Any Odd Perfect Numbers?” (Unsolved until to Date) and “Fermat’s Last Theorem: A New Proof of Theorem (Less than One and a Half Pages) and Its Generalization”

This article presents very original and relatively brief or very brief proofs about of two famous problems: 1) Are there any odd perfect numbers? and 2) “Fermat’s last theorem: A new proof of theorem and its generalization”. They are achieved with elementary mathematics. This is why these proofs can be easily understood by any mathematician or anyone who knows basic mathematics. Note that, in both problems, proof by contradiction was used as a method of proof. The first of the two problems to date has not been resolved. Its proof is completely original and was not based on the work of other researchers. On the contrary, it was based on a simple observation that all natural divisors of a positive integer appear in pairs. The aim of the first work is to solve one of the unsolved, for many years, problems of the mathematics which belong to the field of number theory. I believe that if the present proof is recognized by the mathematical community, it may signal a different way of solving unsolved problems. For the second problem, it is very important the fact that it is generalized to an arbitrarily large number of variables. This generalization is essentially a new theorem in the field of the number theory. To the classical problem, two solutions are given, which are presented in the chronological order in which they were achieved. Note that the second solution is very short and does not exceed one and a half pages. This leads me to believe that Fermat, as a great mathematician was not lying and that he had probably solved the problem, as he stated in his historic its letter, with a correspondingly brief solution. To win the bet on the question of whether Fermat was telling truth or lying, go immediately to the end of this article before the General Conclusions.

Twin Prime Distribution Problem

The distribution of twin prime numbers is discussed. The research method of corresponding prime number distribution is proposed. The distribution of prime numbers corresponding to integers and composite numbers is discussed. Through the corresponding prime distribution rate of integers and composite numbers, it is found that the corresponding prime distribution rate of composite numbers approaches the corresponding prime distribution rate of integers. The distribution principle of corresponding prime number of composite number is proved. The twin prime distribution theorem is obtained. The number of twin prime numbers is thus obtained. It provides a practical way to study the conjecture of twin prime numbers.

THE PROOF OF FERMAT'S LAST THEOREM

i) Instead of x￣n+ y￣n = z￣n ,we use as the general equation of Fermat's Last Theorem (FLT),where a and b are two arbitrary natural numbers .By means of binomial expansion ,(0.1) an be written as Because a￣r-(-b)￣r always contains a +b as its factor ,(0.2) can be written as where φ_r =[a￣r-(-b)￣r]/ (a+b ) are integers for r=1 . 2, 3. ...n (ii) Lets be a factor of a+b and let (a +b) = se. We can use x= sy to transform (0.3 ) to the following (0.4)(iii ) Dividing (0.4) by s￣2 we have On the left side of (0.5) there is a polynomial of y with integer coefficient and on the right side there is a constant cφ/s .If cφ/s is not an integer ,then we cannot find an integer y to satisfy (0.5), and then FLT is true for this case. If cφ_n/s is an integer ,we may change a and c such the cφ_n/s≠an integer .

A COMMENT ON THE PROOF OF FERMAT'S LAST THEOREM

In this paper, some conmments on the proof of Fermat’s last theorem are proposed.The main resuilt is thai the proof proposed by Wong Chiahe is only part of proof for fermat’s last theorem. That is to sqy ,the proof is not all-full proof to Fermat’s last theorem.

Bombieri's Theorem in Short Intervals

Under the assumption of sixth power large.sieve mean-value of Dirichlet L-function, we improve Bombieri＇s theorem in short intervals by virtue of the large sieve method and Heath-Brown＇s identity.

Development of New Method for Generating Prime Numbers

The article is devoted to actual problems of prime numbers. A theorem that allows generating a sequence of prime numbers is proposed. An algorithm for generating prime numbers has been developed. A comparison of the proposed theorem, with Wilson’s theorem is also provided.

A Brief New Proof to Fermat’s Last Theorem and Its Generalization

This article presents a brief and new solution to the problem known as the “Fermat’s Last Theorem”. It is achieved without the use of abstract algebra elements or elements from other fields of modern mathematics of the twentieth century. For this reason it can be easily understood by any mathematician or by anyone who knows basic mathematics. The important thing is that the above “theorem” is generalized. Thus, this generalization is essentially a new theorem in the field of number theory.

How to Check If a Number Is Prime Using a Finite Definite Integral

In the history of mathematics different methods have been used to detect if a number is prime or not. In this paper a new one will be shown. It will be demonstrated that if the following equation is zero for a certain number p, this number p would be prime. And being m an integer number higher than (the lowest, the most efficient the operation). . If the result is an integer, this result will tell us how many permutations of two divisors, the input number has. As you can check, no recurrent division by odd or prime numbers is done, to check if the number is prime or has divisors. To get to this point, we will do the following. First, we will create a domain with all the composite numbers. This is easy, as you can just multiply one by one all the integers (greater or equal than 2) in that domain. So, you will get all the composite numbers (not getting any prime) in that domain. Then, we will use the Fourier transform to change from this original domain (called discrete time domain in this regards) to the frequency domain. There, we can check, using Parseval’s theorem, if a certain number is there or not. The use of Parseval’s theorem leads to the above integral. If the number p that we want to check is not in the domain, the result of the integral is zero and the number is a prime. If instead, the result is an integer, this integer will tell us how many permutations of two divisors the number p has. And, in consequence information how many factors, the number p has. So, for any number p lower than 2m?- 1, you can check if it is prime or not, just making the numerical definite integration. We will apply this integral in a computer program to check the efficiency of the operation. We will check, if no further developments are done, the numerical integration is inefficient computing-wise compared with brute-force checking. To be added, is the question regarding the level of accuracy needed (number of decimals and number of steps in the numerical integration) to have a reliable result for large numbers. This will be commented on the paper, but a separate study will be needed to have detailed conclusions. Of course, the best would be that in the future, an analytical result (or at least an approximation) for the summation or for the integration is achieved.

One More Assertion to Fermat’s Last Theorem

Around 1637, Fermat wrote his Last Theorem in the margin of his copy “It is impossible to separate a cube into two cubes, or a fourth power into two fourth powers, or in general, any power higher than the second, into two like powers”. With n, x, y, z ∈ N (meaning that n, x, y, z are all positive numbers) and n > 2, the equation xn + yn = zn has no solutions. In this paper, I try to prove Fermat’s statement by reverse order, which means no two cubes forms cube, no two fourth power forms a fourth power, or in general no two like powers forms a single like power greater than the two. I used roots, powers and radicals to assert Fermat’s last theorem. Also I tried to generalize Fermat’s conjecture for negative integers, with the help of radical equivalents of Pythagorean triplets and Euler’s disproven conjecture.

k-素数和唯一分解

在本文中,作者揭示了唯一k-素因数分解的更深层原因.在第二节中,首先引入Sk中的k-组合条件和费马定理;并证明了下面4论断是等价的:(1)k-组合条件成立,(2)中唯一k-素因数分解成立,(3)S_(k)中费马定理成立,(4)k=1或2.为了更好地理解k-素数,在第三节中作者考察了一类特殊的k-素数,即3-素数.众所周知唯一3-素因数分解一般是不成立的,那么S_(3)中的哪些正整数具有唯一3-素因数分解性质呢?在第三节中,作者得到一个S_(3)中的整数具有唯一3-素因数分解的充要条件.在第三节最后,作者引入π_(3)(x),它表示小于等于x的3-素数个数.由素数定理,作者得到π_(3)(x)的一个具体公式以及一些近似公式.

Wielandt定理与非幂零极大子群指数皆为素数的有限群

为了进一步研究每个非幂零极大子群的指数皆为素数的有限群的可解性,使用反证法和极小阶反例的方法,并结合应用Wielandt给出的一个关于具有幂零Hall-子群(不是Sylow-子群)的有限群G的结构刻画的定理,得到了一个较为初等的关于每个非幂零极大子群的指数皆为素数的有限群G的可解性的证明。该证明没有应用Glauberman-Thompson p-幂零准则和Rose的关于具有幂零极大子群的非交换单群的分类和关于具有幂零极大子群且中心等于1的非可解群的刻画,这改进了之前在相关的研究文献中关于这个结论的证明。

一种快速生成大素数的方法

基于中国剩余定理对改进的增量素数生成算法进行了改进,设计了基于中国剩余定理的门限素数生成算法(TCPG),以提高大素数生成的效率。具体地说,TCPG算法用中国剩余定理对小素数数组进行随机抽样,然后求解同余方程;在素性测试失败后,不需要对整个小素数数组重新抽样,而是仅抽样门限个随机数,降低了随机数的抽样个数,从而提高素数生成算法效率。最后,对TCPG算法与原生素数生成算法、增量素数生成算法、改进的增量算法、M-J特例算法、改进的M-J算法和中国剩余定理素数生成算法(简称CRT)进行素数生成平均时长的对比分析实验。实验结果表明TCPG算法生成长度为512 bit的素数的平均时长(7.80 ms)略多于改进的增量算法所需时长(7.73 ms),但是,生成长度为1024 bit和2048 bit的素数的平均时长最短:TCPG算法在Miller-Rabin素性测试算法下生成1个长度为512 bit的素数的平均时长为7.80 ms,比CRT算法耗时减少1.46 ms;生成1个长度为1024 bit的素数的平均时长为53.30 ms,比改进的增量素数生成算法、CRT算法耗时分别减少5.50、4.30 ms;生成1个长度为2048 bit的素数的平均时长为505.78 ms,比改进的增量素数生成算法、CRT算法耗时分别减少106.03、54.54 ms。

形如4k-1、4k+1、6k-1和6k+1(k∈Z^(+))的素数都有无穷多个

基于严格的逻辑推理,证明了“形如4k-1(k∈Z^(+))的素数有无穷多个”和“形如6k-1(k∈Z^(+))的素数有无穷多个”。基于平方剩余和Euler判定法则,证明了“形如4k+1(k∈Z^(+))的素数有无穷多个”。基于阶和Euler定理,证明了“形如6k+1(k∈Z^(+))的素数有无穷多个”。

四素数RSA数字签名算法的研究与实现

RSA算法中模数和运算效率之间一直存在矛盾,目前一些认证机构已采用模数为2048 bit的RSA签名方法,这必然会影响签名效率。针对这一问题,提出四素数CRT-RSA签名算法,并使用安全杂凑函数SHA512来生成消息摘要,采用中国剩余定理结合Montgomery模乘来优化大数的模幂运算。通过安全性分析和仿真实验表明,该签名算法能抵抗一些常见攻击,并且在签名效率方面具有一定优势。