排序方式: 共有12条查询结果,搜索用时 0 毫秒
11.
Let pn be the nth prime. Then this paper is concerned with provingthe following result on the distribution of consecutive primes. The exponent of x in this theorem improves on the work of Heath-Brownwho proved (1) with exponent . Under the Riemann hypothesisone can prove (1) with exponent .The proof of the theorem startswith the Heath-BrownLinnik identity which leads to aformula giving the number of primes in an interval in termsof coefficients of certain Dirichlet series. I then estimatethe coefficients by using, among other things, the informationwhich can be gained from Montgomery's mean value theorem andHuxley's version of the Hal' asz lemma. Furthermore, by usingfamiliar sieve arguments I am able to discard some of the coefficientsallowing us to gain an improvement over the previous resultof Heath-Brown. 1991 Mathematics Subject Classification: 11N05. 相似文献
12.
The time-dependent Schrödinger equation is solved numerically for the case of a Gaussian wave packet incident on a time-varying potential barrier. The time evolving reflection and transmission probabilities of the wave packet are computed for several different time-dependent boundary conditions obtained by reducing or increasing the height of the potential barrier. We show that in the case when the barrier height is reduced to zero, a time interval is found during which the reflection probability is larger (superarrivals) compared to the unperturbed case. We further show that the transmission probability exhibits superarrivals when the barrier is raised from zero to a finite value of its height. Superarrivals could be understood by ascribing the features of a real physical field to the Schrödinger wave function which acts as a carrier through which a disturbance, resulting from the boundary condition being perturbed, prpagates from the barrier to the detectors measuring reflected and transmitted probabilities. The speed of propagation of this effect depends upon the rate of reducing or raising the barrier height, thus suggesting an application for secure information transfer using superarrivals. 相似文献