Having some trouble with basic modular arithmetic, most of the materials i have dont seem to be helping..
a simple question 2 mod 10 = 2.. how did they get = 2?
3 mod 18 = 3, could you please explain the process
I'd like to add to tonio's reply. Programmers use b (mod n) to represent the remainder upon dividing b by n. For example, 7 (mod 5) equals 2, since 7/5 = 1, with remainder 2. See , for example, section 3.4 of Concrete Mathematics by Graham, Knuth and Patashnik.