Question:
Let $x$ and $y$ be two natural numbers such that $xy = 12(x + y)$ and $x \le y$. Then the total number of pairs $(x, y)$ is
Let $x$ and $y$ be two natural numbers such that $xy = 12(x + y)$ and $x \le y$. Then the total number of pairs $(x, y)$ is
Updated On: May 27, 2024
- 8
- 6
- 4
- 16
Hide Solution
Verified By Collegedunia
The Correct Option is A
Solution and Explanation
$xy - 12x - 12y = 0 $
$\Rightarrow (x - 12) (y - 12) = 144$.
Now $144$ can be factorised into two factors
$x$ and $y$ where $x \le y$ and the factors are
$(1, 144), (2, 72), (3, 48), (4, 36), (6, 24), (8, 18), (9, 16), (12, 12)$.
Thus there are eight solutions.
Was this answer helpful?
0
1
Top Questions on Relations
- Let \( R \) be a relation on \( \mathbb{Z} \times \mathbb{Z} \) defined by \((a, b) R (c, d)\) if and only if \(ad - bc\) is divisible by 5.
Then \( R \) is: - Let S = {1,2,3,..., 20}, R1 = {(a, b): a divide b}, R2 = {(a, b): a is integral multiple of b} and a, b ∈ S. n(R1 - R2) = ?
- A = {1, 2, 3, 4} , R = {(1, 2), (2, 3), (2, 4)} R ⊆ S and S is an equivalence relation then the minimum number of elements to be added to R is n, then the value of n is?
- If \(A = {1, 2, 3, … 100}\), \(R = {(x, y) | 2x = 3y, x, y ∈ A}\) is symmetric relation on \(A\) and the number of elements in \(R\) is \(n\), the smallest integer value of \(n\) is
- A = {1, 2, 3, 4} minimum number of elements added to make an equivalence relation on set A containing (1, 3) & (1, 2) in it.
View More Questions
Questions Asked in BITSAT exam
- Minimum value of 5cos(2x) + 5sin(2x)
- BITSAT - 2023
- Trigonometric Functions
- Two capacitors, of capacitance C, are connected in series. If one of them is filled with a dielectric substance K, what is the effective capacitance?
- BITSAT - 2023
- electrostatic potential and capacitance
- What is the dimension of the Gravitational constant?
- BITSAT - 2023
- Gravitation
NaOH is deliquescent
- BITSAT - 2023
- States of matter
- The freezing point of the 0.05 molal solution of non - electrolyte in water is? (kf = 1.86)
- BITSAT - 2023
- Solutions
View More Questions
Concepts Used:
Relations
A relation in mathematics defines the relationship between two different sets of information. If two sets are considered, the relation between them will be established if there is a connection between the elements of two or more non-empty sets. Therefore, we can say, ‘A set of ordered pairs is defined as a relation.’
Read Also: Relation and Function
Types of Relations:
There are 8 main types of relations which are:
- Empty Relation - An empty relation is one in which there is no relation between any elements of a set.
- Universal Relation - A universal is a type of relation in which every element of a set is related to each other. Now one of the universal relations will be R = {x, y} where, |x – y| ≥ 0. For universal relation, R = A × A
- Identity Relation - In an identity relation, every element of a set is related to itself only. For example, in a set A = {a, b, c}, the identity relation will be I = {a, a}, {b, b}, {c, c}.
- Inverse Relation - It is seen when a set has elements which are inverse pairs of another set. For example if set A = {(a, b), (c, d)}, then inverse relation will be R-1 = {(b, a), (d, c)}.
- Reflexive Relation - If every element of set A maps for itself, then set A is known as a reflexive relation.It is represented as a∈ A, (a,a) ∈ R.
- Symmetric Relation - A relation R on a set A is known as asymmetric relation if (a, b) ∈R then (b, a) ∈R , such that for all a and b ∈A.
- Transitive Relation - For transitive relation, if (x, y) ∈ R, (y, z) ∈ R, then (x, z) ∈ R. For a transitive relation, aRb and bRc ⇒ aRc ∀ a, b, c ∈ A
- Equivalence Relation - If a relation is reflexive, symmetric and transitive at the same time it is known as an equivalence relation.
Representation of Relations:
There are two ways by which a relation can be represented-
- Roster method
- Set-builder method
The roster form and set-builder for for a set integers lying between -2 and 3 will be-
Roster form
I= {-1,0,1,2}
Set-builder form
I= {x:x∈I,-2<x<3}