Problem 2
Find one pair of positive integers such that is not divisible by , but is divisible by .
Step 3 of 3: Verify the divisibility
In plain words
The valuation count is transparent: one seven comes from the leading factor and six from the squared .
Detailed analysis
Substitution into the factorization gives a multiple of , and the previous step already showed that the first required product is prime to . Thus the pair solves the problem.