Commit d4634fa2 authored by Guangting Yu's avatar Guangting Yu
Browse files

Update README.md with LaTeX embedding

parent 5167a42c
...@@ -3,6 +3,8 @@ Brute-force approach to generate counterexamples ...@@ -3,6 +3,8 @@ Brute-force approach to generate counterexamples
https://en.wikipedia.org/wiki/Euler%27s_sum_of_powers_conjecture 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} $$ ```math
To avoid repetition, we require \sum_{i=1}^{l} a_i^p = b^p \hspace{1em} a_i,b\in\mathbb{Z}_{>0}
$$ gcd(a_1, \cdots, a_l) = 1 $$ and $$ b>a_1 \geq a_2 \geq \cdots a_l $$. ```
To avoid repetition, we require $` \mathrm{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