Definition:Proper Divisor/Integer

From ProofWiki
Jump to navigation Jump to search


It has been suggested that this page or section be merged into Definition:Aliquot Part.
To discuss this page in more detail, feel free to use the talk page.
When this work has been completed, you may remove this instance of {{Mergeto}} from the code.


Definition

Let $\struct {\Z, +, \times}$ be the ring of integers.

Let $x, y \in \Z$.

Let $x$ divides $y$ be defined as:

$x \divides y \iff \exists t \in \Z: y = t \times x$

in the conventional way.


Then $x$ is a proper divisor of $y$ if and only if:

$(1): \quad x \divides y$
$(2): \quad \size x \ne \size y$
$(3): \quad x \ne \pm 1$

That is:

$(1): \quad x$ is a divisor of $y$
$(2): \quad x$ and $y$ are not equal in absolute value
$(3): \quad x$ is not equal to either $1$ or $-1$.


Examples

Example: $21$

The proper divisors of $12$ are:

$1, 3, 7$


Also known as

A proper divisor is also known as a proper factor.

An older name for a proper divisor of an integer is aliquot part.


Also see

  • Results about proper divisors can be found here.


Sources

Retrieved from "https://proofwiki.org/w/index.php?title=Definition:Proper_Divisor/Integer&oldid=735423"