another proof that a number is polite iff it is positive and not a positive power of
In this entry we give another proof that an integer is polite iff it is neither non-positive nor a positive power of . The proof utilizes the formula
Proof.
By definition, an integer is polite if it a sum of consecutive non-negative integers, itself must be non-negative. Furthermore can not be since a sum of at least two consecutive non-negative integers must be positive. So we may assume that is positive.
There are two cases:
-
1.
is a power of :
Suppose that is polite, say , where is non-negative and , then
This means that is a power of , or and are both powers of by the unique factorization of positive integers. Since , , so that if were a power of , must be odd, which implies that is odd too. Since is a power of , this forces . As and , there is only one solution: and , or , showing that is the only power of that is polite.
-
2.
is not a power of :
Let be the smallest odd prime dividing . Write . So , or . Set
Since is the sum of and , both even numbers, is an integer. Since , is positive. Solving for we get
Then
showing that is polite.
∎
Title | another proof that a number is polite iff it is positive and not a positive power of |
---|---|
Canonical name | AnotherProofThatANumberIsPoliteIffItIsPositiveAndNotAPositivePowerOf2 |
Date of creation | 2013-03-22 18:10:05 |
Last modified on | 2013-03-22 18:10:05 |
Owner | CWoo (3771) |
Last modified by | CWoo (3771) |
Numerical id | 5 |
Author | CWoo (3771) |
Entry type | Derivation |
Classification | msc 11A25 |