Function fibonacci_modP

Python/CP_Templates.py:35–37 · view source on GitHub ↗

(n, MOD)

Source from the content-addressed store, hash-verified

33
34
35	def fibonacci_modP(n, MOD):
36	if n < 2: return 1
37	return (cached_fn(fibonacci_modP, (n + 1) // 2, MOD) * cached_fn(fibonacci_modP, n // 2, MOD) + cached_fn(fibonacci_modP, (n - 1) // 2, MOD) * cached_fn(fibonacci_modP, (n - 2) // 2, MOD)) % MOD
38
39
40	def factorial_modP_Wilson(n, p):

nothing calls this directly

cached_fnFunction · 0.85

no test coverage detected