ON HIGHLY COMPOSITE NUMBERS

@inproceedings{ERD2002ONHC,
  title={ON HIGHLY COMPOSITE NUMBERS},
  author={P. ERD},
  year={2002}
}
  • P. ERD
  • Published 2002
for a certain c. In fact I shall prove that if n is highly composite, then the next highly composite number is less than n+n(log y&)-C ; and the result just stated follows immediately from this. At, present I cannot, decide whether the number of highly composite numbers not exceeding z is greater than (logx)” for every k. The principal tool in the proof will be Ingham’s improvement,$ on Hoheisel’s theorem. This asserts that if x is sufficiently large, then the number of primes in the int,erval… CONTINUE READING

From This Paper

Topics from this paper.

Citations

Publications citing this paper.