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.

Unverified Commit 5167a42c authored by Guangting Yu's avatar Guangting Yu Committed by GitHub
Browse files

Update README.md

general requirements
parent 8312d016
# EulerPowersConjecture
Brute-force approach to generate counterexamples
https://en.wikipedia.org/wiki/Euler%27s_sum_of_powers_conjecture
$$ \sum_{i=1}^{l} a_i^p = b^p $$ with $$ a_i,b\in\mathbb{Z}_{>0} $$
To avoid repetition, we require
$$ gcd(a_1, \cdots, a_l) = 1 $$ and $$ b>a_1 \geq a_2 \geq \cdots a_l $$.
Markdown is supported
0% or .
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment