Euler Problem 69

Euler Problem 69: Find the value of n ≤ 1,000,000 for which n/φ(n) is a maximum.

Prosto rješenje sa Mathamatica:

prop = 0;
n = 0;
For[i = 2, i <= 1000000, i++, temp = i/EulerPhi[i];
If[temp > prop, prop = temp; n = i]]; n

About Bahrudin Hrnjica

PhD in Mechanical Engineering, Microsoft MVP for Visual Studio and Development Technologies. Likes .NET, Math,Data Science, Evolutionary Algorithms, Machine Learning, Blogging.

Posted on 25/02/2010, in Project Euler and tagged . Bookmark the permalink. Leave a comment.

Leave a Reply

Fill in your details below or click an icon to log in: Logo

You are commenting using your 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 )

Google+ photo

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

Connecting to %s