How to Solve Congruence Problems with Modulo Arithmetic

AI Thread Summary
The discussion focuses on solving congruence problems using modulo arithmetic. The first problem with Mod24 was solved correctly by treating negative numbers as positive, while the second problem with Mod25 required a different approach due to the odd modulus, leading to a correct solution by directly adding and subtracting. The participant struggles with finding the inverse of 17 in Mod 24, noting that their attempts did not yield the expected results, and they question the methodology. Responses clarify that the first problem's success was coincidental and emphasize the importance of understanding the properties of modulo operations. The participant expresses a desire to improve their math skills, recognizing the logical nature of the subject.
morrowcosom
Messages
52
Reaction score
0
I am on the http://cow.temple.edu/~cow/cgi-bin/manager website working some congruence problems, here you can plug in answers over and over until you get them right.

Three problems still baffle me:

1) With Mod24, find the solution of 3-15-21=. Here I just pretended that none of the numbers were negative (which meant they totaled 39) and arrived at an answer of 15, which was correct.

2) With Mod25, find the solution of 3-5+13-24=. I tried the same approach of pretending that none of the numbers were negative, and got the wrong answer. I then just added with each sign as it was (to get a total of -13) and arrived at a correct solution of 12.

What is the difference between these two problems that changes the methods of solving them, or am I going about it totally wrong? The earlier addition/subtraction problems seemed straightforward.

3) With Mod 24^x, find the solution of the inverse of 17. I set the problem up as 17x=1Mod24.
As hard as I tried (I used every number from 1 to 23), I could not get an answer to work out. I just randomly plugged 9 in as the solution and it was the answer. When I went back and plugged 9 into my equation it did not match up at all. I have been successful at doing many of these inverse type problems, but I just do not understand this one. The only thing I could get to equal 9 was the number of prime numbers in 24. What am I misunderstanding?

Thanks for the help
 
Physics news on Phys.org
In your first question, the second way you did it with mod 25 is correct. When you got right the first one by switching the signs, it was a coincidence. Note that 3-15-21 = 3-(15+21) = 3-12 (mod 24). However, add 24, and you find that 3-12 = 3+12 = 3+(15+21) (mod 24). This only worked because 15+26 = 12 (mod 24). Of course, 25 is odd, so the same coincidence couldn't happen.

For your other question, I really don't know. When you say mod 24^x, are you supposed to solve for x? And in fact 17 does have an inverse mod 24, namely itself.
 
On problem 1 (Mod 24 3-15-21=x) ,why did you reverse the sign on the 21 (3-(15+21)) to find your solution of 3-12Mod24?

Thanks for your help, math has always been a trouble spot for me, but I feel it is the purest form of logic, so I want to get good at it.
 
I tried to combine those 2 formulas but it didn't work. I tried using another case where there are 2 red balls and 2 blue balls only so when combining the formula I got ##\frac{(4-1)!}{2!2!}=\frac{3}{2}## which does not make sense. Is there any formula to calculate cyclic permutation of identical objects or I have to do it by listing all the possibilities? Thanks
Essentially I just have this problem that I'm stuck on, on a sheet about complex numbers: Show that, for ##|r|<1,## $$1+r\cos(x)+r^2\cos(2x)+r^3\cos(3x)...=\frac{1-r\cos(x)}{1-2r\cos(x)+r^2}$$ My first thought was to express it as a geometric series, where the real part of the sum of the series would be the series you see above: $$1+re^{ix}+r^2e^{2ix}+r^3e^{3ix}...$$ The sum of this series is just: $$\frac{(re^{ix})^n-1}{re^{ix} - 1}$$ I'm having some trouble trying to figure out what to...
Back
Top