Category:Inconsummate Numbers

From ProofWiki
Jump to navigation Jump to search

This category contains results about Inconsummate Numbers.

Let $m \in \Z_{>0}$ be a positive integer.

Let $s_{10}$ denote the digit sum base $10$ .


$m$ is an inconsummate number if and only if:

$\nexists n \in \Z_{>0}: n = m \times s_{10} \left({n}\right)$

That is, if and only if there exists no positive integer $n \in \Z_{>0}$ such that $n$ equals $m$ multiplied by the digit sum of $n$.

Subcategories

This category has only the following subcategory.

Pages in category "Inconsummate Numbers"

This category contains only the following page.