Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #!/usr/bin/env python
- # Problem Set 1
- # Name: Tony Baldwin
- # Collaborators: 0
- # Time: (start 4pm Sat 20110903 / end ??)
- from math import *
- n = input("Please enter a number: ")
- primes = [2]
- logs = [0.301029995664]
- q = 3
- while q < n:
- for i in primes:
- if q % i == 0:
- break
- else:
- l = log10(q)
- primes.append(q)
- logs.append(l)
- q += 2
- slog = reduce(lambda y,x: x+y, logs)
- print("The sum of the logs of the prime numbers less than or equal to %s is %s." % (n, slog))
- rat =(slog / n)
- print("The ratio of these values is %s / %s, which is equal to %s." % (slog, n, rat))
- print("Have a nice day.")
- exit
Advertisement
Add Comment
Please, Sign In to add comment