Basic Python Syntax Week3

9 10 11 12 13 14 def nand(bool1, bool2): """ Take two Boolean values bool1 and bool2 and return the specified Boolean values """ if bool1: if bool2: return False else : return True else : return True Which Boolean expression below is logically equivalent to the function call nand(bool1, bool2) nand(bool1, bool2) where bool1 bool1 and bool2 bool2 are Boolean variables? 1 / 1 point not (bool1 or bool2) not (bool1 or bool2) (bool1 or bool2) (bool1 or bool2) (bool1 and bool2) (bool1 and bool2) not (bool1 and bool2) not (bool1 and bool2) Correct Correct. The function name nand nand should have been a give away since it is short for "not and". 7. Question 7 The Collatz conjecture is an example of a simple computational process whose behavior is so unpredictable that the world's best mathematicians still don't understand it. Consider the simple function ( ) � � f ( n ) (as defined in the Wikipedia page above) that takes an integer � n and divides it by two if � n is even and multiplies � n by 33 and then adds one to the result if � n is odd. The conjecture involves studying the value of expressions of the form ( ( (... ( ( ))))) � � � � � � f ( f ( f (... f ( f ( n ))))) as the number of calls to the function � f increases. The conjecture is that, for any non-negative integer � n , repeated application of � f to � n yields a sequence of integers that always includes 11 . Your task for this question is to implement the Collatz function � f in Python. The key to your implementation is to build a test that determines whether � n is even or odd by checking whether the remainder when � n is divided by 22 is either zero or one. Hint : You can compute this remainder in Python using the remainder opertor % % via the expression n % 2 n % 2 . Note you will also need to use integer division // // when computing � f .