Fermat's Last Theorem in Clock Math Icon

Fermat's Last Theorem in Clock Math

alpha
Add a Review
0 Downloads (This Week)
Last Update:

Screenshots

Description

A search to z = 65535 for (1) triples (x,y,z) satisfying (2) gcd(x,y,z) = 1, (3) exactly one of {x,y,z} even, (4) 0 < x < y < z < x+y, and (5) (z/y, z/x, x/y)^p = (1, 1, -1) in multiplicative group Mx X My X Mz, with (5) p odd prime.

Fermat's Last Theorem in Clock Math Web Site

Categories

Mathematics

License

Public Domain

KEEP ME UPDATED

Other Useful Business Software

Communicate & Connect with Ring Central's VoIP Solution Icon

Cloud Powered Business Phone System

Communicate & Connect with Ring Central's VoIP Solution Icon
1 of 5 2 of 5 3 of 5 4 of 5 5 of 5
129 Reviews
  • Unrivaled value & reliability in one solution
  • Unlimited Calls/SMS/Conferencing/Fax
  • Trusted by 350,000+ Businesses
Write a Review

User Reviews

Be the first to post a review of Fermat's Last Theorem in Clock Math!

Additional Project Details

Intended Audience

Science/Research

User Interface

Win32 (MS Windows)

Programming Language

Visual Basic

Registered

2007-02-21

Thanks for helping keep SourceForge clean.

Screenshot instructions:
Windows
Mac
Red Hat Linux   Ubuntu

Click URL instructions:
Right-click on ad, choose "Copy Link", then paste here →
(This may not be possible with some types of ads)

More information about our ad policies
X

Briefly describe the problem (required):

Upload screenshot of ad (required):
Select a file, or drag & drop file here.

Please provide the ad click URL, if possible:

Get latest updates about Open Source Projects, Conferences and News.

No, thanks