## Circular Primes

Matlab. This is the problem 35 in Project Euler. I developed an algorithm to find total number of circular primes under a positive integer as input.

Matlab. This is the problem 35 in Project Euler. I developed an algorithm to find total number of circular primes under a positive integer as input.

C++, Matlab. This is the problem 30 from Project Euler. Question: Surprisingly there are only three numbers that can be written as the sum of fourth powers of their digits: 1634 = 1^4 + 6^4 + 3^4 + […]

C++, Matlab. This is the problem 28 from Project Euler website. Question: Starting with the number 1 and moving to the right in a clockwise direction a 5 by 5 spiral is formed as follows: 21 22 […]

Matlab. This is the problem 4 in Project Euler. I made some simple mistakes while trying to write an efficient algorithm. There were two inputs; digit number of the integer and limit number. For example, […]