首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   148篇
  国内免费   25篇
  完全免费   42篇
  数学   215篇
  2020年   3篇
  2019年   7篇
  2018年   8篇
  2017年   6篇
  2016年   2篇
  2015年   6篇
  2014年   3篇
  2013年   6篇
  2012年   5篇
  2011年   6篇
  2010年   5篇
  2009年   12篇
  2008年   18篇
  2007年   9篇
  2006年   15篇
  2005年   16篇
  2004年   12篇
  2003年   16篇
  2002年   13篇
  2001年   11篇
  2000年   6篇
  1999年   5篇
  1998年   10篇
  1997年   4篇
  1996年   3篇
  1994年   6篇
  1992年   1篇
  1987年   1篇
排序方式: 共有215条查询结果,搜索用时 37 毫秒
1.
Sums of Five Almost Equal Prime Squares   总被引:5,自引:0,他引:5  
Let Pi, 1≤i≤5, be prime numbers. It is proved that every integer N that satisfies N=5 (mod 24) can be written as N=p1^2+p2^2+P3^2+p4^2 +p5^2, where │√N5-Pi│≤N^1/2-19/850+∈.  相似文献
2.
On the Waring-Goldbach Problem for Fourth and Fifth Powers   总被引:3,自引:0,他引:3  
It is shown that every sufficiently large integer congruentto 14 modulo 240 may be written as the sum of 14 fourth powersof prime numbers, and that every sufficiently large odd integermay be written as the sum of 21 fifth powers of prime numbers.The respective implicit bounds 14 and 21 improve on the previousbounds 15 (following from work of Davenport) and 23 (due toThanigasalam). These conclusions are established through themedium of the Hardy-Littlewood method, the proofs being somewhatnovel in their use of estimates stemming directly from exponentialsums over prime numbers in combination with the linear sieve,rather than the conventional methods which ‘waste’a variable or two by throwing minor arc estimates down to anauxiliary mean value estimate based on variables not restrictedto be prime numbers. In the work on fifth powers, a switchingprinciple is applied to a cognate problem involving almost primesin order to obtain the desired conclusion involving prime numbersalone. 2000 Mathematics Subject Classification: 11P05, 11N36,11L15, 11P55.  相似文献
3.
Exponential sums over primes in short intervals   总被引:3,自引:0,他引:3  
In this paper we establish one new estimate on exponential sums over primes in short intervals. As an application of this result, we sharpen Hua's result by proving that each sufficiently large integer N congruent to 5 modulo 24 can be written as N = p12 p22 p32 p42 p52, with |pj-(N/5)~(1/2)|≤U = N1/2-1/20 ε, where pj are primes. This result is as good as what one can obtain from the generalized Riemann hypothesis.  相似文献
4.
On exponential sums over primes and application in Waring-Goldbach problem   总被引:3,自引:0,他引:3  
In this paper, we prove the following estimate on exponential sums over primes: Let κ≥1,βκ=1/2 log κ/log2, x≥2 and α=a/q λsubject to (a, q) = 1, 1≤a≤q, and λ∈R. Then As an application, we prove that with at most O(N2/8 ε) exceptions, all positive integers up to N satisfying some necessary congruence conditions are the sum of three squares of primes. This result is as strong as what has previously been established under the generalized Riemann hypothesis.  相似文献
5.
一个素变数的Diophantine不等式   总被引:3,自引:3,他引:0       下载免费PDF全文
蔡迎春 《数学学报》1996,39(6):733-742
设1<C<13/12.本文证明了存在N(C)>0使得对任意实数N>N(C),下面的不等式|++ -N|<N-    )logsN有素数解p1,p2,p3,其中s=2(15).  相似文献
6.
We show that the elliptic curve analogue of the linear congruential generator produces sequences with high linear complexity and good multidimensional distribution.communicated by: A. MenezesAMS Classification: 11T23, 14H52, 65C10  相似文献
7.
Vinogradov's Integral and Bounds for the Riemann Zeta Function   总被引:2,自引:0,他引:2  
The main result is an upper bound for the Riemann zeta functionin the critical strip: with A = 76.2 and B = 4.45, valid for 1 and |t| 3. The previousbest constant B was 18.5. Tools include a variant of the Korobov–Vinogradovmethod of bounding exponential sums, an explicit version ofT. D. Wooley's bounds for Vinogradov's integral, and explicitbounds for mean values of exponential sums over numbers withoutsmall prime factors, also using methods of Wooley. An auxiliaryresult is the exponential sum bound , where N is a positive integer, t is a real number, = log (t)/(logN) and 2000 Mathematical Subject Classification: primary 11M06, 11N05,11L15; secondary 11D72, 11M35.  相似文献
8.
在给定条件下证明了不等式|λ1p1 λ2p22 λ3p23 μ12x1 … μs2xs γ|<η有无限多素数p1,p2,p3和正整数x1,…,xs解.  相似文献
9.
We consider a generalisation of the hidden number problem recently introduced by Boneh and Venkatesan. The initial problem can be stated as follows: recover a number such that for many known random approximations to the values of are known. Here we study a version of the problem where the ``multipliers' are not known but rather certain approximations to them are given. We present a probabilistic polynomial time solution when the error is small enough, and we show that the problem cannot be solved if the error is sufficiently large. We apply the result to the bit security of ``timed-release crypto' introduced by Rivest, Shamir and Wagner, to noisy exponentiation black-boxes and to the bit security of the ``inverse' exponentiation. We also show that it implies a certain bit security result for Weil pairing on elliptic curves.

  相似文献

10.
On the uniformity of distribution of the RSA pairs   总被引:1,自引:0,他引:1  

Let be a product of two distinct primes and . We show that for almost all exponents with the RSA pairs are uniformly distributed modulo when runs through

the group of units modulo (that is, as in the classical RSA scheme);

the set of -products , , where are selected at random (that is, as in the recently introduced RSA scheme with precomputation).
These results are based on some new bounds of exponential sums.

  相似文献

设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号