Got Homework?
Connect with other students for help. It's a free community.
Here's the question you clicked on:
 0 viewing

This Question is Closed

ParthKohliBest ResponseYou've already chosen the best response.3
By div, do you mean quotient?
 one year ago

lgbasalloteBest ResponseYou've already chosen the best response.0
...why are you asking me?
 one year ago

jiteshmeghwal9Best ResponseYou've already chosen the best response.0
becoz i m not getting ur question :(
 one year ago

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

lgbasalloteBest ResponseYou've already chosen the best response.0
and what does 11/3, 113 mean @jiteshmeghwal9 ?
 one year ago

lgbasalloteBest ResponseYou've already chosen the best response.0
and why is @bahrom7893 wrong @ParthKohli ?
 one year ago

ParthKohliBest ResponseYou've already chosen the best response.3
Depends on your question...\[\large \rm a ~div~b=a\div b?\]
 one year ago

ParthKohliBest ResponseYou've already chosen the best response.3
@lgbasallote How is the modulus 2? Can you show so?
 one year ago

lgbasalloteBest ResponseYou've already chosen the best response.0
again...why are you asking me?
 one year ago

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

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

ParthKohliBest ResponseYou've already chosen the best response.3
Yes, that's what...
 one year ago

jiteshmeghwal9Best 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
 one year ago

bahrom7893Best ResponseYou've already chosen the best response.0
oh it's 11.. shoot i got my mod wrong
 one year ago

bahrom7893Best ResponseYou've already chosen the best response.0
A mod B is A%B, or the remainder when A is divided by B
 one year ago

lgbasalloteBest ResponseYou've already chosen the best response.0
mod is modulo @jiteshmeghwal9
 one year ago

ParthKohliBest ResponseYou've already chosen the best response.3
@jiteshmeghwal9 a mod b is the remainder when a is divided by b. Yep.
 one year ago

bahrom7893Best ResponseYou've already chosen the best response.0
dw:1350970551590:dw
 one year ago

jiteshmeghwal9Best ResponseYou've already chosen the best response.0
dw:1350970548817:dw
 one year ago

bahrom7893Best ResponseYou've already chosen the best response.0
dw:1350970607290:dw
 one year ago

lgbasalloteBest ResponseYou've already chosen the best response.0
question is... why is @ParthKohli saying something different...
 one year ago

ParthKohliBest ResponseYou've already chosen the best response.3
@bahrom7893 now prove that 2 mod 3 is equivalent to 1 mod 3.
 one year ago

bahrom7893Best ResponseYou've already chosen the best response.0
lol parth i have no clue how to prove that.
 one year ago

bahrom7893Best ResponseYou've already chosen the best response.0
but it must be hahah
 one year ago

ParthKohliBest ResponseYou've already chosen the best response.3
Dude 2 mod 3 = 1 1 mod 3 = 1 So they are equivalent.
 one year ago

jiteshmeghwal9Best ResponseYou've already chosen the best response.0
\[\Huge{1 \times \frac{11}{3} \approx 3.67}\]
 one year ago

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

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

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

ParthKohliBest ResponseYou've already chosen the best response.3
Modulus is NOT NECESSARILY THE REMAINDER, SIRE.
 one year ago

ParthKohliBest ResponseYou've already chosen the best response.3
Do you know the Euclidean Algorithm?
 one year ago

ParthKohliBest ResponseYou've already chosen the best response.3
Use the Euclidean Algorithm then.
 one year ago

ParthKohliBest ResponseYou've already chosen the best response.3
a variation of Euclidean Algorithm actually...
 one year ago

lgbasalloteBest ResponseYou've already chosen the best response.0
euclidian algorithm is used for finding gcf....
 one year ago

ParthKohliBest ResponseYou've already chosen the best response.3
If 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.
 one year ago

ParthKohliBest ResponseYou've already chosen the best response.3
The above is the actual definition of modulus.
 one year ago

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

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

ParthKohliBest ResponseYou've already chosen the best response.3
And\[\rm \large n = 2\]
 one year ago

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

lgbasalloteBest ResponseYou've already chosen the best response.0
you're not really telling me anything...you're just circling around
 one year ago

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

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

lgbasalloteBest ResponseYou've already chosen the best response.0
you didn't really prove...because you just assumed a value of b and c and equated them
 one year ago

ParthKohliBest ResponseYou've already chosen the best response.3
That's the definition of modulus, dude.
 one year ago

lgbasalloteBest ResponseYou've already chosen the best response.0
show me a solution that tells me 2 mod 3 is 1
 one year ago

lgbasalloteBest ResponseYou've already chosen the best response.0
you have two unknows..you can't use the definition
 one year ago

ParthKohliBest ResponseYou've already chosen the best response.3
I'd show you all of it in one post.
 one year ago

ParthKohliBest ResponseYou've already chosen the best response.3
The 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
 one year ago

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

lgbasalloteBest ResponseYou've already chosen the best response.0
but the question you refuse to answer is... how do you get those values???
 one year ago

lgbasalloteBest ResponseYou've already chosen the best response.0
1and 1..you can't pull them out of nowhere
 one year ago

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

lgbasalloteBest ResponseYou've already chosen the best response.0
i'm not asking about the definition! i'm asking about your numbers
 one year ago

ParthKohliBest ResponseYou've already chosen the best response.3
Oh, and you have to try and test in the Euclidean Algorithm too.
 one year ago

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

lgbasalloteBest ResponseYou've already chosen the best response.0
so you're wrong by *my* answer
 one year ago

lgbasalloteBest ResponseYou've already chosen the best response.0
2 mod 3 should be 4 not 1
 one year ago

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

ParthKohliBest ResponseYou've already chosen the best response.3
Yes. Would you like a machine to answer it for you?
 one year ago

lgbasalloteBest ResponseYou've already chosen the best response.0
or...you can just watch more khanacademy videos....
 one year ago

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

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

lgbasalloteBest ResponseYou've already chosen the best response.0
you don't really get what my question was...do you....
 one year ago

ParthKohliBest ResponseYou've already chosen the best response.3
Though I have to admit, I forgot the above too...
 one year ago

ParthKohliBest ResponseYou've already chosen the best response.3
\[\rm \large 3\cdot(4)+1 = 11 \]Right?
 one year ago

ParthKohliBest ResponseYou've already chosen the best response.3
\[11\mod3\equiv 1\]But also...
 one year ago

ParthKohliBest ResponseYou've already chosen the best response.3
\[\rm \large 3\cdot(5) + 4 = 11\]
 one year ago

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

ParthKohliBest ResponseYou've already chosen the best response.3
You're welcome. @lgbasallote
 one year ago

lgbasalloteBest ResponseYou've already chosen the best response.0
that was *not* what i was asking
 one year ago

ParthKohliBest ResponseYou've already chosen the best response.3
You're welcome anyway. I'm glad I could be of help.
 one year ago

lgbasalloteBest ResponseYou've already chosen the best response.0
i 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...
 one year ago

ParthKohliBest ResponseYou've already chosen the best response.3
Sorry, if it was modulo, then it's just the remainder.
 one year ago
See more questions >>>
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.