Mark/handouts
Mark/handouts
1
0
Fork 0
Code Pull Requests 2 Actions Packages Releases Activity

Minor errors

Browse Source
This commit is contained in:
Mark 2023-10-26 09:42:02 -07:00
parent a460f4f376
commit 1c5addd931
Signed by: Mark
GPG Key ID: AD62BB059C2AAEE4
2 changed files with 2 additions and 2 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
Advanced/Continued Fractions/parts/00 euclidean.tex
View File

@ -28,7 +28,7 @@ $\gcd(ac + b, a) = \gcd(a, b)$
\problem{}
Compute $\gcd(668, 6)$ \hint{$668 = 111 \times 6 + 2$}
Compute $\gcd(668, 6)$. \hint{$668 = 111 \times 6 + 2$}
Then, compute $\gcd(3 \times 668 + 6, 668)$.
\vfill

2
Advanced/Continued Fractions/parts/02 part B.tex
View File

@ -237,7 +237,7 @@ $|\alpha - \frac ab| \geq |\alpha - \frac{p_n}{q_n}|$
\problem{Challenge V}
\problem{Challenge X}
Prove the following strengthening of Dirichlet's approximation theorem.
If $\alpha$ is irrational, then there are infinitely many rational numbers
$\frac{p}{q}$ satisfying $|\alpha - \frac pq| < \frac{1}{2q^2}$.