Got Homework?
Connect with other students for help. It's a free community.
Here's the question you clicked on:
 0 viewing
lgbasallote
Group Title
if a = 11 and b = 3
then what is
a div b
and
a mod b
 2 years ago
 2 years ago
lgbasallote Group Title
if a = 11 and b = 3 then what is a div b and a mod b
 2 years ago
 2 years ago

This Question is Closed

lgbasallote Group TitleBest ResponseYou've already chosen the best response.0
yes mod
 2 years ago

bahrom7893 Group TitleBest ResponseYou've already chosen the best response.0
mod is 2
 2 years ago

bahrom7893 Group TitleBest ResponseYou've already chosen the best response.0
idk what div is.
 2 years ago

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

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

ParthKohli Group TitleBest ResponseYou've already chosen the best response.3
Hmm... mod is 1.
 2 years ago

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

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

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

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

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

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

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

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

bahrom7893 Group TitleBest 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.
 2 years ago

lgbasallote Group TitleBest ResponseYou've already chosen the best response.0
it is...
 2 years ago

ParthKohli Group TitleBest ResponseYou've already chosen the best response.3
Yes, that's what...
 2 years ago

jiteshmeghwal9 Group TitleBest 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
 2 years ago

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

lgbasallote Group TitleBest ResponseYou've already chosen the best response.0
so then...?
 2 years ago

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

jiteshmeghwal9 Group TitleBest ResponseYou've already chosen the best response.0
11/3*
 2 years ago

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

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

jiteshmeghwal9 Group TitleBest ResponseYou've already chosen the best response.0
ohh ok !
 2 years ago

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

bahrom7893 Group TitleBest ResponseYou've already chosen the best response.0
Mod is 2
 2 years ago

lgbasallote Group TitleBest ResponseYou've already chosen the best response.0
i agree..
 2 years ago

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

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

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

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

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

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

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

lgbasallote Group TitleBest ResponseYou've already chosen the best response.0
2 mod 3 is 2...
 2 years ago

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

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

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

lgbasallote Group TitleBest 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
 2 years ago

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

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

lgbasallote Group TitleBest ResponseYou've already chosen the best response.0
of course
 2 years ago

lgbasallote Group TitleBest ResponseYou've already chosen the best response.0
do you?
 2 years ago

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

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

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

ParthKohli Group TitleBest 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.
 2 years ago

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

lgbasallote Group TitleBest ResponseYou've already chosen the best response.0
b is n/a
 2 years ago

ParthKohli Group TitleBest 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\]
 2 years ago

ParthKohli Group TitleBest 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\]
 2 years ago

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

lgbasallote Group TitleBest ResponseYou've already chosen the best response.0
how is b = 1?
 2 years ago

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

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

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

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

ParthKohli Group TitleBest ResponseYou've already chosen the best response.3
I just did...
 2 years ago

lgbasallote Group TitleBest 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
 2 years ago

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

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

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

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

ParthKohli Group TitleBest 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
 2 years ago

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

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

ParthKohli Group TitleBest ResponseYou've already chosen the best response.3
What values?
 2 years ago

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

ParthKohli Group TitleBest 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.
 2 years ago

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

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

lgbasallote Group TitleBest 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
 2 years ago

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

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

ParthKohli Group TitleBest ResponseYou've already chosen the best response.3
Yes, it's also 4.
 2 years ago

lgbasallote Group TitleBest ResponseYou've already chosen the best response.0
...........
 2 years ago

lgbasallote Group TitleBest ResponseYou've already chosen the best response.0
no it isn't
 2 years ago

lgbasallote Group TitleBest ResponseYou've already chosen the best response.0
2 mod 3 is 1
 2 years ago

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

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

lgbasallote Group TitleBest ResponseYou've already chosen the best response.0
try wolfram
 2 years ago

lgbasallote Group TitleBest ResponseYou've already chosen the best response.0
you'll see it's 1
 2 years ago

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

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

ParthKohli Group TitleBest 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\]
 2 years ago

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

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

ParthKohli Group TitleBest ResponseYou've already chosen the best response.3
11 mod 3
 2 years ago

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

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

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

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

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

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

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

lgbasallote Group TitleBest 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...
 2 years ago

ParthKohli Group TitleBest 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.