Question

how is "SmartScore" calculated?

also, do i need to use Fermats little theorem to prove the following in a non exhaustive/inductive way:

Answer 1

if n =r (mod 4)

then a^n = a^r (mod 10)

Answer 2

n, r, and a are all natural numbers by the way

Answer 3

for info on the smart score check the OS feedback posts on it. They don't want to tell us the exact formula though, so that people can't rig the system.
as far as your math Q, you should tag some people that know number theory really well
@FoolForMath knows a lot of number theory for instance

Answer 4

thanks :D

Answer 5

ooh now i can only give a "best answer" medal

Answer 6

You would want Euler's theorem which is a generalized form of Fermat's little theorem to prove that statement.

Answer 7

looks like some pretty hefty maths.. thankyou!

Answer 8

You're welcome.

As a side note, if you want to prove Euler's theorem, it's the same technique as Fermat's last theorem as long as you know what \(\phi(a)\) means.

Answer 9

i havent seen the proof for either, i'll have to take a look after my physics hwk

Answer 10

Oops. I meant similar to the proof of Fermat's LITTLE Theorem. Not last. The last one is pretty hard to prove.

Answer 11

haha