Forum: Miscellaneous Math
2020-10-11, 16:58
|
|
Replies: 4
Views: 523
|
|
Forum: Miscellaneous Math
2020-10-11, 16:30
|
|
Replies: 4
Views: 523
i guess, "well known" is not true))
here, no...
i guess, "well known" is not true))
here, no mention about
http://www.maths.surrey.ac.uk/hosted-sites/R.Knott/Fibonacci/fibmaths.html#section2
and i can find 10+ links like this, and 0 link...
|
|
Forum: Miscellaneous Math
2020-10-10, 08:31
|
|
Replies: 4
Views: 523
Interesting. It is not so hard to write some...
Interesting. It is not so hard to write some simple code, like this (Pari GP)
forprime(n=11,900,x=Mod(factorint(fibonacci(n)),n);print(n,lift(x)))
and see, that posted above is true for all...
|
|
Forum: Miscellaneous Math
2020-10-09, 06:52
|
|
Replies: 4
Views: 523
Factors of Fibonacci numbers
Greetings.
The factors of Fibonacci numbers:
For prime p:
F(p)=\prod_{i=1}^{m} (k_{i}\cdot p\pm 1)
For an any n
n=p_{1}^{t1}\cdot p_{2}^{t2}\cdot...\cdot p_{k}^{tk}
F(n)=\prod_{i=1}^{m}...
|
