Prove that if the integers 1, 2, 3, . . . , 65 are arranged in...
Prove that if the integers 1, 2, 3, . . . , 65 are arranged in
any order, then it is possible to look either left to right or
right to left through the list and find nine numbers that are in
increasing order
Prove that 1^3 + 2^3 + · · · + n^3 = (1 + 2 + · · · + n)^2 for
every n ∈ N. That is, the sum of the first n perfect cubes is the
square of the sum of the first n natural numbers. (As a student, I
found it very surprising that the sum of the first n perfect cubes
was always a perfect square at all.)
Prove these scenarios by mathematical induction:
(1) Prove n2 < 2n for all integers
n>4
(2) Prove that a finite set with n elements has 2n
subsets
(3) Prove that every amount of postage of 12 cents or more can
be formed using just 4-cent and 5-cent stamps
Prove that there exists integers m and n such that 15m + 12n =
3
Please do not prove by assuming m=1 and n=-1, I'd like to prove
by not assuming any actual numbers.