human
Can you provide a code to fibonacci modulo p and the other steps required given the following:
Fibonacci modulo p | Returns position of first Fibonacci number whose modulo p is 0..
add previous two remainders and then take its modulo p ..
Driver code"
How can the above be solved in Python?
assistant
#Here is code to fibonacci modulo p and the other steps required.
 def findMinZero ( p ) :
	first = 1
	second = 1
	number = 2
	next = 1
	while ( next ) :
		next = ( first + second ) % p
		first = second
		second = next
		number = number + 1
	return number
if __name__ == ' _ _ main _ _ ' :
	p = 7
	print ( " Minimal ▁ zero ▁ is : " , findMinZero ( p ) )