摘要: 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 positive num 阅读全文
posted @ 2020-11-26 04:05 璃奈ちゃんボード 阅读(95) 评论(0) 推荐(0) 编辑
摘要: 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 × 99. Find t 阅读全文
posted @ 2020-11-25 22:17 璃奈ちゃんボード 阅读(161) 评论(0) 推荐(0) 编辑
摘要: Problem 3 The prime factors of 13195 are 5, 7, 13 and 29. What is the largest prime factor of the number 600851475143 ? 解答 这道题目很简单,就是要我们找出 600,851,475 阅读全文
posted @ 2020-11-25 06:54 璃奈ちゃんボード 阅读(138) 评论(0) 推荐(0) 编辑
摘要: 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 terms will be: 阅读全文
posted @ 2020-11-25 06:39 璃奈ちゃんボード 阅读(71) 评论(0) 推荐(0) 编辑
摘要: 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. Find the s 阅读全文
posted @ 2020-11-25 06:32 璃奈ちゃんボード 阅读(98) 评论(0) 推荐(0) 编辑
摘要: 有理数(rational number)记为 Q,实数记为 R 虽然任意两个不同的有理数间还有一个有理数,但是有理数集中还是会有 “间隙”,而实数集填补了这些间隙. 集合(set):属于(in) x∈A,不属于(not in) x∉A 空集(empty set),非空(none empty),子集( 阅读全文
posted @ 2020-11-20 23:56 璃奈ちゃんボード 阅读(637) 评论(0) 推荐(0) 编辑
摘要: 导引 有理数集是“稀疏的”和“稠密的”。 选择公理 考虑以下问题:容易找到两个无理数 a, b 使 a + b 为有理数,或者使 ab 为有理数,但是能否使得 ab 也是有理数? 答:令 如果 x 是一个有理数,则即可。 如果 x 是无理数,则令 ,而 ,则,通过Gelfond-Schneider 阅读全文
posted @ 2020-11-20 23:36 璃奈ちゃんボード 阅读(562) 评论(0) 推荐(0) 编辑
摘要: Shamir’s Secret Sharing scheme is an important cryptographic algorithm that allows private information— “secrets” — to be distributed securely amongst 阅读全文
posted @ 2020-11-17 02:43 璃奈ちゃんボード 阅读(4629) 评论(0) 推荐(0) 编辑