My solutions to some of Project Euler's problem (Ongoing Project)
Problem 1: Multiples of 3 or 5
key concept: if A is multiple of B, B is a divisor of A (A/B have no remainder)
Problem 2: Even Fibonacci Numbers
key concept: the Fibonacci sequence
Problem 3 Largest Prime Factor
key concept: Integer factorization
Problem 4 Largest Palindrome Product
key concept: a palindrome number is a number that reads the same forward and backward
Problem 5 Smallest Multiple
key concept: a is evenly divided by b <=> a leaves no remainder when divided by b
Problem 6: Sum Square Difference
Problem 7: 10001st Prime
key concept: Prime numbers
Problem 8:Largest Product in a Series
key concept: sliding window technique
Problem 9: Special Pythagorean Triplet
key concept: Euclid's formula for generating pythagorean triples, which states that: given an arbitrary pair of integers m and n with m > n > 0. a = m²-n², b = 2mn, c = m² + n²
Problem 10: Summation of Primes
Problem 12: Highly Divisible Triangular Number
key concepts:
Triangular number
Formula to find a triangular number Tn: Tn = (n(n + 1))/ 2