Project Euler #3 Pseudocode

The Challenge

The prime factors of 13195 are 5, 7, 13 and 29.

What is the largest prime factor of the number 600851475143 ?

So, this would probably be a good case study in making a basic program and then an optimized one with threading/channels (Is that what Go calls them?) Maybe a good time to use some libraries instead of writing my own prime checker? Any who … here is some pseudocode

Include some stuff, maybe some libraries?

Define some vars

Might need to define some data structures and maybe some control code?

Find the first level factor, do we branch and do the prime test or de we do it inline?

Test the prime factors and make sure they multiple to our actual value

Sort them and print the largest one

Leave a Reply

Please log in using one of these methods to post your comment:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out /  Change )

Google+ photo

You are commenting using your Google+ account. Log Out /  Change )

Twitter picture

You are commenting using your Twitter account. Log Out /  Change )

Facebook photo

You are commenting using your Facebook account. Log Out /  Change )

Connecting to %s

This site uses Akismet to reduce spam. Learn how your comment data is processed.