Abstract

In 1944, P. Erdős \cite{1} proved that if nn is a large highly composite number (HCN) and n1n_1 is the next HCN, then n<n1<n+n(log⁡n)−c,n<n_1<n+n(\log n)^{-c}, where c>0c>0 is a constant. In this paper, using numerical results by D. A. Corneth, we show that most likely c<1.c<1.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.