I'm having a little trouble proving the following:
If
then
# | User | Rating |
---|---|---|
1 | ecnerwala | 3649 |
2 | Benq | 3581 |
3 | orzdevinwang | 3570 |
4 | Geothermal | 3569 |
4 | cnnfls_csy | 3569 |
6 | tourist | 3565 |
7 | maroonrk | 3531 |
8 | Radewoosh | 3521 |
9 | Um_nik | 3482 |
10 | jiangly | 3468 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 174 |
2 | awoo | 164 |
3 | adamant | 162 |
4 | TheScrasse | 159 |
5 | nor | 158 |
6 | maroonrk | 156 |
7 | -is-this-fft- | 151 |
8 | SecondThread | 147 |
9 | orz | 146 |
10 | pajenegod | 145 |
I'm having a little trouble proving the following:
If
then
Name |
---|
Here's what I came up with:
. And we can write k as c·m + d, with d < m.
So we want to show that .
The left hand side obviously simplifies to d.
On the right hand side we get: . The c·m·b vanishes, because of the modulo. And since d < m, d·b mod (m·b) = d·b. So it simplifies to too, which completes the proof.
Hope that helps :)