In how many ways can a pair of integers (x , a) be chosen such that ?
Correct Answer :
7
Solution :
The correct answer is 7.
We need to find all integer pairs satisfying:
Step 1 — Substitute to simplify.
Since , let where . The equation becomes:
Rearranging:
Step 2 — Find valid values of t.
Since the left side , the right side must also be non-negative:
Since and must be an integer, the only allowed non-negative integer values are .
Step 3 — Enumerate each case.
Case 1: (i.e., )
Valid pairs: → 1 pair
Case 2: (i.e., or )
Valid pairs:
For : and
For : and
→ 4 pairs
Case 3: (i.e., or )
Valid pairs:
For :
For :
→ 2 pairs
Step 4 — Total count.
All valid integer pairs:
, , , , , ,
Total =
Therefore, the number of ways to choose such a pair of integers is 7.
Access expert-curated educational resources and study materials—completely free.
Create, conduct, and manage professional online assessments with Mindyard. Perfect for teachers and institutes.
Copyright © 2026 Mindyard. All Rights Reserved.