To install click the Add extension button. That's it.

The source code for the WIKI 2 extension is being checked by specialists of the Mozilla Foundation, Google, and Apple. You could also do it yourself at any point in time. 4,5
Kelly Slayton
Congratulations on this excellent venture… what a great idea!
Alexander Grigorievskiy
I use WIKI 2 every day and almost forgot how the original Wikipedia looks like.
Live Statistics
English Articles
Improved in 24 Hours
Added in 24 Hours
Languages
Recent
Show all languages
What we do. Every page goes through several hundred of perfecting techniques; in live mode. Quite the same Wikipedia. Just better.
.
Leo
Newton
Brights
Milds # Refactorable number

Demonstration, with Cuisenaire rods, that 1, 2, 8, 9, and 12 are refactorable

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 $\tau (n)|n$ . 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.

## Properties

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

Let $T(x)$ be the number of refactorable numbers which are at most $x$ . The problem of determining an asymptotic for $T(x)$ is open. Spiro has proven that $T(x)={\frac {x}{{\sqrt {\log x}}(\log \log x)^{o(1)}}}$ There are still unsolved problems regarding refactorable numbers. Colton asked if there are there arbitrarily large $n$ such that both $n$ and $n+1$ are refactorable. Zelinsky wondered if there exists a refactorable number $n_{0}\equiv a\mod m$ , does there necessarily exist $n>n_{0}$ such that $n$ is refactorable and $n\equiv a\mod m$ .

## History

First defined by Curtis Cooper and Robert E. Kennedy where they showed that the tau numbers has natural density zero, they were later rediscovered by Simon Colton using a computer program he had made which invents and judges definitions from a variety of areas of mathematics such as number theory and graph theory. 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.