## Fibonacci series

Create the Program to find the Fibonacci series of nth number
``````#include<stdio.h>
#include<conio.h>
void main()
{
int n1=0,n2=1,n3,i,number;
printf("Enter the number of elements:");
scanf("%d",&number);
printf("\n%d %d",n1,n2);//printing 0 and 1
for(i=2;i<number;++i)//loop starts from 2 because 0 and 1 are already printed
{
n3=n1+n2;
printf(" %d",n3);
n1=n2;
n2=n3;
}
getch();
}
``````

## Output

Enter the elements: 5

0 1 1 2 3
{"ft_lang_label":"__label__en","ft_lang_prob":0.61627305,"math_prob":0.97921026,"size":452,"snap":"2023-40-2023-50","text_gpt3_token_len":155,"char_repetition_ratio":0.12053572,"word_repetition_ratio":0.0,"special_character_ratio":0.36504424,"punctuation_ratio":0.20535715,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.99684715,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2023-09-24T06:47:11Z\",\"WARC-Record-ID\":\"<urn:uuid:459b24a5-82ba-4a4e-81b3-b417a1201069>\",\"Content-Length\":\"249356\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:4ebb9da3-7306-4c2f-a3b7-812100367c60>\",\"WARC-Concurrent-To\":\"<urn:uuid:0de8bea0-a667-4a45-ad34-b0461d9ef652>\",\"WARC-IP-Address\":\"45.84.207.183\",\"WARC-Target-URI\":\"https://nielitbhu.com/program-to-find-the-fibonacci-series-of-nth-number/\",\"WARC-Payload-Digest\":\"sha1:FJOSYUCRKP62OOA562PUD73S45HDDP7K\",\"WARC-Block-Digest\":\"sha1:WPK6BXLD33JUIPVNWWVSU7OG4XQNJTSI\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2023/CC-MAIN-2023-40/CC-MAIN-2023-40_segments_1695233506623.27_warc_CC-MAIN-20230924055210-20230924085210-00431.warc.gz\"}"}