No, no, no. You're doing it wrong. You're supposed to post every one of those sentences in a separate post, to clutter the forum with nonsense, and artificially boost your post count to make it look as though your contribution is more significant than it really is. Haven't you learned anything from this forum?
Please note that closed account's code was just a copy of the OP's code with a "percent complete" meter running. It wasn't a new solution to the problem. He was just trying to demonstrate how slow the program ran.
As for the Sieve, that finds all primes from 2 to N, but Project Euler #3 isn't asking for that, it's just asking to find the largest prime factor of a single number.
For the specific case of the number 600851475143 it is possible to produce a fast solution (mine completed in under 20 microseconds, excluding i/o) without reference to prime numbers as such.
However, a more general solution to work with any number (including those which are themselves prime) then I think some use of prime numbers could be useful. My own solution would certainly be extremely slow in that case.