In this challenge there are 3 question, beginner, intermediate, and others.

Beginner:** 1) Find the sum of all Natural numbers that are a multiple of 3 or 11, from 1 to 100,000. **

Intermediate:

```
The prime factors of 13195 are 5, 7, 13 and 29.
What is the largest prime factor of the number 600851475143 ?
```

Other( a little harder than intermediate):

The Fibonacci sequence is defined by the recurrence relation :

F_n = F_n-1 + F_n-2 where F_1 = 1 and F_2 = 1;

Here are some few terms :

F_1 = 1

F_2 = 1

F_3 = 2

F_4 = 3

F_5 = 5

F_6 = 8

F_7 = 13

...

...

F_12 = 144

As you see, F_7 is the 1st term to contain a fibonacci number with

2 digit. And F_12 is the 1st term to contain a fibonacci number with

3 digits. `Find the 1st term in the Fibonacci to contain 1024 digits.`

Credits due to project euler. Post solutions here. Make sure you

Comment where relevatent, indent and make code readable. Make

sure its C++ code since this is posted in C++ forumn.

Happe new year.