A community for students. Sign up today!
Here's the question you clicked on:
 0 viewing

This Question is Closed

ParthKohli
 2 years ago
Best ResponseYou've already chosen the best response.3By div, do you mean quotient?

lgbasallote
 2 years ago
Best ResponseYou've already chosen the best response.0...why are you asking me?

jiteshmeghwal9
 2 years ago
Best ResponseYou've already chosen the best response.0becoz i m not getting ur question :(

ParthKohli
 2 years ago
Best ResponseYou've already chosen the best response.3\[\large \rm 3 \cdot (4) + \underbrace{1}_{\large modulus} = 11\]

lgbasallote
 2 years ago
Best ResponseYou've already chosen the best response.0and what does 11/3, 113 mean @jiteshmeghwal9 ?

lgbasallote
 2 years ago
Best ResponseYou've already chosen the best response.0and why is @bahrom7893 wrong @ParthKohli ?

ParthKohli
 2 years ago
Best ResponseYou've already chosen the best response.3Depends on your question...\[\large \rm a ~div~b=a\div b?\]

ParthKohli
 2 years ago
Best ResponseYou've already chosen the best response.3@lgbasallote How is the modulus 2? Can you show so?

lgbasallote
 2 years ago
Best ResponseYou've already chosen the best response.0again...why are you asking me?

ParthKohli
 2 years ago
Best ResponseYou've already chosen the best response.3Then,\[\rm \large 11~div~3 ={11 \over 3} = 3{2 \over 3}\]

bahrom7893
 2 years ago
Best ResponseYou've already chosen the best response.0Parth... i thought modulus was a remainder when a is divided by b. That's what it means in programming.

jiteshmeghwal9
 2 years ago
Best ResponseYou've already chosen the best response.0\[\Huge{\frac{11}{2}=a \div b}\] accrding to ur question . but i'm not getting what do u mean by \(\Large{a\space mod\space b}\). @lgbasallote

bahrom7893
 2 years ago
Best ResponseYou've already chosen the best response.0oh it's 11.. shoot i got my mod wrong

bahrom7893
 2 years ago
Best ResponseYou've already chosen the best response.0A mod B is A%B, or the remainder when A is divided by B

lgbasallote
 2 years ago
Best ResponseYou've already chosen the best response.0mod is modulo @jiteshmeghwal9

ParthKohli
 2 years ago
Best ResponseYou've already chosen the best response.3@jiteshmeghwal9 a mod b is the remainder when a is divided by b. Yep.

bahrom7893
 2 years ago
Best ResponseYou've already chosen the best response.0dw:1350970551590:dw

jiteshmeghwal9
 2 years ago
Best ResponseYou've already chosen the best response.0dw:1350970548817:dw

bahrom7893
 2 years ago
Best ResponseYou've already chosen the best response.0dw:1350970607290:dw

lgbasallote
 2 years ago
Best ResponseYou've already chosen the best response.0question is... why is @ParthKohli saying something different...

ParthKohli
 2 years ago
Best ResponseYou've already chosen the best response.3@bahrom7893 now prove that 2 mod 3 is equivalent to 1 mod 3.

bahrom7893
 2 years ago
Best ResponseYou've already chosen the best response.0lol parth i have no clue how to prove that.

bahrom7893
 2 years ago
Best ResponseYou've already chosen the best response.0but it must be hahah

ParthKohli
 2 years ago
Best ResponseYou've already chosen the best response.3Dude 2 mod 3 = 1 1 mod 3 = 1 So they are equivalent.

jiteshmeghwal9
 2 years ago
Best ResponseYou've already chosen the best response.0\[\Huge{1 \times \frac{11}{3} \approx 3.67}\]

ParthKohli
 2 years ago
Best ResponseYou've already chosen the best response.3\[\rm \large 3 \cdot 1+\underbrace1_{modulus} =2\]

ParthKohli
 2 years ago
Best ResponseYou've already chosen the best response.3According to definition, actually, modulus is 'c' in the following: n = a x b + c

lgbasallote
 2 years ago
Best ResponseYou've already chosen the best response.0since when did 2 divided by 3 become 1...you have to teach me some arithmetic master

ParthKohli
 2 years ago
Best ResponseYou've already chosen the best response.3Modulus is NOT NECESSARILY THE REMAINDER, SIRE.

ParthKohli
 2 years ago
Best ResponseYou've already chosen the best response.3Do you know the Euclidean Algorithm?

ParthKohli
 2 years ago
Best ResponseYou've already chosen the best response.3Use the Euclidean Algorithm then.

ParthKohli
 2 years ago
Best ResponseYou've already chosen the best response.3a variation of Euclidean Algorithm actually...

lgbasallote
 2 years ago
Best ResponseYou've already chosen the best response.0euclidian algorithm is used for finding gcf....

ParthKohli
 2 years ago
Best ResponseYou've already chosen the best response.3If this is true:\[\large \rm a\cdot b +c=n\]Then this is true:\[\rm \large n~mod~a=c\]Where \(\rm b\) is an integer.

ParthKohli
 2 years ago
Best ResponseYou've already chosen the best response.3The above is the actual definition of modulus.

ParthKohli
 2 years ago
Best ResponseYou've already chosen the best response.3And that definition does satisfy the following:\[\rm \large 3\cdot(1)+1 = 2\]Therefore\[2\mod 3=1\]

ParthKohli
 2 years ago
Best ResponseYou've already chosen the best response.3compare the above with the definition:\[\rm \large a = 3\]\[\large \rm b = 1\]\[\rm \large c = 1 = 2mod3\]

ParthKohli
 2 years ago
Best ResponseYou've already chosen the best response.3And\[\rm \large n = 2\]

