算法学习,翻译几道英文题目

以下题目从http://projecteuler.net翻译过来
现在先翻译五题.
Problem 1
05 October 2001
If we list all the natural numbers below 10 that are multiples of 3 or 5, we get 3, 5, 6 and 9. The sum of these multiples is 23.
Find the sum of all the multiples of 3 or 5 below 1000.
如果我们列出10以下3或5的倍数(大于0)的话,我们可以找出3,5,6,9.他们的总和为23.
请找出1000以下3或5的所有倍数(大于0)的总和.

Problem 2
19 October 2001
Each new term in the Fibonacci sequence is generated by adding the previous two terms. By starting with 1 and 2, the first 10 terms will be:
1, 2, 3, 5, 8, 13, 21, 34, 55, 89, ...
Find the sum of all the even-valued terms in the sequence which do not exceed four million.
每一个菲波拉契数都是前两个数之和.以1和2开始.前十个菲波拉契数分别是:1,2,3,5,8,13,21,34,55,89
请找出4000000(四百万)以下所有偶菲波拉契数之和


Problem 3
02 November 2001
The prime factors of 13195 are 5, 7, 13 and 29.
What is the largest prime factor of the number 600851475143 ?
13195的质因数是5,7,13,29
请找出600851475143的最大质因数.


Problem 4
16 November 2001
A palindromic number reads the same both ways. The largest palindrome made from the product of two 2-digit numbers is 9009=91 × 99.
Find the largest palindrome made from the product of two 3-digit numbers.
palindromic数是两个两位数相乘的乘积,并且它从左到右与从右到左读都是一样的.两个两位数相乘的最大的palindromic数是91*99=9009
请找出由两个三位数相乘最大的palindromic


Problem 5
30 November 2001
2520 is the smallest number that can be divided by each of the numbers from 1 to 10 without any remainder.
What is the smallest number that is evenly divisible by all of the numbers from 1 to 20?
2520是能被1至10都能整除的最小的数(大于0)
请找出能被1至20都能整除的最小的数(大于0)
发贴者 ipython 时间： 上午5:48 0 评论