Powers of Two Divisibility
CAT 2019 Slot 1 · Quantitative Ability · Hard · Number Theory
This is a hard Quantitative Ability question from the CAT 2019 Slot 1 paper. It tests Number Theory. The full answer key and a step-by-step explanation are below — try it yourself first, then reveal the solution.
The number of integers such that , and is perfectly divisible by either 3 or 4, is
Answer
5
Explanation
for integer . Possible integer values of : . Test values:
- : (not integer)
- : (divisible by 3) - Yes
- : (divisible by 4) - Yes
- : (divisible by 3) - Yes
- : (not div by 3 or 4)
- : (divisible by 3) - Yes
- : (not div by 3 or 4)
- : (divisible by 3) - Yes
- : (not div by 3 or 4) Satisfying values: . Total = 5.
Related Number Theory questions
- #293Smallest possible value of a + b + cCATQAMCQMedium
- #510Minimizing Sum of Squares of FactorsCATQATITAEasy
- #514Ascending Order Numbers FormationCATQATITAHard
- #5583x3 Magic Square Grid EntryCATQATITAEasy
- #578Sum of Squares of Consecutive IntegersCATQAMCQHard
- #585Positive Integer Solutions to Reciprocal EquationCATQATITAHard
- #1297Highest possible 4-digit numberCATQATITAMedium
- #1300Number of integer values of expressionCATQATITAHard
Practise this under exam conditions
Sign in to solve it with a live timer, the on-screen CAT calculator, and streak and accuracy tracking across every question you attempt.
Solve in the workspace