b≤2000,m≤10的广义Fermat素数

设b为偶数，本文基于作者的原有结果，进一步改进了算法，对于b≤2000,m≤10给出了所有广义Fermat素数F(b,m)=b^2m 1，其中最大的是1632^1024 1,有3290位。     

b≤200O,m≤1 O的广义Fermat素数

设b为偶数,本文基于作者的原有结果,进一步改进了算法,对于b≤2000,m≤10给出了所有广义Fermat素数F(b,m)＝b2m+1,其中最大的是16321024+1,有3290位.     

关于形如（2^p＋1）／3的素数

设ｐ为奇素数,本文讨论（２＾ｐ＋１）／３的基本性质,并对ｐ〈６０００给出了素数和概率数。     

初等数论教学中的辩证法——关于素性检验和正整数的素因数分解的一次课程设计

本文就两类特殊的数——梅森数和费马数,将广泛应用于素性检验和正整数的素因数分解中的试除法和两类数的自身特点相结合,便有了这两类数的素性检验和素因数分解的更有效的方法,体现了一般和特殊的关系,是辩证法在数论中的体现.     

关于Fermat素数与L-函数的加权均值

本文研究了一类以Fermat素数为模的Dirichlet L-函数加权均值的计算问题.利用初等方法以及Dirichlet和的性质,获得了一个有趣的计算公式.     

强伪素数、覆盖同余式组以及广义bent函数

本文考虑三个问题:强伪素数的计算、覆盖同余式组和广义bent函数.本文的创新点包括:(1)编程证明3 825 123 056 546 413 051是通过前9个素数为基的Miller-Rabin测试的最小合数;(2)证明Kim的猜想,即任意代数数域上的恰好覆盖同余式组必有模理想重复出现;(3)证明两类广义bent函数不存在.     

广义Piatetski-Shapiro序列中的殆素数（英文）

设α≥1,c≥1和β是实数,本文考虑的是在Beatty序列意义下形式为((?)αn^c+β」)_n=1^∞的Piatetski-Shapiro序列.对于每一个R≥1,如果一个自然数至多有R个素因子,则定义它为R-殆素数.已知当c∈(1,c_R)且c_R是依赖于R的显式常数时,序列((?)αn^c+β」)_n=1^∞中存在无穷多个殆素数.本文通过优化指数对的选择提高了已知的c_R的上界.     

关于Fermat素数与L-函数的加权均值

本文研究了一类以Fermat素数为模的Dirichlet L-函数加权均值的计算问题. 利用初等方法以及Dirichlet 和的性质, 获得了一个有趣的计算公式.     

形如2kp+1的数的素性检验

本文初步探讨了如何快速检验一个大数n是素数(这里n-1含有大的素因子)的算法问题以及如何生成一个大素数p使得p-1有大的素因子q的算法问题.我们给出了形如n=2kp+1的数的素性检验的多项式时间算法,这里p是一个给定的大素数,k是正整数满足22k＜2kp.该算法的计算量为O(log32n).然后我们给出了生成一个大素数p使得p-1有大的素因子q的算法,其中q满足q＞(p-1)/log2(p-1).特别地,我们给出了判定并生成一个安全素数p的算法.     

关于d元广义双素数Sidelnikov序列的伪随机性质

设p与q是两个不同的奇素数,d是p-1和q-1的最大公因数.本文基于乘法特征构造了d元双素数Sidelnikov序列,并利用特征和的性质研究了自相关值与线性复杂度.     

Distribution of generalized Fermat prime numbers

Numbers of the form are called Generalized Fermat Numbers (GFN). A computational method for testing the probable primality of a GFN is described which is as fast as testing a number of the form . The theoretical distributions of GFN primes, for fixed , are derived and compared to the actual distributions. The predictions are surprisingly accurate and can be used to support Bateman and Horn's quantitative form of ``Hypothesis H" of Schinzel and Sierpinski. A list of the current largest known GFN primes is included.

     

Fermat场址问题的信赖域算法

1 问题及预备引理 设R~n是n维欧氏空间，a_i∈R~n,i=1,2,…，t是t个不共线的点，w_i>0,i=1,2,…,t,┃·┃表欧氏范数，著名的Fermat场址问题是     

Table errata to ``Factors of generalized Fermat numbers'

We note that three factors are missing from Table 1 in Factors of generalized Fermat numbers by A. Björn and H. Riesel published in Math. Comp. 67 (1998), 441-446.

     

Factors of generalized Fermat numbers

A search for prime factors of the generalized Fermat numbers has been carried out for all pairs with and GCD. The search limit on the factors, which all have the form , was for and for . Many larger primes of this form have also been tried as factors of . Several thousand new factors were found, which are given in our tables.-For the smaller of the numbers, i.e. for , or, if , for , the cofactors, after removal of the factors found, were subjected to primality tests, and if composite with , searched for larger factors by using the ECM, and in some cases the MPQS, PPMPQS, or SNFS. As a result all numbers with are now completely factored.

     

On the primality of

For each prime , let be the product of the primes less than or equal to . We have greatly extended the range for which the primality of and are known and have found two new primes of the first form ( ) and one of the second (). We supply heuristic estimates on the expected number of such primes and compare these estimates to the number actually found.

     

On a Connection of Number Theory with Graph Theory

We assign to each positive integer n a digraph whose set of vertices is H = {0, 1, ..., n – 1} and for which there is a directed edge from a H to b H if a ² b (mod n). We establish necessary and sufficient conditions for the existence of isolated fixed points. We also examine when the digraph is semiregular. Moreover, we present simple conditions for the number of components and length of cycles. Two new necessary and sufficient conditions for the compositeness of Fermat numbers are also introduced.     

On the Convergence of Series of Reciprocals of Primes Related to the Fermat Numbers

We examine densities of several sets connected with the Fermat numbers F_m=2^2m+1. In particular, we prove that the series of reciprocals of all prime divisors of Fermat numbers is convergent. We also show that the series of reciprocals of elite primes is convergent.