Quantcast
Channel: Brute Force – mathblog.dk
Browsing all 10 articles
Browse latest View live

Project Euler 133: Repunit nonfactors

Problem 133 of Project Euler is a continuation of Problem 132 and Problem 129 in which we are supposed to find the some prime numbers which are not factors of R(10n) for any n. In fact the problem...

View Article



Project Euler 135: Same differences

In Problem 135 of Project Euler we have another nice number theory problem. The problem reads Given the positive integers, x, y, and z, are consecutive terms of an arithmetic progression, the least...

View Article

Project Euler 136: Singleton difference

Problem 136 of Project Euler can be solved in a very easy way, and a very fast way. So lets look at the problem and dive right into the problem which reads The positive integers, x, y, and z, are...

View Article

Project Euler 137: Fibonacci golden nuggets

I think that Problem 137 of Project Euler is a really fantastic problem since it has so many facets of how it can be solved. I will go through a one of them, and then link to a few other. The problem...

View Article

Project Euler 141:Investigating progressive numbers, n, which are also square.

Problem 141 of Project Euler proved to be just as difficult as the number of people who has actually solved it shows.  The problem reads A positive integer, n, is divided by d and the quotient and...

View Article


Project Euler 142: Perfect Square Collection

Problem 142 of Project Euler seems to be one in the easier end, at least if you aren’t afraid of a little algebra. The problem reads Find the smallest x + y + z with integers x > y > z > 0...

View Article

Project Euler 143: Investigating the Torricelli point of a triangle

Problem 143 of Project Euler is a notorious problem. Notorious for having the fewest correct answers per time it has been released. If you sort by number of solvers, you will see a pretty good...

View Article

Project Euler 144: Investigating multiple reflections of a laser beam.

Problem 144 of Project Euler is once again a geometry problem, just like the previous. However, it is completely different. The problem reads In laser physics, a “white cell” is a mirror system that...

View Article


Project Euler 145: How many reversible numbers are there below one-billion?

In Problem 145 of Project Euler we move away from Geometry and over to number theory again, with a problem which reads Some positive integers n have the property that the sum [ n + reverse(n) ]...

View Article


Project Euler 146: Investigating a Prime Pattern

In Problem 146 of Project Euler we are working with primes again, and some quite big ones even. The problem reads The smallest positive integer n for which the numbers n2+1, n2+3, n2+7, n2+9, n2+13,...

View Article
Browsing all 10 articles
Browse latest View live




Latest Images