摘要: Problem 5 Problem 5 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 po 阅读全文
posted @ 2019-04-02 16:36 仰望灬星空 阅读(110) 评论(0) 推荐(0) 编辑
摘要: Problem 4 Problem 4 A palindromic number reads the same both ways. The largest palindrome made from the product of two 2-digit numbers is 9009 = 91 × 阅读全文
posted @ 2019-03-30 22:16 仰望灬星空 阅读(149) 评论(0) 推荐(0) 编辑
摘要: Problem 3 Problem 3 The prime factors of 13195 are 5, 7, 13 and 29. What is the largest prime factor of the number 600851475143 ? Solve: clearclct = i 阅读全文
posted @ 2019-03-26 19:06 仰望灬星空 阅读(122) 评论(0) 推荐(0) 编辑
摘要: Problem 2 Problem 2 Each new term in the Fibonacci sequence is generated by adding the previous two terms. By starting with 1 and 2, the first 10 term 阅读全文
posted @ 2019-03-24 14:14 仰望灬星空 阅读(170) 评论(0) 推荐(0) 编辑
摘要: Problem 1 Problem 1 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. 阅读全文
posted @ 2019-03-24 14:09 仰望灬星空 阅读(137) 评论(0) 推荐(0) 编辑