(a,b) is an integer solution for 45x-28y=130 How can we prove that a is an even number and (b) is a multiple of 5 ?
Look at the right hand side. It is equivalent to \(0 \pmod{5}\).
Thus, the left-hand side has to be \(0 \pmod{5}\) as well. Now, that means \(45x - 28y \equiv 0 \pmod 5\) implying that \(28y \equiv 0 \pmod{5}\). 28 itself is not divisible by 5, so it is obvious that \(y\) has to.
For the first part, use the mod 2.
and mod 2 for x, fairly enough thank you
You are welcome!
@ParthKohli could you please tell me how do i answer to the qs it says what are the reminders of n^2 divided by 4 ?
Ah. Do we have to prove the result as well? While we are on it, look at the remainders when n is even and when n is odd.
Yes 0 when it's even and 1 when odd
Yes, that's right :)
Actually i have big problem with understanding what Congruence is :)
Congruence in modular arithmetic? I had trouble in that once as well. Well, if you say that \(a \equiv 3 \pmod{8}\), it means that \(a\) will get the same remainder when divided by \(8\) as \(3\) does.
mmm r[3/8]=r[a/8]
\[19 \equiv 22 \pmod{3} \]The above is true because both of them get the same remainder when divided by \(3\).
Exactly. There are many solutions for that including \(3\).
I know all of the definitions of congruence but i still have problem using its rules
OK! First things first. Let me give you a pretty good example. Why are ALL integers congruent to 0 OR 1 OR 2 OR 3 (mod 4)?
hh because 3,2,1 are smaller than 4 ?
Let's think about it this way: ALL integers, when divided by 4, will get remainders just as 0 OR 1 OR 2 OR 3 get when divided by 4.
0 gets remainder 0 when divided by 4. 1 gets remainder 1. 2 gets remainder 2. 3 gets remainder 3. So, we mean that the only remainders we can get are 0, 1, 2 or 3. That's true right?
i know that the reminder is always smaller than the divedent
So what I said is true.
Sure it's right
Now, what if I said that all the integers are always congruent to 5 OR 6 OR 7 OR 8?
mod what ?
mod 4.
Yes it's right, if you are talking about reminders make sure it's smaller than the dividend
As i know
Great job, what other properties?
what properties :) ?
ah greater than 0
As you told me, you had trouble understanding congruencies.
Yes
Where?
I didn't understand you which properties are you looking for ?
I meant rules. What rules?
ah you mean the rules that i didn't understand?
Yes, hehe
:) let me call it properties as you already said, i think that changing the number by its reminder is kinda, confusing me :)
Yup! Well, it's just a step higher than divisibility. You know how if two numbers are equal, they must be divisible by the same number? We're doing this a level higher and comparing the remainders. And we don't need to replace a number by its remainder in congruencies!
\[6 \equiv -1[7]\] and \[6\equiv-1[7]\] so \[-1\equiv-1[7]\]
Oh? Why are you confused in this?
Maybe you are trying to mean something like the following:\[1 \equiv 8 \pmod 7\]and\[8 \equiv 15 \pmod 7\]so\[1 \equiv 15 \pmod 7\]
I see this as i replaced the 6 by its reminder by 7, can you change this knowledge from my hand
You have to view a congruence relation a little differently. \(a \equiv b \pmod 7\) just means that they both get the same remainder. No replacements. :)
Yes Exactly its the base propertie i guess
Hmm... why does it not make sense to you? If a number gets the same remainder as the second number, and the second number gets the same as the third, then all the three get the same remainders.
Ok i think that i begin understanding the GOAL :)
if (a+b+c+d) sum of numbers has the same reminder as 6 when they are divided by 7 can i say that every one of a,b,c has the same reminder when divided by 7
as 6 sorry
Nope! You can't. Let me give you an example. a = 1 b = 2 c = 3 d = 0
\[1+2+3+0\equiv6[7]\]
Yup.
But do all of them have the same remainder?
mm Nope
So the answer to your question is no.
what about the sum of tow
Nope, again! But you must be wondering how \(45x - 28y \equiv 0 \pmod{5}\) implies \(28y \equiv 0 \pmod{5}\)
mmm it's a multiple of numbers,right ?
because of 45x
Exactly! \(45x \equiv 0 \pmod{5}\)
Do you see why?
when you say that i view it as you replacing 0 by 45x
Yes, because both of them mean the same in mod 5.
But you don't necessarily have to replace it.
it's kinda rotation isn't it ?
Yup! That's the best way you can think of modular arithmetic.
numbers wrapping around it self
@ParthKohli I'm really begin understanding the concept :)
Yes, you've begun the journey to enlightenment!
@ParthKohli I don't know how to thank you enough, so thank you brother
I thoroughly enjoyed it! You're welcome, and thank YOU!
and sorry about the very bad english
Hehe, I'm not a native speaker either. No problem though! This is about math, not anything else. :)
@ganeshie8 you are enjoying the discussion i guess :)
Haha, he's a good friend.
yup very much :)
Ok guys thank you
I thought you had gone inactive! The fact that you stayed here and listened to us is so appreciable. :)
I'm trying to benefit 100% some people told me that i'm asking people to do my homeworks really my question is kinda homework but used it to start the discussion, i don't care to the solution of the equation because i studied another way to calculate the the solutions :)
Haha, you're a rare case on OS. :)
:)
I see, really some people they need to put their exercises books right here :)
Join our real-time social learning platform and learn together with your friends!