""" Homework 1
-- Due Sunday, Sept. 6th at 11:59pm
-- Always write the final code yourself
-- Never use a library function that solves the problem
-- If you collaborated with a peer, mention them
-- Cite any websites you referenced
-- Use the PEP-8 checker for full style points:
https://pypi.python.org/pypi/pep8
"""
from __future__ import absolute_import, division, print_function
def fizzbuzz(n):
""" If n is divisible by 3, return "Fizz"
If n is divisible by 5, return "Buzz"
If n is divisible by 3 and 5, return "FizzBuzz"
Else, return the empty string.
"""
pass
def int_or_float(n):
""" If n is (an instance of) the type int, return "int"
If n is a float, return "float"
Else, return "other".
"""
def xor(x, y):
""" Return the exclusive-or of x and y
"""
pass
def big_xor(li):
""" Compute the XOR of a list of booleans.
Use the XOR function you defined above.
"""
pass
def positive_product(li):
""" Return the product of all of the (nonzero) positive numbers
in the list li.
"""
pass
def is_prime(n):
""" Return True if n is prime and False otherwise.
Use this function to help write 'nth_prime' below.
"""
pass
def nth_prime(n):
""" Return the nth prime number.
"""
pass
def fib_rec(n):
""" A recursive function that calculates the nth Fibonacci number.
By convention we will say that the 1st Fibonacci number is 0
and the 2nd Fibonacci number is 1.
"""
pass
def fib_iter(n):
""" An iterative function that calculates the nth Fibonacci number.
"""
pass
def main():
pass
if __name__ == "__main__":
""" Runs main() if we run this file with 'python hw1.py'. """
main()