Content deleted Content added
Spacetime02 (talk | contribs) The article previously said the sum of divisors of the nth primorial was 2^n, which is untrue (p1# = 2, which has divisor sum 3). This edit corrects that to the number of divisors of the nth primorial. |
|||
Line 170:
because by definition, the factors of a prime number are 1 and itself. Also, where ''p<sub>n</sub>''# denotes the [[primorial]],
:<math> \
since ''n'' prime factors allow a sequence of binary selection (<math>p_{i}</math> or 1) from ''n'' terms for each proper divisor formed.
| |||