1977 .27 - (76.38) Problems and results on combinatorial number
... The best lower bound for f(n) is due to Berlekamp, Lovász and myself, (f(p) > p 2P if p is a prime and f(n) > cZ n for all n) . It would be very interesting to decide if f(n) I/n - oo is true . My guess would be that it is true . I proved by the probabilistic method that fu (n) > (1+sc ) n if u > cn ...
... The best lower bound for f(n) is due to Berlekamp, Lovász and myself, (f(p) > p 2P if p is a prime and f(n) > cZ n for all n) . It would be very interesting to decide if f(n) I/n - oo is true . My guess would be that it is true . I proved by the probabilistic method that fu (n) > (1+sc ) n if u > cn ...
An amazing prime heuristic
... this is indeed the case. Note that asymptotically equation 3.4 must also give the expected number of consecutive primes whose difference is k. This can be shown (and the values estimated more accurately for small N ) using the inclusion-exclusion principle [7, 29]. From this it is conjectured that t ...
... this is indeed the case. Note that asymptotically equation 3.4 must also give the expected number of consecutive primes whose difference is k. This can be shown (and the values estimated more accurately for small N ) using the inclusion-exclusion principle [7, 29]. From this it is conjectured that t ...
