搜索结果: 1-1 共查到“常微分方程 primes”相关记录1条 . 查询时间(0.078 秒)
Given a large positive integer N, how quickly can one construct a prime number larger than N (or between N and 2N)? Using probabilistic methods, one can obtain a prime number in time at most logO(1) N...