Fix with . Choose primes in , repetitions allowed, and an integer cofactor so that . The product is between and , so and all resulting integers are -smooth. The Mertens theorem for reciprocal primes makes the reciprocal prime sum tend to . Since , there are ordered representations. Each integer has only prime factors in that interval, counted with multiplicity, so representation multiplicities are bounded by a constant depending on . This proves the density bound. For arbitrary fixed positive , choose a smaller reciprocal-integer exponent.
// Target: number-theory.bigb
Articles by others on the same topic
There are currently no matching articles.