Project Euler Problem91 #ProjectEuler
Project EulerのProblem91に挑戦しました。 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...
View ArticleProject Euler Problem92 #ProjectEuler
Project EulerのProblem92に挑戦しました。 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 1...
View ArticleProject Euler Problem93 #ProjectEuler
Project EulerのProblem93に挑戦しました。 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...
View ArticleProject Euler Problem94 #ProjectEuler
Project EulerのProblem94に挑戦しました。 It is easily proved that no equilateral triangle exists with integral length sides and integral area. However, the almost equilateral triangle 5-5-6 has an area of 12...
View ArticleProject Euler Problem95 #ProjectEuler
Project EulerのProblem95に挑戦しました。 The proper divisors of a number are all the divisors excluding the number itself. For example, the proper divisors of 28 are 1, 2, 4, 7, and 14. As the sum of these...
View ArticleProject Euler Problem96 #ProjectEuler
Project EulerのProblem96に挑戦しました。 Su Doku (Japanese meaning number place) is the name given to a popular puzzle concept. Its origin is unclear, but credit must be attributed to Leonhard Euler who...
View ArticleProject Euler Problem97 #ProjectEuler
Project EulerのProblem97に挑戦しました。 The first known prime found to exceed one million digits was discovered in 1999, and is a Mersenne prime of the form 2^6972593-1; it contains exactly 2,098,960 digits....
View ArticleProject Euler Problem98 #ProjectEuler
Project EulerのProblem98に挑戦しました。 By replacing each of the letters in the word CARE with 1, 2, 9, and 6 respectively, we form a square number: 1296 = 362. What is remarkable is that, by using the same...
View ArticleProject Euler Problem99 #ProjectEuler
Project EulerのProblem99に挑戦しました。 Comparing two numbers written in index form like 2^11 and 3^7 is not difficult, as any calculator would confirm that 2^11 = 2048 3^7 = 2187. However, confirming that...
View ArticleProject Euler Problem100 #ProjectEuler
Project EulerのProblem100に挑戦しました。 ようやく100問目です。 2010/8/16に第1問目に挑戦し、5/8に100問目到達しました。実に265日かかってます。 300問とか、いつになることやら・・orz、最近ちょっと疲れ気味。 とりあえず、無理せず、気長に進めていければと考えています。 If a box contains twenty-one coloured...
View Article