Refactorable number

A refactorable number or tau number is an integer n that is divisible by the count of its divisors, or to put it algebraically, n is such that ${\displaystyle \tau (n)\mid n}${\displaystyle \tau (n)\mid n} with ${\displaystyle \tau (n)=\sigma _{0}(n)=\prod _{i=1}^{n}(e_{i}+1)}${\displaystyle \tau (n)=\sigma _{0}(n)=\prod _{i=1}^{n}(e_{i}+1)} for ${\displaystyle n=\prod _{i=1}^{n}p_{i}^{e_{i}}}${\displaystyle n=\prod _{i=1}^{n}p_{i}^{e_{i}}}. The first few refactorable numbers are listed in (sequence A033950 in the OEIS) as

1, 2, 8, 9, 12, 18, 24, 36, 40, 56, 60, 72, 80, 84, 88, 96, 104, 108, 128, 132, 136, 152, 156, 180, 184, 204, 225, 228, 232, 240, 248, 252, 276, 288, 296, ...

For example, 18 has 6 divisors (1 and 18, 2 and 9, 3 and 6) and is divisible by 6. There are infinitely many refactorable numbers.

Cooper and Kennedy proved that refactorable numbers have natural density zero. Zelinsky proved that no three consecutive integers can all be refactorable.^[1] Colton proved that no refactorable number is perfect. The equation ${\displaystyle \gcd(n,x)=\tau (n)}${\displaystyle \gcd(n,x)=\tau (n)} has solutions only if ${\displaystyle n}${\displaystyle n} is a refactorable number, where ${\displaystyle \gcd }${\displaystyle \gcd } is the greatest common divisor function.

Let ${\displaystyle T(x)}${\displaystyle T(x)} be the number of refactorable numbers which are at most ${\displaystyle x}${\displaystyle x}. The problem of determining an asymptotic for ${\displaystyle T(x)}${\displaystyle T(x)} is open. Spiro has proven that ${\displaystyle T(x)={\frac {x}{{\sqrt {\log x}}(\log \log x)^{1-o(1)}}}}${\displaystyle T(x)={\frac {x}{{\sqrt {\log x}}(\log \log x)^{1-o(1)}}}}^[2]

There are still unsolved problems regarding refactorable numbers. Colton asked if there are arbitrarily large ${\displaystyle n}${\displaystyle n} such that both ${\displaystyle n}${\displaystyle n} and ${\displaystyle n+1}${\displaystyle n+1} are refactorable. Zelinsky wondered if there exists a refactorable number ${\displaystyle n_{0}\equiv a\mod m}${\displaystyle n_{0}\equiv a\mod m}, does there necessarily exist ${\displaystyle n>n_{0}}${\displaystyle n>n_{0}} such that ${\displaystyle n}${\displaystyle n} is refactorable and ${\displaystyle n\equiv a\mod m}${\displaystyle n\equiv a\mod m}.

First defined by Curtis Cooper and Robert E. Kennedy^[3] where they showed that the tau numbers have natural density zero, they were later rediscovered by Simon Colton using a computer program he wrote ("HR") which invents and judges definitions from a variety of areas of mathematics such as number theory and graph theory.^[4] Colton called such numbers "refactorable". While computer programs had discovered proofs before, this discovery was one of the first times that a computer program had discovered a new or previously obscure idea. Colton proved many results about refactorable numbers, showing that there were infinitely many and proving a variety of congruence restrictions on their distribution. Colton was only later alerted that Kennedy and Cooper had previously investigated the topic.

• Divisor function

• Integer sequences

• Articles with short description
• Short description is different from Wikidata