tomit4/discrete_mathematics_with_applications
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity Actions

🚧 In mid of 5.4

Browse source
This commit is contained in:
tomit4 2026-06-27 17:30:08 -07:00
parent 7446ef3d7d
commit 1662890458
2 changed files with 585 additions and 0 deletions
Download patch file Download diff file Expand all files Collapse all files

6
chapter_5/test_yourself.md
View file

@ -81,12 +81,18 @@ Page 333
1. In a proof by strong mathematical induction the basis step may require
checking a property $P(n)$ for more _____ value of $n$.
than one
2. Suppose that in the basis step for a proof by strong mathematical induction
the property $P(n)$ was checked for every integer $n$ from $a$ through $b$.
Then in the inductive step one assumes that for any integer $k \geq b$, the
property $P(n)$ is true for all values of $i$ from _____ through _____ and
one shows that _____ is true.
$a$; $k$; $P(k + 1)$
3. According to the well-ordering principle for the integers, if a set $S$ of
integers contains at least _____ and if there is some integer that is less
than or equal to every _____, then _____.
one integer; integer in $S$; $S$ contains a least element.