Power of 2 is Almost Perfect

From ProofWiki
Jump to navigation Jump to search

Theorem

Let $n \in \Z_{>0}$ be a power of $2$:

$n = 2^k$

for some $k \in \Z_{>0}$.


Then $n$ is almost perfect.


Proof

\(\displaystyle \map A n\) \(=\) \(\displaystyle \dfrac {2^k} {2 - 1} - 2^k - \dfrac 1 {2 - 1}\) Power of Prime is Deficient
\(\displaystyle \) \(=\) \(\displaystyle 2^k - 2^k - 1\)
\(\displaystyle \) \(=\) \(\displaystyle - 1\)


and so $n = p^k$ is almost perfect by definition.

$\blacksquare$


Sources