Sign in Join
Wiki copytemporary

Lucas number/fr

English · Français · Suomi

Lucas number

La suite de Lucas est la suivante :

text
2, 1, 3, 4, 7, 11, 18, 29, 47, ...

Définie comme la suite de Fibonacci mais les premiers termes sont 2 et 1.

Méthode récursive

pascal

function LucasNumber( n : integer ): integer;
begin
  if n > 1 then 
    result := LucasNumber( n - 1 ) + LucasNumber( n - 2 )
  else
    if n = 0 then 
      result := 2
    else 
      result := 1;
end;

Emploi du nombre de Fibonacci

pascal

function LucasNumber2( n : integer ): integer;
begin
  result := FibonacciNumber( n + 1 ) + FibonacciNumber( n - 1 );
end;

From the Free Pascal wiki, page "Lucas number/fr", as it stood on 2020-02-19 after a change by Trev, out of the wiki's dump of 2024-05-26. Copyright stays with the author who wrote it, according to the old wiki's Licensing page. If you have concerns about this material, message the admin.

Revision 2, last changed by WikiArchive .

Edited on wiki.freepascal.org by 2 people, 2016–2020

From the official wiki's backup of 26 May 2024: who edited this page there, and when. Edits made there after that date were not recorded, and the earlier versions are not shown here; the main page says why.

WhenWhoWhat changed
E-ricCreated page
E-ric (minor)
TrevFixed syntax highlighting (minor)

Talk about this page

Nobody has opened a bench for this page yet. Sign in to open one.