By Bézout's identity, if there exists integer \((x,y)\) such that it satisfy \(ax+by = 1\), then \((a,b)\) shall have the GCD as 1 (i.e. A and B is coprime)

If \(a|n\) and \(b|n\), then for nonzero integer \(i, j\), it will be \(n = ai\) and \(n = bj\) or \(n^2 = abij\), which means

\[n^2\times\frac{1}{ab} = ij\]

Which proves that \(ab|n\), by closed-form of integer multiplication.

Easy Math Editor

`*italics*`

or`_italics_`

italics`**bold**`

or`__bold__`

boldNote: you must add a full line of space before and after lists for them to show up correctlyparagraph 1

paragraph 2

`[example link](https://brilliant.org)`

`> This is a quote`

Remember to wrap math in \( ... \) or \[ ... \] to ensure proper formatting.`2 \times 3`

`2^{34}`

`a_{i-1}`

`\frac{2}{3}`

`\sqrt{2}`

`\sum_{i=1}^3`

`\sin \theta`

`\boxed{123}`

## Comments

Sort by:

TopNewestBy Bézout's identity, if there exists integer \((x,y)\) such that it satisfy \(ax+by = 1\), then \((a,b)\) shall have the GCD as 1 (i.e. A and B is coprime)

If \(a|n\) and \(b|n\), then for nonzero integer \(i, j\), it will be \(n = ai\) and \(n = bj\) or \(n^2 = abij\), which means

\[n^2\times\frac{1}{ab} = ij\]

Which proves that \(ab|n\), by closed-form of integer multiplication.

Log in to reply