1. Suppose there is a point x in the middle of my block ofcheese, and all of my n straight planar cuts must go through asingle common point x. Then the number of pieces is smaller thanthe number without that restriction, but is still a cubicpolynomial in n.
2. Suppose that a and b are each powers of 2, with a > b.Then the Euclidean Algorithm, on inputs a and b, will terminateafter at most log2 a steps.
3.
Recall that F(n) is the Fibonacci functiondefined by F(0) = 0, F(1) = 1, and F(n+1) = F(n) + F(n-1).
If I start the Euclidean Algorithm with inputs F(n+3) and F(n),for any n, it will terminate after about n/3 steps.
4. If we start the EA with any two three-digit numbers, it willfinish with at most twelve divisions.
T or F questions TY :)
