How much is 17 mod 3?
17 mod 3 equals 2 since dividing 17 by 3 gives a quotient of 5 and a remainder of 2. The remainder is the result of the modulus operation. In simpler terms, 17 mod 3 = 2.
How to calculate modulo division?
To calculate modulo division: subtract the divisor from the dividend until the resultant is less than the divisor.
What are the components of modulo division?
The components of modulo division are dividend, divisor, quotient, and remainder. The remainder is the answer or end result of the operation.
Videos
Hello,
What is the difference between the Oakley Mod 3 and Mod 5. To me, they both look great. So is it worth paying the extra £50 for the mod 5? Are these helmets both compatible with all Oakley goggles?
Side note: this would be for my second proper skiing trip to France and I can confidently ski blues and reds, is it actually worth it buying a helmet or should I just rent?
Thanks
Here's a direct proof: note that $$n^5 - n = n(n^4-1) = n(n-1)(n+1)(n^2+1)$$
You need to prove that this number is divisible by $2$ and $5$.
For divisibility by $2$, note that either $n$ or $n+1$ must be even.
For divisibility by $5$, you should prove that if neither $n$ nor $n \pm 1$ is divisible by $5$ (i.e. if $n \equiv 2\ \text{or}\ 3 \bmod 5$) then $n^2+1$ is divisible by $5$.
Hint: In order to use Fermat's Little Theorem, you need the modulus to be prime which $10$ is not. However, $10 = 2\times 5$. Use Fermat's Little Theorem for each prime and see if you can combine these results to arrive at your claim.
When you see "modulo", especially if you are using a calculator, think of it as the remainder term when you do division.
Examples:
The result of 10 modulo 5 is 0 because the remainder of 10 / 5 is 0.
The result of 7 modulo 5 is 2 because the remainder of 7 / 5 is 2.
The reason your calculator says 113 modulo 120 = 113 is because 113 < 120, so it isn't doing any division.
More generally, the idea is that two numbers are congruent if they are the same modulo a given number (or modulus)
For example, as above, $7 \equiv 2 \mod 5$ where $5$ is our modulus.
Another issue is that of inverses, which is where the confusion of $1/17$ comes in.
We say that $a$ and $b$ are inverses modulo $n$, if $ab \equiv 1 \mod n$, and we might write $b = a^{-1}$.
For example $17\cdot 113 = 1921 = 120\cdot 16 +1 \equiv 1 \mod 120$, so $17^{-1} = 113$ modulo $120$.
There are ways to calculate it, modulo is remainder counting basically. $$7 = 2 \mod 5$$ because $7=5*1+2$ $$12 = 2 \mod 5$$ because $12=5*2+2$ and so on, so if you want to calculate for example $73 = a \mod 7$ you can do this, that is want to get $a$, take 73 and continue subtracting 7 until you no longer can. $73-7=66$, $66-7=59$ etc until we get $10-7=3$ which gives us that $a=3$ in it's simplest form (any of the results along the way can technically be a).
As for what $1/17=113 \mod 120$ the question is simply what times 17 gives remainder 1 when divided by 120? $113\cdot 17 = 1921 = 120\cdot 16+1$