Published June 21, 2001 | Version v1

ON RUSSO'S CONJECTURE ABOUT PRIMES

Authors/Creators

Description

Let n, k be positive integres with k>2, and let b be a posItIve number with b> I. In this paper we prove that if n>C(k), where C(k) IS an effectively computable constant depending on k, then we have C (n,k) <21lt .
 

Files

RussoConjPrimes.pdf

Files (70.2 kB)

Name Size
md5:e7a423f27ab42c5caddb0910f827efef
70.2 kB Preview Download