Note: The default ITS GitLab runner is a shared resource and is subject to slowdowns during heavy usage.
You can run your own GitLab runner that is dedicated just to your group if you need to avoid processing delays.

Commit 32a4cf38 by Guangting Yu

### update current minimum b

parent 9255ab91
 ... ... @@ -8,3 +8,14 @@ https://en.wikipedia.org/wiki/Euler%27s_sum_of_powers_conjecture  To avoid repetition, we require $ \mathrm{gcd}(a_1, \cdots, a_l) = 1 $ and $ b>a_1 \geq a_2 \geq \cdots a_l $. If such a solution exists for some length $ l $ and exponent $ p $, we put the minimum $ b `$ in the table. [Fermat's last theorem](https://en.wikipedia.org/wiki/Fermat%27s_Last_Theorem) states that for length=2, exponent>2, there is no solution. ## Current results (min b) | length\ exponent | 2 | 3 | 4 | 5 | 6 | |---------------- |--- |----- |------- |------- |------- | | 2 | 5 | ∞ | ∞ | ∞ | ∞ | | 3 | 3 | 6 | >1024 | >1024 | >1024 | | 4 | 5 | 7 | 353 | 144 | | | 5 | 4 | 4 | 5 | | | | 6 | 3 | 3 | | | | \ No newline at end of file
Markdown is supported
0% or .
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!