# Modular Arithmetic/Euler's Theorem

This page or section is an undeveloped draft or outline.You can help to develop the work, or you can ask for assistance in the project room. |

**Euler's Theorem**

If and are positive coprime integers, then,

Modular Arithmetic | ||

← Fermat's Little Theorem | Euler's Theorem |
Lagrange's Theorem → |

This page or section is an undeveloped draft or outline.You can help to develop the work, or you can ask for assistance in the project room. |

If $\alpha$ and $\beta$ are positive coprime integers, then,

- $\alpha ^{\phi (\beta )}\equiv 1{\pmod {\beta }}$