gio

  4 # Problem Set 2
  5 # Problem #1
  6 # Gio
  7 #
  8 def mcnugget(n):
  9     a = 6
 10     b = 9
 11     c = 20
 12     for x in range(0, n):
 13         for y in range(0, n):
 14             for z in range(0, n):
 15                     if a*x + b*y + c*z == n:
 16                         #print x, y, z
 17                         return True
 18     return False
 19 
 20 #print mcnugget(50)
 21 
 22 
 23 #Problem 3
 24 def largest_mcnugget():
 25     n = 1
 26     while n < 100:
 27         if not mcnugget(n):
 28             new_n = n
 29         n += 1
 30     print 'Largest number of McNuggets that cannot be bought in exact quantity: %d' % new_n
 31 
 32 largest_mcnugget()

#########################################

 13 # Problem Set 2
 14 # Problem 4
 15 # Gio
 16 packages = (5, 11, 19)
 17 
 18 def mcnuggets(n):
 19     a = packages[0]
 20     b = packages[1]
 21     c = packages[2]
 22     for x in range(0, n):
 23         for y in range(0, n):
 24             for z in range(0, n):
 25                 if a*x + b*y + c*z == n:
 26                    # print x, y, z
 27                     return True
 28     return False
 29 
 30 #print mcnuggets(55)
 31 
 32 # Problem 3
 33 def largest_mcnuggets():
 34    # bestSoFar = 0
 35     for n in range(1, 200):
 36         if not mcnuggets(n):
 37             bestSoFar = n
 38     print 'Given package sizes %r, %r, and %r, the largest number of McNuggets\nThat cannot be bought in exact quantity is: %r' % (packages[0], packages[1], packages[2], bestSoFar)
 39 
 40 largest_mcnuggets()

# Problem set #1
# Problem #1
# Gio
import math

def is_prime(n):
    n = float(n)
    if n%2 == 0 and n != 2:
        return False
    for x in range(2, int(math.sqrt(n)) +1):
        if n%x == 0:
            return False
    return True
            
def nth_prime(n):
    i = 0
    num = 1
    while i < n:
        num += 1
        if is_prime(num):
            i += 1
    print num

nth_prime(1000)

############################

# Problem Set #1
# Problem 2
# Gio
import math

def is_prime(n):
    n = float(n)
    if n%2 == 0 and n != 2:
        return False
    for i in range(2, int(math.sqrt(n) +1)):
        if n%i == 0:
            return False
    return True

def log_prime(n):
    i = 0
    num = 1
    sum_log_prime = 0
    while i < n:
        num += 1
        if is_prime(num):
            sum_log_prime = sum_log_prime + math.log(num)
            i += 1
    print 'Sum:',sum_log_prime,'Prime number:',num,'Ratio:',num/sum_log_prime

log_prime(100)

# Problem Set 0
# Name Gio

last = raw_input('Enter your last name: ')
first = raw_input('Enter your first name: ')

print first
print last