![]() |
Generalized Pell Numbers
Hi,
I've tried to extend the Pell numbers, based on one of their definition. In the document: [URL=http://tony.reix.free.fr/Mersenne/GeneralizedPellNumbers.pdf]Generalized Pell Numbers (GPN)[/URL] , I describe how I proceeded and which properties I've found. But I don't provide proofs. It seems there are nice properties dealing with (GPN) modulo a prime number. At least, if you want to find a way for computing: 1 + m^(1/m) , lets have a look. (not sure computing 1+m^(1/m) may be useful :smile: ). If you find new properties or proofs, please let me know. Regards, Tony |
| All times are UTC. The time now is 01:40. |
Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2021, Jelsoft Enterprises Ltd.