Hey there folks. New at this so forgive any mistakes, first post.
I'm beginning to learn c++. Not so easy.
After reading a few threads went to project euler.
Problem i have is problem 3.
The prime factors of 13195 are 5,7,13 and 29.
What is the largest prime factor of the number 600851475143 ?
Wrote my program and seems to work on the example given(13195) and on larger numbers,
but when i try anything larger than 10 digits nothing happens and program ends.
Does anyone have any suggestions on how to fix this.
Grateful for any help.
Not posted code didn't think it mattered but can if need be.