Skip to content

Commit 49172d1

Browse files
authored
Fix typos (#226)
1 parent 0b71b56 commit 49172d1

File tree

6 files changed

+6
-6
lines changed

6 files changed

+6
-6
lines changed

Diff for: content/geometry/LineProjectionReflection.h

+1-1
Original file line numberDiff line numberDiff line change
@@ -4,7 +4,7 @@
44
* License: CC0
55
* Source: https://vlecomte.github.io/cp-geo.pdf
66
* Description: Projects point p onto line ab. Set refl=true to get reflection
7-
* of point p across line ab insted. The wrong point will be returned if P is
7+
* of point p across line ab instead. The wrong point will be returned if P is
88
* an integer point and the desired point doesn't have integer coordinates.
99
* Products of three coordinates are used in intermediate steps so watch out
1010
* for overflow.

Diff for: content/math/chapter.tex

+1-1
Original file line numberDiff line numberDiff line change
@@ -115,7 +115,7 @@ \subsubsection{Binomial distribution}
115115
$\textrm{Bin}(n,p)$ is approximately $\textrm{Po}(np)$ for small $p$.
116116

117117
\subsubsection{First success distribution}
118-
The number of trials needed to get the first success in independent yes/no experiments, each wich yields success with probability $p$ is $\textrm{Fs}(p),\,0\leq p\leq1$.
118+
The number of trials needed to get the first success in independent yes/no experiments, each which yields success with probability $p$ is $\textrm{Fs}(p),\,0\leq p\leq1$.
119119
\[p(k)=p(1-p)^{k-1},\,k=1,2,\dots\]
120120
\[\mu = \frac1p,\,\sigma^2=\frac{1-p}{p^2}\]
121121

Diff for: content/number-theory/ModLog.h

+1-1
Original file line numberDiff line numberDiff line change
@@ -26,7 +26,7 @@
2626
* So once all exponenents of a that are <= sqrt(m) has been checked, you
2727
* cannot have case 2. Case 2 is the only tricky case.
2828
*
29-
* So the modification allowing for non-coprime input invloves checking all
29+
* So the modification allowing for non-coprime input involves checking all
3030
* exponents of a that are <= n, and then handling the non-tricky cases by
3131
* a simple gcd(a^n,m) == gcd(b,m) check.
3232
*/

Diff for: content/tex/kactlpkg.sty

+1-1
Original file line numberDiff line numberDiff line change
@@ -69,7 +69,7 @@
6969

7070
% Include a list of source files at the top of every page. For the purpose
7171
% of recording those, we use eTeX marks. (We can't just append data directly to
72-
% the header, because TeX outputs pages asynchronously, noticably so when
72+
% the header, because TeX outputs pages asynchronously, noticeably so when
7373
% multicol is in use.) There is no command for getting all marks set on a page,
7474
% so we take only the last one and include all non-included files up until that
7575
% one. Most of the time \splitbotmark will give us the right mark, but in rare

Diff for: content/tex/preprocessor.py

+1-1
Original file line numberDiff line numberDiff line change
@@ -285,7 +285,7 @@ def main():
285285
elif language == "rawpy":
286286
processraw(caption, instream, outstream, 'Python')
287287
else:
288-
raise ValueError("Unkown language: " + str(language))
288+
raise ValueError("Unknown language: " + str(language))
289289
except (ValueError, getopt.GetoptError, IOError) as err:
290290
print(str(err), file=sys.stderr)
291291
print("\t for help use --help", file=sys.stderr)

Diff for: old-unit-tests/geometry/test_lineDistDouble.cpp

+1-1
Original file line numberDiff line numberDiff line change
@@ -38,7 +38,7 @@ class test_lineDistDouble :
3838
stringstream ss;
3939
ss << p1 << " " << p2 << " " << p3;
4040
double r = lineDist(p1,p2,p3);
41-
ss << " expected " << a << " recieved " << r;
41+
ss << " expected " << a << " received " << r;
4242
if (abs(r-a) > 1e-3)
4343
fail(ss.str());
4444
}

0 commit comments

Comments
 (0)