Difference between revisions of "Basic Pascal Tutorial/Chapter 3/Programming Assignment"
From Lazarus wiki
Jump to navigationJump to search| Line 18: | Line 18: | ||
{|style=color-backgroud="white" cellspacing="20" | {|style=color-backgroud="white" cellspacing="20" | ||
| − | |[[ | + | |[[FOR..IN|previous]] |
|[[Contents|contents]] | |[[Contents|contents]] | ||
|[[Solution_3|next]] | |[[Solution_3|next]] | ||
|} | |} | ||
Revision as of 16:59, 5 January 2010
3E - Programming Assignments (author: Tao Yue, state: unchanged)
Problem 1
Find the first 10 numbers in the Fibonacci sequence. The Fibonacci sequence starts with two numbers:
1 1
Each subsequent number is formed by adding the two numbers before it. 1+1=2, 1+2=3, 2+3=5, etc. This forms the following sequence:
1 1 2 3 5 8 13 21 34 55 89 144 ...
Problem 2
Display all powers of 2 that are less than 20000. Display the list in a properly formatted manner, with commas between the numbers. Display five numbers per line. The output should look like:
1, 2, 4, 8, 16, 32, 64, 128, 256, 512, 1024, 2048, 4096, 8192, 16384
| previous | contents | next |
