JOURNAL OF THE INDIAN ACADEMY OF MATHEMATICS

(Published by Indian Academy of Mathematics since 1978)

Promoting Research in Pure and Applied Mathematics

ISSN 0970-5120


HomeArchiveContents
← Back to Volume 46, Issue 1 Contents

CLASSIFYING NUMBERS USING DIVISOR FUNCTION TO STUDY HIGHLY COMPOSITE NUMBERS AND TWIN PRIMES CONJECTURE

Gollakota V V Hemasundar
Volume: 46Issue: 1Pages: 67–74Year: 2024ISSN: 0970-5120
⬇ Download Full PDF

Abstract

In this note we classify the positive integers by using divisor function into different equivalence classes. We connect highly composite numbers with this definition. We consider pairs of consecutive odd numbers $(2n+1,2n+3)$ with $\tau(2n+1)=\tau(2n+3)$ where $\tau$ is a divisor function in each equivalence class and call the pair as ``twin odd numbers with equal number of divisors'' (twin odds with ends). Using these equivalence classes we generalize the twin primes conjecture and study some special cases. We also provide computational data using Python to
obtain some interesting results.
Keywords: Divisor Function, Highly Composite Numbers and Twin Primes Conjecture
MSC 2020: 11A25, 11A41

How to Cite

Gollakota V V Hemasundar, CLASSIFYING NUMBERS USING DIVISOR FUNCTION TO STUDY HIGHLY COMPOSITE NUMBERS AND TWIN PRIMES CONJECTURE, Journal of the Indian Academy of Mathematics, 46(1) (2024), 67–74.

References

  • Adolf Heldebrand (1987): The divisor function at consecutive integers, Pacific Journal of Mathematics, Vol. 129, No. 2.
  • Highly Composite Numbers by Srinivasa Ramanujan (1997): Annotated by Jean-Louis Nicolas, Guy Robin, The Ramanujan Journal, Volume 1, Issue 2, pp. 119-153.
  • M. Ram Murty (August 2013): Resonance, Published by the Indian Academy of Sciences, pp. 712-731.

© Journal of the Indian Academy of Mathematics