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.
Let $$x$$ and $$y$$ be distinct integers where $$1 \le x \le 25$$ and $$1 \le y \le 25$$. Then, the number of ways of choosing $$x$$ and $$y$$, such that $$x+y$$ is divisible by 5, is ____________.
Step 1: Count ordered pairs (x,y) from 1–25 by residues modulo 5. There are five numbers of each residue class.
Step 2: Residue pairs summing to 0 mod 5 are (0,0),(1,4),(4,1),(2,3),(3,2). The (0,0) case has 5·4=20 ordered pairs because x≠y; each other case has 5·5=25.
Step 3: Total=20+4·25=120.
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.