Fibonacci Entry Point (FEP)

Правка en1, от prathams, 2017-10-09 01:05:33

How to calculate the fibonacci entry point for N numbers p1, p2, p3, ...., pn.(1 <  = pi <  = 109)

FEP(pi) = j such that jth fibonacci number is the first fibonacci number Fj divisible by pi

How can we find it efficiently for N numbers.

Ex,
input = 2, output = 3
input = 5, output = 5
input = 13, output = 7

Теги math, fibonaaci, primes

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en2 Английский prathams 2017-10-09 08:31:00 2 Tiny change: '3,....,p_n. (1 <= p_i ' -> '3,....,p_n$. $(1 <= p_i '
en1 Английский prathams 2017-10-09 01:05:33 380 Initial revision (published)