#modulo arithmetic

Sum of digits of small powers of nine.

[Click here for a PDF of this post] [mathjax]

In a previous post I wondered how to prove that for integer \(d \in [1,N]\)

\begin{equation}\label{eqn:numberGame:20} ((N-1) d) \text{mod} N + ((N-1) d) \text{div} N = N-1. \end{equation}

Here’s a proof in two steps. First for \(N = 10\), and then by search and replace for arbitrary \(N\).

\paragraph{\(N = 10\)}

Let

\begin{equation}\label{eqn:numberG…

A Modular Multiplicative Inverse Calculator I built for Creative Arts in school.

http://jden.me/inverse_mod