Euler Problem 123


Euler Problem 123:

Mathematica: Algoritam jednostavan i prost. Traje nešto oko 20-tak sec, dovoljno.

For[i=7036,True,i++,
pn=Prime[i];
rem=Mod[(pn-1)^i+(pn+1)^i,pn^2];
If[rem>10^10,Break[]];
];i

About Bahrudin Hrnjica

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

Posted on 19/03/2010, in C#, 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