The ABC Conjecture
Time limit1sMemory limit1024 MB
For each range [L, H], list every coprime equation a + b = c whose radical d of a·b·c is smaller than c, sorted by c then a.
- Level
Easy3 of 10
- Topics
- Brute force, Number theory, Math
- Solved
- No attempts yet
Problem
As taken from Wikipedia:
The abc conjecture (also known as the Oesterlé-Masser conjecture) is a conjecture in number theory, first proposed by Joseph Oesterlé (1988) and David Masser (1985). It is stated in terms of three positive integers, , and (hence the name) that are relatively prime and satisfy . If denotes the product of the distinct prime factors of , the conjecture essentially states that is usually not much smaller than . In other words: if and are composed from large powers of primes, then is usually not divisible by large powers of primes.
The abc conjecture is well known for the many interesting consequences it entails. Many famous conjectures and theorems in number theory would follow immediately from it. Goldfeld (1996) described the abc conjecture as "the most important unsolved problem in Diophantine analysis."
Several solutions have been proposed. The most recent one is still being evaluated by the mathematical community.
To simplify the rules:
- , , and are positive integers.
- , , and are composed of distinct prime factors.
To illustrate the terms, let , , and . Then , which is greater than .
The goal of this problem is to find the exceptions where , within a given range for , , and .
Input
The first line of input contains (), the number of test cases.
Each of the following lines contains two integers and (), the lower and upper bounds of , , and . The constraints are , and .
Output
For each test case, output one of the following:
- A line "" for each equation that satisfies the criteria above. Sort the lines in ascending order by , and then in ascending order by when several equations share the same .
- A line "No exceptions" if no equation satisfies the criteria.
Each test case is followed by a blank line.