ParthKohli
 2 years ago
Best ResponseYou've already chosen the best response.3\[\rm \large 3\cdot(1) + 1 = 2\]\[\rm \large a\cdot b +c=n \]

lgbasallote
 2 years ago
Best ResponseYou've already chosen the best response.0you're not really telling me anything...you're just circling around

ParthKohli
 2 years ago
Best ResponseYou've already chosen the best response.3lol I am... I just proved you that \(\rm \large (2) mod3 = 1\)

lgbasallote
 2 years ago
Best ResponseYou've already chosen the best response.0you just have 2 mod 3 = ? show me how you get that to be 1

lgbasallote
 2 years ago
Best ResponseYou've already chosen the best response.0you didn't really prove...because you just assumed a value of b and c and equated them

ParthKohli
 2 years ago
Best ResponseYou've already chosen the best response.3That's the definition of modulus, dude.

lgbasallote
 2 years ago
Best ResponseYou've already chosen the best response.0show me a solution that tells me 2 mod 3 is 1

lgbasallote
 2 years ago
Best ResponseYou've already chosen the best response.0you have two unknows..you can't use the definition

ParthKohli
 2 years ago
Best ResponseYou've already chosen the best response.3I'd show you all of it in one post.

ParthKohli
 2 years ago
Best ResponseYou've already chosen the best response.3The definition is as follows: If this is true, a * b + c = n Then this is also true, n mod a = c Now, this is true: 3 * (1) + 1 = 2 Then, this is ought to be true: 2 mod 3 = 1

ParthKohli
 2 years ago
Best ResponseYou've already chosen the best response.3Would you like it with hearts and smileys? Oh, also see that b is an integer.

lgbasallote
 2 years ago
Best ResponseYou've already chosen the best response.0but the question you refuse to answer is... how do you get those values???

lgbasallote
 2 years ago
Best ResponseYou've already chosen the best response.01and 1..you can't pull them out of nowhere

ParthKohli
 2 years ago
Best ResponseYou've already chosen the best response.3Do you think that my answer works according to the definition? Oh, and you have to try and test in the Euclidean Algorithm too.

lgbasallote
 2 years ago
Best ResponseYou've already chosen the best response.0i'm not asking about the definition! i'm asking about your numbers

ParthKohli
 2 years ago
Best ResponseYou've already chosen the best response.3Oh, and you have to try and test in the Euclidean Algorithm too.

lgbasallote
 2 years ago
Best ResponseYou've already chosen the best response.0i can also say 3*(2) + 4 = 2 so i can say 2 mod 3 is 4

lgbasallote
 2 years ago
Best ResponseYou've already chosen the best response.0so you're wrong by *my* answer

lgbasallote
 2 years ago
Best ResponseYou've already chosen the best response.02 mod 3 should be 4 not 1

ParthKohli
 2 years ago
Best ResponseYou've already chosen the best response.3That's the fun of modular arithmetic: you have 2 mod 3 = 1,4,7,10...

ParthKohli
 2 years ago
Best ResponseYou've already chosen the best response.3Yes. Would you like a machine to answer it for you?

lgbasallote
 2 years ago
Best ResponseYou've already chosen the best response.0or...you can just watch more khanacademy videos....

ParthKohli
 2 years ago
Best ResponseYou've already chosen the best response.3http://www.wolframalpha.com/input/?i=2+mod+3 You may have a look.

ParthKohli
 2 years ago
Best ResponseYou've already chosen the best response.3And remember, there's no equality in modulus... there's congruence.\[\rm \large a \mod b \equiv c\]

lgbasallote
 2 years ago
Best ResponseYou've already chosen the best response.0you don't really get what my question was...do you....

ParthKohli
 2 years ago
Best ResponseYou've already chosen the best response.3Though I have to admit, I forgot the above too...

ParthKohli
 2 years ago
Best ResponseYou've already chosen the best response.3\[\rm \large 3\cdot(4)+1 = 11 \]Right?

ParthKohli
 2 years ago
Best ResponseYou've already chosen the best response.3\[11\mod3\equiv 1\]But also...

ParthKohli
 2 years ago
Best ResponseYou've already chosen the best response.3\[\rm \large 3\cdot(5) + 4 = 11\]

ParthKohli
 2 years ago
Best ResponseYou've already chosen the best response.3So we can say that\[\rm \Huge 11\mod3 \equiv1+3k\]where k is an integer.

ParthKohli
 2 years ago
Best ResponseYou've already chosen the best response.3You're welcome. @lgbasallote

lgbasallote
 2 years ago
Best ResponseYou've already chosen the best response.0that was *not* what i was asking

ParthKohli
 2 years ago
Best ResponseYou've already chosen the best response.3You're welcome anyway. I'm glad I could be of help.

lgbasallote
 2 years ago
Best ResponseYou've already chosen the best response.0i already know everything you were saying (you just overcomplicated everything by circling around)....no one was able to answer my question actually... i'll just wait for the big boys to go online...then i can ask them...

ParthKohli
 one year ago
Best ResponseYou've already chosen the best response.3Sorry, if it was modulo, then it's just the remainder.
Ask your own question
Ask a QuestionFind more explanations on OpenStudy
Your question is ready. Sign up for free to start getting answers.
spraguer
(Moderator)
5
→ View Detailed Profile
is replying to Can someone tell me what button the professor is hitting...
23
 Teamwork 19 Teammate
 Problem Solving 19 Hero
 Engagement 19 Mad Hatter
 You have blocked this person.
 ✔ You're a fan Checking fan status...
Thanks for being so helpful in mathematics. If you are getting quality help, make sure you spread the word about OpenStudy.