# Category Archives: Project Euler

I have decided to engage in GDC Project Euler Challenge and found Project Euler itself very interesting. Posts here describes my struggles with Project Euler problems and are not written for the purpose of GDC. Moreover, I am going to continue with Project Euler after GDC Project Euler Challenge is over ;)

## boolean in Java is 8-bit large! always…!

After doing some testing and looking for some information on the Internet, I have figured out that primitive type boolean in Java is always 8-bit large, even in the array…

Read the rest of this entry

## Prime numbers utilites

I have been solving problem 58 and have found a really stupid mistake in dynamic search in my Prime class. Code updated.

Read the rest of this entry

## GitHub repo finally set

After solving some problems and reading many different guides and articles, I have finally understood how the git works and successfully set an online repo. Many thanks to Krzysztof Rosset who helped me a lot today ;)

Read the rest of this entry

## Project Euler: level-up!

+1 intelligence

+10% computer’s main memory

-5% algorithm’s computation time

+skill: Hint

Read the rest of this entry

## GDC Project Euler: problem 79 – Jaroslaw Pawlak

I have decided to describe this problem, mainly because it’s a bit different than all the others. It takes less time to solve it with a pen and paper than to implement some structure for that purpose.

**Solved:**Problem 79

**Difficulty:**extremely easy

## Prime numbers in Project Euler

Many of the problems in Project Euler use prime numbers. Starting from the problem “is N prime?” and ending at counting the total number of divisors of a number. I have started from writing the class Prime with the only method isPrime(long) using brute solution, but over time I have been extending this class – adding new methods and upgrading existing ones. Now, I think it contains much enough of utilities to share it with you ;)

Read the rest of this entry

## Problem 338 (4)

I was wondering about swapping the order of computations i.e. first looking for some edge 1 ≤ x ≤ √wh and then, having x, looking for such d that d | w and d+1 | h or d-1 | h.

Read the rest of this entry

## Problem 338 (3)

I am still trying to solve this problem, but there isn’t much progress. My current implementation of function F bases on the following observation:

Read the rest of this entry