Euler Problem 153

Euler Problem 153:

Investigating Gaussian Integers.


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]}]]];

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 )

Connecting to %s