answersLogoWhite

0

"mod" is short for "modulo", and indicates the remainder after division of the first number by the second. For example, 11 mod 2 = 1 (11 / 2 has an integer quotient of 5, with 1 left over).

User Avatar

Wiki User

12y ago

Still curious? Ask our experts.

Chat with our AI personalities

RafaRafa
There's no fun in playing it safe. Why not try something a little unhinged?
Chat with Rafa
BlakeBlake
As your older brother, I've been where you are—maybe not exactly, but close enough.
Chat with Blake
ViviVivi
Your ride-or-die bestie who's seen you through every high and low.
Chat with Vivi

Add your answer:

Earn +20 pts
Q: How do you get the 'mod' of a number?
Write your answer...
Submit
Still have questions?
magnify glass
imp
Continue Learning about Basic Math

How does you solve mod?

Mod is essentially the remainder when a given number is divided by the base (of the modulus).So10/3 has a remainder of 1 and so 10(mod 3) = 111/3 has a remainder of 2 and so 11(mod 3) = 2


Will the number 777 be in the sequence that increase by 7 and why?

That all depends upon the first term of the sequence: As long as the first number is less than, or equal to 777 and as long as (first_number MOD 7) ≡ (777 MOD 7) will 777 be in the sequence. 777 MOD 7 ≡ 0 ⇒ if, and only if, first_number ≤ 777 and first_number MOD 7 ≡ 0 (ie 7 divides the first number) will 777 be in the sequence.


How do you convert the complex number minus i into polar form?

A COMPLEX NUMBER CAN BE CONVERTED INTO A POLAR FORM LET US TAKE COMPLEX NUMBER BE Z=a+ib a is the real number and b is the imaginary number THEN MOD OF Z IS SQUARE ROOT OF a2+b2 MOD OF Z CAN ALSO BE REPRESENTED BY r . THEN THE MOD AMPLITUDE FORM IS r(cos@Very interesting, but -i is not a complex no. it is a simple (imaginary) no. with no real part.


How can find prime number by using if in vbscript?

Dim prime, nprime = TRUEn=cint(inputbox("Enter a number to find whether it is Prime or Not"))for i=2 to (n-1)If n mod i = 0 thenprime = FalseExit forEnd ifNextIf prime thenmsgbox "Yes! It is a Prime number"Elsemsgbox "No! it is not a prime number"End if


How do you find prime no in gwbasic program?

10 input "enter a no."; n 20 for i = 1 to n 30 if n mod i = 0 then c = c +1 40 next i 50 if c = 2 then print "prime number" else print "not a prime number" 60 end