Geometry
3. In the course, we mentioned that the problem of deciding whether a given positive integer n is prime is solvable in polynomial time but that the proof is highly nontrivial. This is based on the as-sumption that n is given in base 2, i.e. as a binary string. In this problem, we will see that primality has a much simpler al-gorithm, if we change the base in which we represent n; so, the complexity of a problem does depend on how we represent the input.
SAMPLE ASSIGNMENT
