## Pentagonal Numbers

This is the Problem 44 from Project Euler. I implemented my solution algorithm by C++. Question: Pentagonal numbers are generated by the formula, Pn=n(3n−1)/2. The first ten pentagonal numbers are: 1, 5, 12, 22, 35, 51, […]

This is the Problem 44 from Project Euler. I implemented my solution algorithm by C++. Question: Pentagonal numbers are generated by the formula, Pn=n(3n−1)/2. The first ten pentagonal numbers are: 1, 5, 12, 22, 35, 51, […]

This was one of the assignments in the algorithm course I took before. Inputs are two big integers like 60 digits each. I implemented traditional multiplication method into my algorithm. Multiplication stage takes numbers in […]

This is the Problem 30 from Project Euler. I implemented my solution algorithm by both C++ and Matlab. Question: Surprisingly there are only three numbers that can be written as the sum of fourth powers […]

This is the Problem 28 from Project Euler website. I implemented my solution algorithm by both C++ and Matlab. Question: Starting with the number 1 and moving to the right in a clockwise direction a 5 by […]

One of the assignments inspired by Project Euler in the Matlab course I took before . I made some simple mistakes while trying to write an efficient algorithm. There were two inputs; digit number of the […]

This was an interesting assignment in the Matlab course I took before. Its inputs and output could be very large, in fact, larger than representable number in Matlab. Solution can show its output with full […]

This was one of the assignments in the Matlab course I took. I developed an algorithm to find total number of circular primes under a positive integer as input.