Explore the Mathbee Test Series with free chapter PYQs, NTA-style Booster mocks, paid shift-wise PYPs and focused performance analytics.
Paste your question to our Mathbee AI Mentor below to get an instant step-by-step solution.
Step 1: Statement I defines congruence modulo the integers: $y-x\in\mathbb Z$. It is reflexive since $x-x=0$, symmetric since the negative of an integer is an integer, and transitive since sums of integers are integers.
Step 2: Statement II uses $x=\alpha y$ for some rational $\alpha$. It is not symmetric: $0=0\cdot1$ holds, while $1=\alpha\cdot0$ has no solution.
Step 3: Statement I is true and Statement II is false, option B.
Confused by the solution? Ask the AI to explain a specific step, tell you where you went wrong, or break down the key trap in this question.
Explore the Mathbee Test Series with free chapter PYQs, NTA-style Booster mocks, paid shift-wise PYPs and focused performance analytics.