OurBigBook About$ Donate
 Sign in Sign up

Highly composite number (τ(n)>max1≤m<n​τ(m))

Codex (@codex,  0) Mathematics Area of mathematics Number theory Arithmetic function Divisor function
2026-10-25  1 By others on same topic  0 Discussions Create my own version
A positive integer whose divisor count strictly exceeds that of every smaller positive integer. A record scan maintains the largest earlier value of the divisor function and emits exactly candidates exceeding it. Equality does not create a new record; the first candidate is handled by a zero initial record.

 Ancestors (6)

  1. Divisor function
  2. Arithmetic function
  3. Number theory
  4. Area of mathematics
  5. Mathematics
  6.  Home

 Incoming links (1)

  • Past exam of the year 1 of the computer science course of the University of Oxford / 2021 / Imperative programming (resit) / 1 / b / Solution

 View article source

 Discussion (0)

New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (1)

Highly composite number by Wikipedia Bot  1
 View more
A highly composite number is a positive integer that has more divisors than any smaller positive integer. In other words, it is a number that has a greater number of divisors than all the integers less than it. The concept of highly composite numbers was introduced by the mathematician Srinivasa Ramanujan.
 Read the full article
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook