Euler #87

How many numbers below fifty million can be expressed as the sum of a prime square, prime cube, and prime fourth power?

	#!/usr/bin/env python
	from libeuler import primes
	if __name__ == '__main__':
	p = primes(7100)
	res = set()
	for s in p:
	for c in p:
	for q in p:
	n = s*s + c*c*c + q*q*q*q
	if n < 50000000:
	res.add(n)
	print len(res)

view raw euler87.py hosted with ❤ by GitHub