The Search for Maximal Values of min(A,B,C) / gcd(A,B,C) for A^x + B^y = C^z

Details The Search for Maximal Values of min(A,B,C) / gcd(A,B,C) for A^x + B^y = C^z The Search for Maximal Values of min(A,B,C) / gcd(A,B,C) for A^x + B^y = C^z

2010-04-03

arxiv.org/abs/1004.0430v1

Mathematics

Number Theory

Body: 16 pages, Appendices: 11 pages, 5 tables, 1 figure

Scientific paper

This paper answers a question asked by Ed Pegg Jr. in 2001: "What is the maximal value of min(A,B,C)/ gcd(A,B,C) for A^x + B^y = C^z with A,B,C >= 1; x,y,z >= 3?" Equations of this form are analyzed, showing how they map to exponential Diophantine equations with coprime bases. A search algorithm is provided to find the largest min/gcd value within a given equation range. The algorithm precalculates a multi-gigabyte lookup table of power residue information that is used to eliminate over 99% of inputs with a single array lookup and without any further calculations. On inputs that pass this test, the algorithm then performs further power residue tests, avoiding modular powering by using lookups into precalculated tables, and avoiding division by using multiplicative inverses. This algorithm is used to show the largest min/gcd value for all equations with C^z <= 2^100.

Affiliated with

Also associated with

No associations

Rating

The Search for Maximal Values of min(A,B,C) / gcd(A,B,C) for A^x + B^y = C^z does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with The Search for Maximal Values of min(A,B,C) / gcd(A,B,C) for A^x + B^y = C^z, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The Search for Maximal Values of min(A,B,C) / gcd(A,B,C) for A^x + B^y = C^z will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-198657