Culture

Fashion Statement

Have a go at each of these, they're a good starting point towards problem solving using programming. You can also look at the Guide to programming.

1 1 2 3 5 8 13 21 34 55 89 144…

Write a program that displays the largest Fibonacci number less than or equal to a limit supplied to the program on each test run. For example, if the limit is 50, the program should just show 34.

Constraints - you may assume the limit is less than one million.

Run your program on the following three test cases:

Test Input
8
234
876543

• A Super Prime is a prime number with the additional interesting property that as each digit is removed from the right the number which remains is a prime.

Instructions

The following is a list of Super Primes of length 4:
2333
2339
2393
2399
2939
3119
3137
3733
3739
3793
3797
5939
7193
7331
7333
7393

Instructions

• Write a program that prints all super primes of length 6
• Your output should contain each Super Prime on a line each.
• Output sould be in ascending order.
• No other output should be produced by your program other than the numbers.

If you can use File I/O, output your answer to "primes.txt"

The text is a list of words, separated by at least one spaces, possibly together with some punctuation and/or line breaks. The length of each word corresponds to a digit in the "value", with a word of length 10 corresponding to the digit 0. There is to be a decimal point after the first digit.

For example the phrase "How I need a monkey" has words of length 3, 1, 4, 1 and 6 respectively. This is worth 3.1416 (coincidentally this is pi to 4 decimal places).

You are to write a program which, given such a message, returns its value.

You may assume that there are between two and sixty words in the message, and that no word is longer than ten letters. You may also assume that the input will all be on one line of text, and each word will have at least one letter.