robin/Robin_PHD
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

Had put stars into one of the bags instead of commas, old 'C'

Browse Source 
programmer...
This commit is contained in:
Robin Clark 2015-07-06 20:18:47 +01:00
parent 117312cae7
commit 3487ebe5ff
1 changed files with 4 additions and 2 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

6
papers/fermat/fermat.tex
View File

@ -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 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). 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. 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$) 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$. 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} \subsection{Conditions for having a integer root}