Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

Added the Code to Print Lucas Series Upto N terms #57

Open
wants to merge 1 commit into
base: main
Choose a base branch
from
Open

Added the Code to Print Lucas Series Upto N terms #57

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
31 changes: 31 additions & 0 deletions Print Lucas Series Upto N terms.cpp
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,31 @@
/*The Lucas series is an integer series very similar to the Fibonacci series, named after the French mathematician François Édouard Anatole Lucas. Each term of the Lucas series is defined as the sum of the previous two terms of the series with the first two terms being 2 and 1 respectively. The Lucas series and Fibonacci series are complementary to each other. Given below is the code to find the Terms of the Lucas series up to n iterations.*/
/*Program to print the Lucas series for n terms.*/

#include <iostream>
using namespace std;

int main()
{
int n, i, t1 = 2, t2 = 1, tn;
cout << "Enter the number of terms desired in the lucas series: ";
cin >> n;

if (n == 1)
cout << endl << 2 << endl;
else if (n == 2)
cout << endl << 2 << endl << 1 << endl;
else if (n > 2)
{
cout <<endl<<"Lucas series for "<< n<< " terms is:"<<endl<< t1 << endl << t2 << endl;
for (i = 0; i < n-2; i++)
{
tn = t1 + t2;
cout << tn << endl;
t1 = t2;
t2 = tn;

}
}

return 0;
}