Join the QuestionCove community and study together with friends!
Sign Up
OpenStudy (anonymous):
Let it be the sets A = {0, 1, 2, 3, 4} and B = {0, 1, 2, 3}. Write the list of ordered pairs belonging relation R from A to B as defined in the (a,b)E R , if and only if:
d) a | b
e) cmmdc(a,b) = 1
f) cmmmc(a,b) = 2.
OpenStudy (anonymous):
If a|b then b|a =>a!=0 IS THIS CORRECT ?!
OpenStudy (anonymous):
@ganeshie8 ?
OpenStudy (anonymous):
asked for order pair so you don't need to get a formula.
(0,1)(0,2)(0,3)(1,1)(2,1)(2,2)(3,1)(3,3).
OpenStudy (anonymous):
??
@ganeshie8 any idea
Still Need Help?
Join the QuestionCove community and study together with friends!
Sign Up
ganeshie8 (ganeshie8):
whats `cmmdc(a,b)` ?
OpenStudy (anonymous):
Greatest common divisor
OpenStudy (anonymous):
and cmmmc is least common multiple
ganeshie8 (ganeshie8):
for part a, use below :
1) \(n~ | ~0\) `every number divides 0`
2) \(1 ~|~ n\) `1 divides every number`
3) \(n~|~n\) `every number divides itself`
OpenStudy (anonymous):
If a|b then b/a=integer =>a!=0
Still Need Help?
Join the QuestionCove community and study together with friends!
Sign Up
ganeshie8 (ganeshie8):
A = {0, 1, 2, 3, 4} and B = {0, 1, 2, 3}.
yes you're right, i think we don't want to divide by 0, start with 1 :
since we know that 1 divides every number, we get below ordered pairs in relation :
(1,0), (1,1), (1,2),),(1,3)
ganeshie8 (ganeshie8):
next see what numbers are divisible by 2 :
(2,0), (2, 2)
ganeshie8 (ganeshie8):
for numbers divisible by 3 you get :
(3,0), (3,3)
ganeshie8 (ganeshie8):
for numbers divisible by 4 you get :
(4, 0)
ganeshie8 (ganeshie8):
Overall below ordered pairs should satisfy part a :
```
(1,0), (1,1), (1,2),),(1,3)
(2,0), (2, 2)
(3,0), (3,3)
(4, 0)
```
Still Need Help?
Join the QuestionCove community and study together with friends!
Sign Up
ganeshie8 (ganeshie8):
check if we missed any ..
OpenStudy (anonymous):
thx ganeshie
you missed nothing
OpenStudy (anonymous):
now for gcd and lcm ?!
OpenStudy (anonymous):
gcd(a,b)=1=>{1|a and 1|b}
OpenStudy (anonymous):
@ganeshie8 is n | 0 valid?
Still Need Help?
Join the QuestionCove community and study together with friends!
Sign Up
ganeshie8 (ganeshie8):
heyy sry was afk, still here ?
ganeshie8 (ganeshie8):
@OOOPS i think so
ganeshie8 (ganeshie8):
for gcd(a,b)=1 use below :
1) gcd(n, 0) = gcd(0, n) = n
2) gcd(0, 0) = 0
3) gcd(n, n) = n
OpenStudy (anonymous):
gcd(a,b)=1
R={(0,1),(1,0),(1,1),(1,2),(1,3),(2,1),(2,3),(3,1),(3,2),(4,1),(4,2),(4,3)}
@ganeshie8 Am I right ?
ganeshie8 (ganeshie8):
(3,4)
Still Need Help?
Join the QuestionCove community and study together with friends!
Sign Up
ganeshie8 (ganeshie8):
other than that looks good!
OpenStudy (anonymous):
there's no (3,4)
OpenStudy (anonymous):
look at B set
ganeshie8 (ganeshie8):
Oops sorry yes you're right !
OpenStudy (anonymous):
gcd(4,2 )=2 why !?
Still Need Help?
Join the QuestionCove community and study together with friends!
Sign Up
OpenStudy (anonymous):
(4,2) has 2 comune divisors 1 and 2 and the greatest is 2
OpenStudy (anonymous):
@ganeshie8
ganeshie8 (ganeshie8):
so you want to find the gcd of 4 and 2
ganeshie8 (ganeshie8):
what are the divisors of 4 ?
OpenStudy (anonymous):
1,2,4
Still Need Help?
Join the QuestionCove community and study together with friends!
Sign Up
ganeshie8 (ganeshie8):
what are the divisors of 2 ?
OpenStudy (anonymous):
1,2
ganeshie8 (ganeshie8):
are there any common factors ?
OpenStudy (anonymous):
1,2
ganeshie8 (ganeshie8):
and 2 is the largest among them, yes ?
Still Need Help?
Join the QuestionCove community and study together with friends!
Sign Up
OpenStudy (anonymous):
yup
ganeshie8 (ganeshie8):
so 2 the `g`reatest `c`ommon `d`ivosor of 4 and 2
(loosely speaking)
OpenStudy (anonymous):
as for lcm(a,b)=2
R={(1,1),(1,2),(2,1),(2,2)}
OpenStudy (anonymous):
?
ganeshie8 (ganeshie8):
hows lcm(1,1) = 2 ?
Still Need Help?
Join the QuestionCove community and study together with friends!