Fibonacci Member

Level EASY

Given a number N, figure out if it is a member of fibonacci series or not. Return true if the number is member of fibonacci series else false.

Fibonacci Series is defined by the recurrence

    F(n) = F(n-1) + F(n-2)

where F(0) = 0 and F(1) = 1

Input Format :

Integer N

Output Format :

true or false

Constraints :

0 <= n <= 10^4

Sample Input 1 :

5

Sample Output 1 :

true

Sample Input 2 :

14

Sample Output 2 :

false 

	import math
	def isPerfectSquare(x):
	s = int(math.sqrt(x))
	return s * s == x
	def isFibonacci(n):
	return isPerfectSquare(5 * n * n + 4) or isPerfectSquare(5 * n * n - 4)
	num=int(input())
	if isFibonacci(num)==True:
	print("true")
	else:print("false")

view raw Fibonacci Member.py hosted with ❤ by GitHub