Best Answer

There need not be any. Consider (a, b, m, n) = (37, 2, 35, 7) where n is a factor of m.or (a, b, m, n) = (37, 2, 5, 7) where m and n are relatively prime.

Q: If a is congruent to b mod m and a is also congruent to b mod n what is the relationship between m and n?

Write your answer...

Submit

Still have questions?

Continue Learning about Math & Arithmetic

"Mod" is often used to indicate the remainder of a division, and it is used that way in programming languages, or in Excel or similar spreadsheets. Thus, for example, mod(10, 3) = 1, since that is the remainder when you divide 10 by 3.

I've seen between 300 and 400. I just paid 350 for one.

267 This question can easily be answered with some knowledge of programming, where the counts every case where x mod 3 = 0, AND X mod 5 (not equal to) 0

36288 WRONG!(1*2*3*4*5*6*7*8*9)/10 WRONG!I obviously misreads the question. after writing a simple visual basic program, see below. I am changing my answer to "does not exist." as the program failed to return a value.Private Sub Command0_Click()Dim i As Longi = 1Do While i Mod 9 > 0 Or i Mod 10 = 0i = i + 1Do While i Mod 8 > 0 Or i Mod 10 = 0i = i + 1Do While i Mod 7 > 0 Or i Mod 10 = 0i = i + 1Do While i Mod 6 > 0 Or i Mod 10 = 0i = i + 1Do While i Mod 5 > 0 Or i Mod 10 = 0i = i + 1Do While i Mod 4 > 0 Or i Mod 10 = 0i = i + 1Do While i Mod 3 > 0 Or i Mod 10 = 0i = i + 1Do While i Mod 2 > 0 Or i Mod 10 = 0i = i + 1LoopLoopLoopLoopLoopLoopLoopLoopMsgBox iEnd Sub

9100 mod 10 = (910 mod 10)10 mod 10 = 110 mod 10 = 1. Thus 1 is the ones digit in 9100.

Related questions

8.9.10.11.12.13 congruent to 1.2.3.4.5.6 = 6! congruent to -1 (mod 7) according to Wilson' theorem

Garry's Mod 10 is a version of Garry's Mod.

mod 55s is in .177 calibre and mod 60s is in .22 calibre apart from this they are the same rifle, it is also available in .25 calibre but not sure of the model number.

A change in the breech bolt mechanism.

Trapper has a shorter barrel

We see that we must find a number n such that it satisfies the condition: n ≡ 0 (mod 2) ≡ 0 (mod 3) ≡ 0 (mod 9) Since 9 is a multiple of 3, we can forget about the 0 (mod 3). Since 2 and 9 are relatively prime, the Chinese Remainder Theorem states that there indeed exists a number n such that it satisfies n ≡ 0 (mod 2) ≡ 0 (mod 9). Now let 2K represent some multiple of 2, and set it congruent to 0 (mod 9): 2K ≡ 0 (mod 9) This is a particularly easy case; 2K would have to equal some multiple of 9 for it to satisfy this expression. Therefore, K = 9 and n must = 18c, where c is an arbitrary multiplier. This is your new modulus: n ≡ 0 (mod 18) Any n that satisfies this condition will also satisfy n ≡ 0 (mod 2) ≡ 0 (mod 3) ≡ 0 (mod 9).

One can find images depicting mod culture online at Mod Culture, The Mod Generation, and Mod Culture. Mod Culture images may also be found online at Wikipedia, Google Images, and Flickr.

I have recently watched Skydoesminecraft Sushi Mod Showcase. That would be a good mod for you. Also with the Food++ mod reviewed by ChimneySwift11 was a great one too

Yes i can download Batman mod for gta san Andreas

mod 51 means that numbers cycle between 0 and 50. For example, 51 mod 51 is 0 because the numbers have completely cycled and have returned to the starting point. 52 mod 51 would be 1, 53 mod 51 would be 2, and so forth.

Made between 1938 & 1965

The spelling "mod" meant modern or stylish in the 1960s.The abbreviation "mod" means modification, used for electronic hardware and computer software. It is also used for the mathematical term modulus.