Free Practice Question
PS · Problem Solving
705-805
Divisibility/Multiples/Factors
What is the highest integer k for which perfectly divides ?
Answer Choices
Correct answer marked belowA
97
B
49
C
40
32
Correct
E
1
See the full step-by-step explanation
You can see the correct answer above. Sign in for free to unlock the complete worked solution.
Track your performance and improve
Get detailed analytics, unlock full explanations, and move up difficulty tiers as you practice.
Explanation
Preview
Official Explanation
Official
The highest power of k in that perfectly divides .
on prime factorisation gives .
We have to look for powers of 3, since occurs at a much lower repetition than 5.…
on prime factorisation gives .
We have to look for powers of 3, since occurs at a much lower repetition than 5.…
Read the full explanation
Sign in for free to see the complete step-by-step solution to this question.
Comments
Sign in to join the discussion
No comments yet
Be the first to share your thoughts and help others understand it better.
Sign in to commentWhat this question tests
What it tests
Your understanding of divisibility rules, least common multiples, and greatest common factors.
Common trap
Forgetting that 1 is not prime and that every integer divides 0.
Details
Difficulty
705-805
Type
PS
Category