what is this this question
Attachments:
rajiv1144:
Have exam tomorrow?
Answers
Answered by
4
Molecules is the question
Answered by
12
✒Modulus
Defination :
In computing, the modulo operation finds the remainder after division of one number by another (sometimes called modulus). Given two positive numbers, a (the dividend) and n (the divisor), a modulo n (abbreviated as a mod n) is the remainder of the Euclidean division of a by n.
if like please thank ❤❤
Defination :
In computing, the modulo operation finds the remainder after division of one number by another (sometimes called modulus). Given two positive numbers, a (the dividend) and n (the divisor), a modulo n (abbreviated as a mod n) is the remainder of the Euclidean division of a by n.
if like please thank ❤❤
Similar questions