diff --git a/papers/fermat/fermat.tex b/papers/fermat/fermat.tex
index 96ce5fc..2fc11c8 100644
--- a/papers/fermat/fermat.tex
+++ b/papers/fermat/fermat.tex
@@ -165,7 +165,7 @@ For this prime factor to be preserved in the result
 of an addition, it must be in both summed quantities at an equal or greater power (or
 number of duplicates of that prime in the bag).
 %
-Consider two numbers with $11^2$ in one number and $11$ in the other: $bpf(110)=\{11*2*5\}$
+Consider two numbers with $11^2$ in one number and $11$ in the other: $bpf(110)=\{11,2,5\}$
 and $bpf(67639)=\{13,11,11,43\}$. The only common prime factor is 11 once.
 %
 %
@@ -195,7 +195,9 @@ present in the result, i.e. $bpf(126324)=\{2,2,3,3,11,11,29\}$.
 %
 This means for $a+b$ and $a^n+b^n$ the only prime factors  preserved (i.e. in $c^n$)
 are those common to $a$ and $b$.
-
+Another way to look at this is the number of common prime factors is multiplied by
+the addition in the brackets.
+%% BONFIRE OF THE PRIMES:wq
 
 \subsection{Conditions for having a integer root}