广义四次Gauss和的四次均值

本文利用解析方法以及经典Gauss和的性质,研究了模p为奇素数时广义四次Gauss和的四次均值的计算问题,并根据p≡3或1 mod 4,得到了该四次均值的一个精确计算公式和渐近公式.     

关于Euler数一个猜想的证明

研究Euler数的猜想:对于任何素数p≡1 mod4,E(p-1)／20 mod p．根据Euler数本身的性质和Fourier级数对于Gauss和的应用,证明了这个猜想是成立的．     

On the Dedekind Sums and Two-Term Exponential Sums

In this paper, the authors use the analytic methods and the properties of character sums mod p to study the computational problem of one kind of mean value involving the classical Dedekind sums and two-term exponential sums, and give an exact computational formula for it.     

The Fourth Power Mean of the General 2-Dimensional Kloostermann Sums Mod p

The main purpose of this paper is using the analytic methods and the properties of Gauss sums to study the computational problem of one kind fourth power mean of the general 2-dimensional Kloostermann sums mod p, and give an exact computational formula for it.     

两个不同Gauss和的混合均值

本文利用解析方法以及三角和的性质研究两个不同Gauss和的混合均值的计算问题,并给出一个精确的计算公式.作为我们结果的应用,得到了关于模p的一类对角同余方程解的个数的计算公式,其中p是一个奇素数.     

一些同余问题的例外集合

利用特征和与指数和的估计,研究了一些同余问题的例外集合.具体来说,设p为充分大的素数,集合Y■Zp,正整数N相似文献   

Congruences with intervals and arbitrary sets

Given a prime p, an integer $$H\in [1,p)$$, and an arbitrary set $${\mathcal {M}} \subseteq {\mathbb {F}} _p^*$$, where $${\mathbb {F}} _p$$ is the finite field with p elements, let $$J(H,{\mathcal {M}} )$$ denote the number of solutions to the congruence $$\begin{aligned} xm\equiv yn~\mathrm{mod}~ p \end{aligned}$$for which $$x,y\in [1,H]$$ and $$m,n\in {\mathcal {M}} $$. In this paper, we bound $$J(H,{\mathcal {M}} )$$ in terms of p, H, and the cardinality of $${\mathcal {M}} $$. In a wide range of parameters, this bound is optimal. We give two applications of this bound: to new estimates of trilinear character sums and to bilinear sums with Kloosterman sums, complementing some recent results of Kowalski et al. (Stratification and averaging for exponential sums: bilinear forms with generalized Kloosterman sums, 2018, arXiv:1802.09849).     

A note on the Dirichlet characters of polynomials

The main purpose of this paper is using the analytic methods and the properties of character sums to study the computational problem of several kind character sums of polynomials mod q, an odd square-full number, and give two interesting identities for them.     

The fourth power mean of the general 2-dimensional Kloostermann sums mod <Emphasis Type="Italic">p</Emphasis>

The main purpose of this paper is using the analytic methods and the properties of Gauss sums to study the computational problem of one kind fourth power mean of the general 2-dimensional Kloostermann sums mod p, and give an exact computational formula for it.     

二项式系数和序列的同余性质

利用同余理论研究了二项式系数和序列an（r,s）和bn（ε,a,b,c）分别在模p^2和模p^3下的同余性质,这将为研究它们的多项式递推公式提供有利的工具.     

On the fourth power mean of the generalized quadratic Gauss sums

The main purpose of this paper is to use elementary methods and properties of the classical Gauss sums to study the computational problem of one kind of fourth power mean of the generalized quadratic Gauss sums mod q (a positive odd number), and give an exact computational formula for it.     

关于华的一个结果的注记

本文证明除了至多N20/21 ε个例外整数外,所有满足必要条件n=1 or 3(mod 6)的正整数n≤N均可表为两个素数的平方与一个素数的三次方的和．     

Hua’s theorem on five squares of primes

We give an alternative proof of Hua’s theorem that each large N≡5 (mod 24) can be written as a sum of five squares of primes. The proof depends on an estimate of exponential sums involving the Möbius function.     

Large character sums

We make conjectures and give estimates for how large character sums can be as we vary over all characters mod , and as we vary over real, quadratic characters. In particular we show that the largest sums seem to depend on the value of the character at ``smooth numbers'.

     

椭圆曲线y2=2px(x2+1)上正整数点的个数

设p是奇素数,N(p)是椭圆曲线E:y2=2px(x2+1)的正整数点(x,y)的个数.主要讨论了N(p)的性质,运用初等方法及四次Diophantine方程的性质,对某些特殊素数p,给出了N(p)的上界.证明了当p≡1(mod 8)且p=s2+32t,其中s,t是正整数时,N(p)≤3;当p≡1(mod 8)且p+s...     

单模数多变量二次同余方程组的求解及其在信息安全中的应用

根据二次同余理论,利用当P=5mod8,n^（p-1）/4=±1modp时,方程X^2=nmodP的解有具体表达式这一事实,设计了基于多变量二次同余方程组实现的密码体系。数值算例证明,该类密码体系是可行的,体系信息冗余且是一次一密的,要依赖于解密策略的交互确认,所以该类密码体系是安全的。     

THE STRUCTURES OF GROUPS OF ORDER 2~3P~2

In this paper,the following theorem is proved:Let p be a prime distinet from 3 and 7,then the groups of order 2~3 p~2 have1)60 types when p=1(mod 8),2)52 types when p=5(mod 8),3)42 types when p=3,7(mod 8).     

A central limit theorem for random sums of random variables

Anscombe (1952) (also see Chung (1974)) has developed a central limit theoremof random sums of independent and identically distributed random variables. Applicability of this theorem in practice, however, is limited since the normalization requires random factors. In this paper we establish sufficient conditions under which the central limit theorem holds when such random factors are replaced by the underlying asymptotic mean and standard ddeviation. An application of this result in the context of shock models is also given.     

关于Euler数的一个问题的解决

本文证明了:对任何素数p≡5(mod 8);有 E(p-1)/2≠0(mod p),这里E_(2n)是Euler数。     

A note on some relations among special sums of reciprocals modulo <Emphasis Type="Italic">p</Emphasis>

In this note the sums s(k, N) of reciprocals are investigated, where p is an odd prime, N, k are integers, p does not divide N, N ≥ 1 and 0 ≤ k ≤ N − 1. Some linear relations for these sums are derived using “logarithmic property” and Lerch’s Theorem on the Fermat quotient. Particularly in case N = 10 another linear relation is shown by means of Williams’ congruences for the Fibonacci numbers. Published results were acquired using the subsidization of the Ministry of Education, Youth and Sports of the Czech Republic, research plan MSM 0021630518 “Simulation modeling of mechatronic systems”.