mersenneforum.org  

Go Back   mersenneforum.org > Search Forums

Showing results 1 to 4 of 4
Search took 0.00 seconds.
Search: Posts Made By: RMLabrador
Forum: Miscellaneous Math 2020-10-11, 16:58
Replies: 4
Views: 523
Posted By RMLabrador
Just run this in some other than Pari/GP system ...

Just run this in some other than Pari/GP system
x = 251;
c = Fibonacci[x];
(*Solve[(((a*x+c-1)/((a*x-1)*x))^(-1))-(1/b)==0&&(x*a-1)*(b*x-1)
==c,{a,b},Integers]*)
Solve[((a + b)^2 + 4*a*b*(c - 1)...
Forum: Miscellaneous Math 2020-10-11, 16:30
Replies: 4
Views: 523
Posted By RMLabrador
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
Posted By RMLabrador
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
Posted By RMLabrador
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}...
Showing results 1 to 4 of 4

 
All times are UTC. The time now is 07:49.

Thu Jan 21 07:49:07 UTC 2021 up 49 days, 4 hrs, 0 users, load averages: 1.96, 2.38, 2.25

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2021, Jelsoft Enterprises Ltd.

This forum has received and complied with 0 (zero) government requests for information.

Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published by the Free Software Foundation.
A copy of the license is included in the FAQ.