海岛Blog

海是无垠的,岛在海中是独立的,有一片自己的天空

Project Euler Problem 26 Reciprocal cycles

Reciprocal cycles Problem 26 A unit fraction contains 1 in the numerator. The decimal representation of the unit fractions with denominators 2 to ...

2017-04-01 10:31:42

阅读数:566

评论数:0

Project Euler Problem 27 Quadratic primes

Quadratic primes Problem 27 Euler discovered the remarkable quadratic formula: n2+n+41 It turns out that the formula will produce 40 prim...

2017-03-30 19:46:48

阅读数:575

评论数:0

Project Euler Problem 118 Pandigital prime sets

Pandigital prime sets Problem 118 Using all of the digits 1 through 9 and concatenating them freely to form decimal integers, different sets can b...

2017-03-30 18:52:29

阅读数:771

评论数:0

Project Euler Problem 36 Double-base palindromes

Double-base palindromes Problem 36 The decimal number, 585 = 10010010012 (binary), is palindromic in both bases. Find the sum of all numbers, less...

2017-03-30 01:00:00

阅读数:778

评论数:0

Project Euler Problem 38 Pandigital multiples

Pandigital multiples Problem 38 Take the number 192 and multiply it by each of 1, 2, and 3: 192 × 1 = 192 192 × 2 = 384 192 × 3 = 576 ...

2017-03-29 22:00:47

阅读数:618

评论数:0

Project Euler Problem 104 Pandigital Fibonacci ends

Pandigital Fibonacci ends Problem 104 The Fibonacci sequence is defined by the recurrence relation: Fn = Fn−1 + Fn−2, where F1 = 1 and F2 = 1. I...

2017-03-29 11:38:13

阅读数:586

评论数:2

Project Euler Problem 32 Pandigital products

Pandigital products Problem 32 We shall say that an n-digit number is pandigital if it makes use of all the digits 1 to n exactly once; for exampl...

2017-03-29 06:38:22

阅读数:803

评论数:0

Project Euler Problem 41 Pandigital prime

Pandigital prime Problem 41 We shall say that an n-digit number is pandigital if it makes use of all the digits 1 to n exactly once. For example, ...

2017-03-28 18:32:56

阅读数:423

评论数:0

Project Euler Problem 34 Digit factorials

Digit factorials Problem 34 145 is a curious number, as 1! + 4! + 5! = 1 + 24 + 120 = 145. Find the sum of all numbers which are equal to th...

2017-03-28 17:48:12

阅读数:469

评论数:0

Project Euler Problem 23 Non-abundant sums

Non-abundant sums Problem 23 A perfect number is a number for which the sum of its proper divisors is exactly equal to the number. For exampl...

2017-03-28 09:58:12

阅读数:545

评论数:0

Project Euler Problem 24 Lexicographic permutations

Lexicographic permutations Problem 24 A permutation is an ordered arrangement of objects. For example, 3124 is one possible permutation of th...

2017-03-28 08:21:42

阅读数:581

评论数:0

Project Euler Problem 19 Counting Sundays

Counting Sundays Problem 19 You are given the following information, but you may prefer to do some research for yourself. 1 Jan 1900 was...

2017-03-27 04:01:18

阅读数:683

评论数:0

Project Euler Problem 17 Number letter counts

Number letter counts Problem 17 If the numbers 1 to 5 are written out in words: one, two, three, four, five, then there are 3 + 3 + 5 + 4 + 4...

2017-03-26 15:56:58

阅读数:539

评论数:0

Project Euler Problem 92 Square digit chains

Square digit chains Problem 92 A number chain is created by continuously adding the square of the digits in a number to form a new number until it...

2017-03-25 08:37:03

阅读数:670

评论数:4

Project Euler Problem 543 Prime-Sum Numbers

Prime-Sum Numbers Problem 543 Define function P(n,k) = 1 if n can be written as the sum of k prime numbers (with repetitions allowed), and P...

2017-03-24 08:03:34

阅读数:818

评论数:2

Project Euler Problem 99 Largest exponential

Largest exponential Problem 99 Comparing two numbers written in index form like 211 and 37 is not difficult, as any calculator would confirm ...

2017-03-23 21:11:36

阅读数:483

评论数:0

Project Euler Problem 21 Amicable numbers

Amicable numbers Problem 21 Let d(n) be defined as the sum of proper divisors of n (numbers less than n which divide evenly into n). If d(a) = b a...

2017-03-23 09:11:11

阅读数:506

评论数:0

Project Euler Problem 25 1000-digit Fibonacci number

1000-digit Fibonacci number Problem 25 The Fibonacci sequence is defined by the recurrence relation: Fn = Fn−1 + Fn−2, where F1 = 1 and F2...

2017-03-23 06:35:05

阅读数:331

评论数:0

Project Euler Problem 20 Factorial digit sum

Factorial digit sum Problem 20 n! means n × (n − 1) × ... × 3 × 2 × 1 For example, 10! = 10 × 9 × ... × 3 × 2 × 1 = 3628800, and the sum of...

2017-03-23 00:10:55

阅读数:438

评论数:0

Project Euler Problem 67 Maximum path sum II

Maximum path sum II Problem 67 By starting at the top of the triangle below and moving to adjacent numbers on the row below, the maximum total fro...

2017-03-22 23:06:04

阅读数:314

评论数:0

提示
确定要删除当前文章?
取消 删除
关闭
关闭