gistfile1.py

#Discrete Math Homework
import math

def fib_check(l):
	def is_fibonacci(n):
	    phi = 0.5 + 0.5 * math.sqrt(5.0)
	    a = phi * n
	    return n == 0 or abs(round(a) - a) < 1.0 / n
	#Check if each number in list is fibonacci
	if sorted(l) == l:
		for num in l:
			if not is_fibonacci(num):
				return False
		return True
	return False


#Tests
print fib_check([1,1])
print fib_check([1,1,2])
print fib_check([2,3,5,8])
print fib_check([1,1,2,3,5,8])
print fib_check([1,2,5,3])
print fib_check([1,2,3,4,5,6])

Discrete Math Homework

import math

def fib_check(l):
#Check if each number in list is fibonacci
for num in l:
#5_n^2 + 4 XOR 5_n^2-4 must be a perfect square
if math.sqrt(5_(num__2)+4) % 1 == 0 != math.sqrt(5_(num**2)-4) % 1 == 0:
return False
return True

Tests

print fib_check([1,1,2])
print fib_check([2,3,5,8])

l=[1,233,8,610,21]

https://gist.github.com/3808441