- 博客(43)
- 资源 (5)
- 收藏
- 关注
RSS订阅原创 Project Euler：Problem 93 Arithmetic expressions
By using each of the digits from the set, {1, 2, 3, 4}, exactly once, and making use of the four arithmetic operations (+, −, *, /) and brackets/parentheses, it is possible to form different positiv
2015-07-26 17:25:46
1308
1
原创 Project Euler：Problem 92 Square digit chains
A number chain is created by continuously adding the square of the digits in a number to form a new number until it has been seen before.For example,44 → 32 → 13 → 10 → 1 → 185 → 89 → 145 → 42
2015-07-26 14:12:17
766
原创 Project Euler：Problem 91 Right triangles with integer coordinates
The points P (x1, y1) and Q (x2, y2) are plotted at integer co-ordinates and are joined to the origin, O(0,0), to form ΔOPQ.There are exactly fourteen triangles containing a right angle that
2015-07-25 22:40:31
1113
原创 Project Euler：Problem 90 Cube digit pairs
Each of the six faces on a cube has a different digit (0 to 9) written on it; the same is done to a second cube. By placing the two cubes side-by-side in different positions we can form a variety of
2015-07-24 21:27:52
918
原创 Project Euler：Problem 89 Roman numerals
For a number written in Roman numerals to be considered valid there are basic rules which must be followed. Even though the rules allow some numbers to be expressed in more than one way there is alw
2015-07-24 16:44:36
826
原创 Project Euler：Problem 88 Product-sum numbers
A natural number, N, that can be written as the sum and product of a given set of at least two natural numbers, {a1, a2, ... , ak} is called a product-sum number: N = a1 + a2 + ... + ak = a1 × a2 ×
2015-07-23 22:35:52
1431
1
原创 Project Euler：Problem 87 Prime power triples
The smallest number expressible as the sum of a prime square, prime cube, and prime fourth power is 28. In fact, there are exactly four numbers below fifty that can be expressed in such a way:28
2015-07-23 20:59:37
778
原创 Project Euler：Problem 86 Cuboid route
A spider, S, sits in one corner of a cuboid room, measuring 6 by 5 by 3, and a fly, F, sits in the opposite corner. By travelling on the surfaces of the room the shortest "straight line" distance fr
2015-07-22 17:04:37
914
原创 Project Euler：Problem 85 Counting rectangles
By counting carefully it can be seen that a rectangular grid measuring 3 by 2 contains eighteen rectangles:Although there exists no rectangular grid that contains exactly two million rectangles,
2015-07-22 15:02:29
743
原创 Project Euler：Problem 84 Monopoly odds
In the game, Monopoly, the standard board is set up in the following way:GOA1CC1A2T1R1B1CH1B2B3JAILH2 C1T2 U1H1 C2CH3 C3R4
2015-07-22 13:40:00
1079
原创 Project Euler：Problem 83 Path sum: four ways
In the 5 by 5 matrix below, the minimal path sum from the top left to the bottom right, by moving left, right, up, and down, is indicated in bold red and is equal to 2297.⎛⎝⎜⎜⎜⎜⎜⎜1312016305378
2015-07-21 21:51:52
1019
原创 Project Euler：Problem 82 Path sum: three ways
The minimal path sum in the 5 by 5 matrix below, by starting in any cell in the left column and finishing in any cell in the right column, and only moving up, down, and right, is indicated in red an
2015-07-21 16:07:11
1239
原创 Project Euler：Problem 81 Path sum: two ways
In the 5 by 5 matrix below, the minimal path sum from the top left to the bottom right, by only moving to the right and down, is indicated in bold red and is equal to 2427.⎛⎝⎜⎜⎜⎜⎜⎜1312016305
2015-07-20 20:39:38
764
原创 Project Euler：Problem 80 Square root digital expansion
It is well known that if the square root of a natural number is not an integer, then it is irrational. The decimal expansion of such square roots is infinite without any repeating pattern at all.T
2015-07-20 14:35:00
520
原创 Project Euler：Problem 79 Passcode derivation
A common security method used for online banking is to ask the user for three random characters from a passcode. For example, if the passcode was 531278, they may ask for the 2nd, 3rd, and 5th chara
2015-07-20 13:58:11
1049
3
原创 Project Euler：Problem 78 Coin partitions
Let p(n) represent the number of different ways in which n coins can be separated into piles. For example, five coins can be separated into piles in exactly seven different ways, so p(5)=7.
2015-07-19 14:31:15
1035
原创 Project Euler：Problem 77 Prime summations
It is possible to write ten as the sum of primes in exactly five different ways:7 + 35 + 55 + 3 + 23 + 3 + 2 + 22 + 2 + 2 + 2 + 2What is the first value which can be written as the sum o
2015-07-18 17:26:31
868
原创 Project Euler：Problem 76 Counting summations
It is possible to write five as a sum in exactly six different ways:4 + 13 + 23 + 1 + 12 + 2 + 12 + 1 + 1 + 11 + 1 + 1 + 1 + 1How many different ways can one hundred be written as a su
2015-07-18 16:46:12
917
原创 Project Euler：Problem 75 Singular integer right triangles
It turns out that 12 cm is the smallest length of wire that can be bent to form an integer sided right angle triangle in exactly one way, but there are many more examples.12 cm: (3,4,5)24 cm: (6
2015-07-18 15:53:08
1008
原创 Project Euler：Problem 74 Digit factorial chains
The number 145 is well known for the property that the sum of the factorial of its digits is equal to 145:1! + 4! + 5! = 1 + 24 + 120 = 145Perhaps less well known is 169, in that it produces the
2015-07-17 19:21:49
799
原创 Project Euler：Problem 73 Counting fractions in a range
Consider the fraction, n/d, where n and d are positive integers. If nd and HCF(n,d)=1, it is called a reduced proper fraction.If we list the set of reduced proper fractions for d ≤ 8 in ascending or
2015-07-17 16:45:40
609
原创 Project Euler：Problem 72 Counting fractions
Consider the fraction, n/d, where n and d are positive integers. If nd and HCF(n,d)=1, it is called a reduced proper fraction.If we list the set of reduced proper fractions for d ≤ 8 in ascending or
2015-07-17 14:01:38
977
原创 Project Euler：Problem 71 Ordered fractions
Consider the fraction, n/d, where n and d are positive integers. If nd and HCF(n,d)=1, it is called a reduced proper fraction.If we list the set of reduced proper fractions for d ≤ 8 in ascending or
2015-07-17 13:14:05
615
原创 Project Euler：Problem 70 Totient permutation
Euler's Totient function, φ(n) [sometimes called the phi function], is used to determine the number of positive numbers less than or equal to n which are relatively prime to n. For example, as 1, 2,
2015-07-17 12:59:40
759
原创 Project Euler：Problem 69 Totient maximum
Euler's Totient function, φ(n) [sometimes called the phi function], is used to determine the number of numbers less than n which are relatively prime to n. For example, as 1, 2, 4, 5, 7, and 8, are
2015-07-16 22:12:56
590
1
原创 Project Euler：Problem 68 Magic 5-gon ring
Consider the following "magic" 3-gon ring, filled with the numbers 1 to 6, and each line adding to nine.Working clockwise, and starting from the group of three with the numerically lowest exte
2015-07-16 21:28:01
1070
原创 Project Euler：Problem 67 Maximum path sum II
By starting at the top of the triangle below and moving to adjacent numbers on the row below, the maximum total from top to bottom is 23.37 42 4 68 5 9 3That is, 3 + 7 + 4 + 9 = 23.Find th
2015-07-15 23:01:02
631
原创 Project Euler：Problem 66 Diophantine equation
Consider quadratic Diophantine equations of the form:x2 – Dy2 = 1For example, when D=13, the minimal solution in x is 6492 – 13×1802 = 1.It can be assumed that there are no solutions in positi
2015-07-15 20:03:14
540
原创 Project Euler：Problem 65 Convergents of e
The square root of 2 can be written as an infinite continued fraction.√2 = 1 +1 2 +1 2 +1 2 +1 2 + ...The
2015-07-15 14:57:34
857
原创 Project Euler：Problem 64 Odd period square roots
All square roots are periodic when written as continued fractions and can be written in the form:√N = a0 +1 a1 +1 a2 +1 a3 + ...F
2015-07-14 22:35:46
664
原创 Project Euler：Problem 63 Powerful digit counts
The 5-digit number, 16807=75, is also a fifth power. Similarly, the 9-digit number, 134217728=89, is a ninth power.How many n-digit positive integers exist which are also an nth power?这样的数字满
2015-07-14 17:04:48
1168
原创 Project Euler：Problem 62 Cubic permutations
The cube, 41063625 (3453), can be permuted to produce two other cubes: 56623104 (3843) and 66430125 (4053). In fact, 41063625 is the smallest cube which has exactly three permutations of its digits
2015-07-14 15:18:33
635
原创 Project Euler：Problem 61 Cyclical figurate numbers
Triangle, square, pentagonal, hexagonal, heptagonal, and octagonal numbers are all figurate (polygonal) numbers and are generated by the following formulae:Triangle P3,n=n(n+1)/2 1, 3,
2015-07-14 15:13:42
840
原创 Project Euler：Problem 60 Prime pair sets
The primes 3, 7, 109, and 673, are quite remarkable. By taking any two primes and concatenating them in any order the result will always be prime. For example, taking 7 and 109, both 7109 and 1097 a
2015-07-13 20:05:35
885
原创 Project Euler：Problem 59 XOR decryption
Each character on a computer is assigned a unique code and the preferred standard is ASCII (American Standard Code for Information Interchange). For example, uppercase A = 65, asterisk (*) = 42, and
2015-07-08 22:33:16
1035
原创 Project Euler：Problem 58 Spiral primes
Starting with 1 and spiralling anticlockwise in the following way, a square spiral with side length 7 is formed.37 36 35 34 33 32 3138 17 16 15 14 13 3039 18 5 4 3 12 2940 19 6 1 2 11
2015-07-08 20:48:55
725
原创 Project Euler：Problem 57 Square root convergents
It is possible to show that the square root of two can be expressed as an infinite continued fraction.√ 2 = 1 + 1/(2 + 1/(2 + 1/(2 + ... ))) = 1.414213...By expanding this for the first four ite
2015-07-07 22:53:39
662
原创 Project Euler：Problem 56 Powerful digit sum
A googol (10100) is a massive number: one followed by one-hundred zeros; 100100 is almost unimaginably large: one followed by two-hundred zeros. Despite their size, the sum of the digits in each num
2015-07-07 22:25:47
731
1
原创 Project Euler：Problem 55 Lychrel numbers
If we take 47, reverse and add, 47 + 74 = 121, which is palindromic.Not all numbers produce palindromes so quickly. For example,349 + 943 = 1292,1292 + 2921 = 42134213 + 3124 = 7337That is
2015-07-07 15:40:16
845
原创 Project Euler ：Problem 54 Poker hands
In the card game poker, a hand consists of five cards and are ranked, from lowest to highest, in the following way:High Card: Highest value card.One Pair: Two cards of the same value.Two Pairs: Tw
2015-07-07 14:50:27
1174
1
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人