Modulus (%) Operator

[Mathfag No.5193640]

How would one go about creating a modulus function in a programming language where you can only use addition, subtraction, multiplication, and division?

I can think of one way (I'll be writing this in C-like code)
to calculate 8436 % 10:

int a = 8436; // declare integer value a
int b = a / 10; // b = 843 (integer division)
b = b * 10; // b = 8430
int c = a - b; // c = 8436 % 10 = 6

Are there any more efficient ways of programming something like this?

[Anonymous No.5193663]

>>5193640
if you're working with pure integers,

a - (b * (a/b))

should do it

[Anonymous No.5193674]

inline X86 machine code
divide and get the second register holding the remainder.

[Anonymous No.5193675]

>>5193640
believe C basically floors any result of integer division where the result is an integer, so you could basically just do (in a function)...

int mod = a - (b * (a/b))

something like that.