It looks like you're new here. If you want to get involved, click one of these buttons!

- All Categories 139.8K
- Programming Languages 104K
- Assembler Developer 6.2K
- Basic 1.8K
- C and C++ 39.7K
- C# 4.2K
- Delphi and Kylix 7.9K
- Haskell 3
- Java 9.5K
- Pascal 4.1K
- Perl 1.3K
- PHP 1.9K
- Python 500
- Ruby 47
- VB.NET 4.3K
- VBA 1.6K
- Visual Basic 20.8K
- Game programming 2.6K
- Console programming 308
- DirectX Game dev 87
- Minecraft 1
- Newbie Game Programmers 107
- Oculus Rift 2
- Applications 8.8K
- Computer Graphics 1.8K
- Computer Hardware 720
- Database & SQL 3.4K
- Electronics development 517
- Matlab 1.6K
- Sound & Music 625
- XML Development 253
- Classifieds 3.2K
- Co-operative Projects 184
- For sale 160
- FreeLance Software City 188
- Jobs Available 1.9K
- Jobs Wanted 597
- Wanted 192
- Microsoft .NET 2.8K
- ASP.NET 1.7K
- .NET General 1.1K
- Miscellaneous 2.8K
- Join the Team 2
- User Profiles 1
- Comments on this site 351
- Computer Emulators 54
- General programming 1.7K
- New programming languages 114
- Off topic board 590
- Mobile & Wireless 146
- Android 20
- Palm Pilot 124
- Multimedia 334
- Demo programming 151
- MP3 programming 183
- Bash scripts 0
- Cloud Computing 10
- FreeBSD 52
- LINUX programming 1.7K
- MS-DOS 361
- Shell scripting 0
- Windows CE & Pocket PC 317
- Windows programming 4.1K
- Software Development 870
- Algorithms 400
- Object Orientation 67
- Project Management 80
- Quality & Testing 87
- Security 230
- WEB-Development 7.3K
- Active Server Pages 1.8K
- AJAX 61
- Bootstrap Themes 1
- CGI Development 55
- ColdFusion 19
- Flash development 221
- HTML & WEB-Design 1.4K
- Internet Development 1.3K
- JavaScript 2.2K
- JQuery 33
- WEB Servers 275
- WEB-Services / SOAP 100

We have migrated to a new platform! Please note that you will need to reset your password to log in (your credentials are still in-tact though). Please contact lee@programmersheaven.com if you have questions.

Tweets by @pheaven
Welcome to the new platform of Programmer's Heaven! We apologize for the inconvenience caused, if you visited us from a broken link of the previous version. The main reason to move to a new platform is to provide more effective and collaborative experience to you all. Please feel free to experience the new platform and use its exciting features. Contact us for any issue that you need to get clarified. We are more than happy to help you.

jcherring4
Posts: **2**Member

in Java

[b][red]This message was edited by jcherring4 at 2007-3-12 2:25:42[/red][/b][hr]

Look guys i am new to this and got myself behind on this thing can i beg for some help here please help me with this program!!!!!

this is what the display should look like

1. Display the first 25 Fibonacci numbers

2. Display the first 50 Fibonacci numbers

3. Display the first 75 Fibonacci numbers

4. Display the first 125 Fibonacci numbers

5. Display the first 200 Fibonacci numbers

hit me back soon as you can please!

how pleaseeeee

help me with a starting point

read the material that i should have but cant get a start

a sample program could help if

that is not too much to ask

i am in a bind here

Look guys i am new to this and got myself behind on this thing can i beg for some help here please help me with this program!!!!!

this is what the display should look like

1. Display the first 25 Fibonacci numbers

2. Display the first 50 Fibonacci numbers

3. Display the first 75 Fibonacci numbers

4. Display the first 125 Fibonacci numbers

5. Display the first 200 Fibonacci numbers

hit me back soon as you can please!

how pleaseeeee

help me with a starting point

read the material that i should have but cant get a start

a sample program could help if

that is not too much to ask

i am in a bind here

About & Contact / Terms of use / Privacy statement / Publisher: Lars Hagelin

Programmers Heaven articles / Programmers Heaven files / Programmers Heaven uploaded content / Programmers Heaven C Sharp ebook / Operated by CommunityHeaven LLC

© 1997-2013 Programmersheaven.com - All rights reserved.

## Comments

6,349Member: Look guys i am new to this and got myself behind on this thing can i beg for some help here please help me with this program!!!!!

: this is what the display should look like

:

: 1. Display the first 25 Fibonacci numbers

: 2. Display the first 50 Fibonacci numbers

: 3. Display the first 75 Fibonacci numbers

: 4. Display the first 125 Fibonacci numbers

: 5. Display the first 200 Fibonacci numbers

:

: hit me back soon as you can please!

: how pleaseeeee

: help me with a starting point

: read the material that i should have but cant get a start

: a sample program could help if

: that is not too much to ask

: i am in a bind here

:

:

Start by reading about Fibonacci numbers (http://en.wikipedia.org/wiki/Fibonacci_numbers).

Once you are familiar with those, you can start to write a function to find the n-th Fibonacci number. The easiest way to do this, is to check if n > 1 and write a loop from 2 to n which remembers the previous 2 numbers. Example:

[code]

Loop {

previous2 = previous1

previous1 = current

current = previous1 + previous2

}

[/code]

An alternative approach uses a recursive funcion:

[code]

function F(n);

if n > 2 then {

result = F(n-1)+F(n-2)

} else if n = 1 then {

result = 1

} else {

result = 0;

}

[/code]

- Spam

0 · Vote Down Vote Up ·15Member: : [b][red]This message was edited by jcherring4 at 2007-3-12 2:25:42[/red][/b][hr]

: : Look guys i am new to this and got myself behind on this thing can i beg for some help here please help me with this program!!!!!

: : this is what the display should look like

: :

: : 1. Display the first 25 Fibonacci numbers

: : 2. Display the first 50 Fibonacci numbers

: : 3. Display the first 75 Fibonacci numbers

: : 4. Display the first 125 Fibonacci numbers

: : 5. Display the first 200 Fibonacci numbers

: :

: : hit me back soon as you can please!

: : how pleaseeeee

: : help me with a starting point

: : read the material that i should have but cant get a start

: : a sample program could help if

: : that is not too much to ask

: : i am in a bind here

: :

: :

: Start by reading about Fibonacci numbers (http://en.wikipedia.org/wiki/Fibonacci_numbers).

: Once you are familiar with those, you can start to write a function to find the n-th Fibonacci number. The easiest way to do this, is to check if n > 1 and write a loop from 2 to n which remembers the previous 2 numbers. Example:

: [code]

: Loop {

: previous2 = previous1

: previous1 = current

: current = previous1 + previous2

: }

: [/code]

: An alternative approach uses a recursive funcion:

: [code]

: function F(n);

: if n > 2 then {

: result = F(n-1)+F(n-2)

: } else if n = 1 then {

: result = 1

: } else {

: result = 0;

: }

: [/code]

:

- Spam

0 · Vote Down Vote Up ·67Member ✭Read here Fibonacci Series using recursion C Programming

- Spam

0 · Vote Down Vote Up ·