Question 642 marksHard
A coding contest uses two hidden test sets:
Prove that and , and hence decide whether .
Confirming your payment
Competency-Based Questions (CBQ) · Question 64 of 80
A coding contest uses two hidden test sets:
Prove that and , and hence decide whether .
is empty. If divides , write with .
So a multiple of never leaves remainder on division by . Hence .
is empty. Let with .
So a perfect square never leaves remainder on division by . Hence .
Conclusion. Both sets have no elements. There is only one empty set, so , and the two test sets are equal.