Euler Problem 153


Euler Problem 153:

Investigating Gaussian Integers.

Rješenje:

Vrlo “slabo” i dugotrajno rješenje do kojeg sam došao koje traje nekoliko sati sa Wolfram Mathematica:

sum = 0;
For[i = 1, i <= 10^8, i++,
lst = Divisors[i, GaussianIntegers -> True];
sum = sum + Total[Total[{Re[lst], Im[lst]}]]];
sum

About Bahrudin Hrnjica

PhD in Mechanical Engineering, Microsoft MVP for .NET. Likes .NET, Math, Mechanical Engineering, Evolutionary Algorithms, Blogging.

Posted on 01/03/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:

WordPress.com Logo

You are commenting using your WordPress.com 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