|
Un article trouvé pour ce sujet.
 |
|
|
|
|
|
|
|
|
U(n+1) = 2Un + 1 |
2011-05-22 |
|
Cillian pose la question :
In a certain sequence, to get from one term to the other you multiply by 2 and add 1, i.e. This is a difference equation of form: U(n+1) = 2Un + 1. prove that there is a maximum of 2 perfect squares in this sequence
Claude Tardif lui répond. |
|
|
|
