8) Show that for any k, 2 k (mod 3) ≡ 1 if k is even, 2 if k isodd
and use this to suggest an algorithm for checking divisibilityby base 2. Estimate its complexity.
9) What is the complexity of checking for divisibility by 3 inbase 3?
Is anyone know answers for these two questions?
Expert Answer
An answer will be send to you shortly. . . . .