Maths
Get insights from 6.5k questions on Maths, answered by students, alumni, and experts. You may also ask and answer any question you like about Maths
Follow Ask QuestionQuestions
Discussions
Active Users
Followers
New answer posted
a year agoContributor-Level 10
The binary operation *′ on the set {1, 2, 3 4, 5} is defined as a *′ b = H.C.F of a and b.
The operation table for the operation *′ can be given as:
*′ | 1 | 2 | 3 | 4 | 5 |
1 | 1 | 1 | 1 | 1 | 1 |
2 | 1 | 2 | 1 | 2 | 1 |
3 | 1 | 1 | 3 | 1 | 1 |
4 | 1 | 2 | 1 | 4 | 1 |
5 | 1 | 1 | 1 | 1 | 5 |
We observe that the operation tables for the operations * and *′ are the same.
Thus, the operation *′ is same as the operation*.
New answer posted
a year agoContributor-Level 10
(i) (2 * 3) * 4 = 1 * 4 = 1
2 * (3 * 4) = 2 * 1 = 1
(ii) For every a, b ∈ {1, 2, 3, 4, 5}, we have a * b = b * a. Therefore, the operation * is commutative.
(iii) (2 * 3) = 1 and (4 * 5) = 1
∴ (2 * 3) * (4 * 5) = 1 * 1 = 1
New question posted
a year agoNew answer posted
a year agoContributor-Level 10
The binary operation? on the set {1, 2, 3, 4, 5} is defined as a? b = min {a, b} &mn For E; a, b? {1, 2, 3, 4, 5}.
Thus, the operation table for the given operation? can be given as:
? | 1 | 2 | 3 | 4 | 5 |
1 | 1 | 1 | 1 | 1 | 1 |
2 | 1 | 2 | 2 | 2 | 2 |
3 | 1 | 2 | 3 | 3 | 3 |
4 | 1 | 2 | 3 | 4 | 4 |
5 | 1 | 2 | 3 | 4 | 5 |
New answer posted
a year agoContributor-Level 10
(i) On Z, * is defined by a * b = a − b.
It can be observed that 1 * 2 = 1 − 2 = 1 and 2 * 1 = 2 − 1 = 1.
∴1 * 2 ≠ 2 * 1; where 1, 2 ∈ Z
Hence, the operation * is not commutative.
Also we have:
(1 * 2) * 3 = (1 − 2) * 3 = −1 * 3 = −1 − 3 = −4
1 * (2 * 3) = 1 * (2 − 3) = 1 * −1 = 1 − (−1) = 2
∴(1 * 2) * 3 ≠ 1 * (2 * 3) ; where 1, 2, 3 ∈ Z
Hence, the operation * is not associative.
(ii) On Q, * is defined by a * b = ab + 1.
It is known that:
ab = ba & mn For E; a, b ∈ Q
⇒ ab + 1 = ba&nb
New answer posted
a year agoContributor-Level 10
(i) On Z+, * is defined by a * b = a − b.
It is not a binary operation as the image of (1, 2) under * is 1 * 2 = 1 − 2= −1 ∉ Z+.
(ii) On Z+, * is defined by a * b = ab.
It is seen that for each a, b ∈ Z+, there is a unique element ab in Z+.
This means that * carries each pair (a, b) to a unique element a * b = ab in Z+.
Therefore, * is a binary operation.
(iii) On R, * is defined by a * b = ab2.
It is seen that for each a, b ∈ R, there is a unique element ab2 in R.
This means that * carries each pair (a, b) to a unique element a * b = ab2 in R.
Therefore, * is a binary operation.
(iv) On Z+, * is defined by a * b = |a −
New answer posted
a year agoContributor-Level 10
55. We have (k - 3) x - (4 - k2) y + k2 - 7 y + 6 = 0.
(i) When the line is parall to x-axis, all x coefficient = 0. then,
(k - 3)x - (4 -k2)y + k2 - 7y + 6 = 0 x.x - a x y where a = constant
Equating the co-efficient,
K – 3 = 0
=> k = 3
(ii) When the line is parallel to y-axis all y co-efficient = 0 then
- (4 -k)2 = 0
=> – 4 + x2 = 0
k2 = 4
k = ± 2.
(iii) When the line pares through origin, (0, 0) need satisfy the given eqn then,
k2 - 7k + 6 = 0
k2 - k – 6k + 6 = 0
k (k- 1) - 6 (k - 1) = 0
(k = 1) (k - 6) = 0
k = 1 and k = 6
New answer posted
a year agoContributor-Level 10
It is given that is defined as
Let y be an arbitrary element of Range f.
Then, there exists such that
let us define g: Range
Thus, g is the inverse of f i.e.,
Hence, the inverse of f is the map g: Range which is given by
The correct answer is B.
New answer posted
a year agoContributor-Level 10
Let f: X → Y be an invertible function.
Then, there exists a function g: Y → X such that gof = IX and fog = IY.
Here, f−1 = g.
Now, gof = IX and fog = IY
⇒ f−1 of = IX and fof−1 = IY
Hence, f−1 : Y → X is invertible and f is the inverse of f−1
i.e., (f−1)−1 = f.
Taking an Exam? Selecting a College?
Get authentic answers from experts, students and alumni that you won't find anywhere else
Sign Up on ShikshaOn Shiksha, get access to
- 66k Colleges
- 1.2k Exams
- 712k Reviews
- 1850k Answers
