Given $m\geq 2$, denote by $b^{-1}$ the inverse of $b\pmod{m}$. That is, $b^{-1}$ is the residue for which $bb^{-1}\equiv 1\pmod{m}$. Sadie wonders if $(a+b)^{-1}$ is always congruent to $a^{-1}+b^{-1}$ (modulo $m$). She tries the example $a=2$, $b=3$, and $m=7$. Let $L$ be the residue of $(2+3)^{-1}\pmod{7}$, and let $R$ be the residue of $2^{-1}+3^{-1}\pmod{7}$, where $L$ and $R$ are integers from $0$ to $6$ (inclusive). Find $L-R$.

is the number L such that

Consider the first 7 multiples of 5:

5, 10, 15, 20, 25, 30, 35

Taken mod 7, these are equivalent to

5, 3, 1, 6, 4, 2, 0

This tells us that 3 is the inverse of 5 mod 7, so L = 3.

Similarly, compute the inverses modulo 7 of 2 and 3:

since 2*4 = 8, whose residue is 1 mod 7;

which we got for free by finding the inverse of 5 earlier. So

and so R = 2.

Then L - R = 1.

2^y = ln 5, or   y(ln 2) = ln 5.   solving for y,   y = (ln 5) / (ln 2).   y=5

step-by-step explanation:

c > -10.55

step-by-step explanation: