PHL - Math 620 hw1

MATH 620.
00 Sequential Math I
Instructor: Patrick Burke
Pei-Hsin Lins HW1

March 12, 2013
HUNTER COLLEGE OF THE CITY UNIVERSITY OF NEW YORK

Department of Mathematics and Statistics
Math 620: Sec. 001 Spring 2013 Patrick W. Burke, Ph.D.
COVER SHEET AND EVALUATION FORM FOR HOMEWORK SET 1
Pei-Hsin Lin
Name: ______________________________________________________________________________
SECTION
Total
Assigned
Section
Minimum
Exercises Submitted
Credits
2.2
17
11
1, 3, 5, 6, 8, 10, 12, 14, 16,

18, 22, 26, 29, 30, 31, 36, 39
16
2.3
11
2, 3, 8, 11, 17, 23, 26, 27, 33, 35, 36
11
2.6
13
1, 4, 5, 10, 18, 20, 22, 26, 30, 34, 36, 37, 39
13
AP 2.1.1
12
1b, 1c, 2a, 2b, 2c, 3a, 4c, 7, 9a, 9b 11a, 11b
10
2.7
14
2, 4, 5, 7, 10, 14, 25, 26, 31, 32, 33, 36, 37, 38
13
AP 2.1.2
1, 2b, 4, 7
AP 2.1.3
1, 2, 3a, 3b, 4c, 4e, 5b, 7, 9
3.1
8, 11, 14, 16, 17, 20
3.2
17
12
5, 6, 7, 9, 11, 13, 15, 19, 20,

24, 26, 29, 31, 35, 36, 37, 38
17
3.3
7, 8, 11, 12, 13, 14, 16, 21, 22
AP 2.1.4
1b, 1c, 2, 3, 5b, 5d, 6, 8a, 9
TOTAL
121
82
OVERALL PROBLEM SET MINIMUM = 95
110
Points earned: ____________
1 of 40
MATH 620.00 Sequential Math I

Pei-Hsin Lins HW1

March 12, 2013
HEART SECTION 2.2

1.
3.
List the first 15 Fibonacci Numbers.

n
10
11
12
13
14
15
Fn
13
21
34
55
89
144
233
377
610
x=3+
1
x
Verify that 1 +
1+
5.
1
1+ 11
1
1+1
3
2
=1+
1
2
2
2
1
2
2+1
2
3
2
Solve the following equations for x.

x=2+
1
x
x2 = 2x + 1
x2 = 3x + 1
x2 - 2x - 1 = 0
x2 - 3x - 1 = 0
x =
6.
=1+
1
1+ 11
( 2)
2) 2 4(1)( 1)
2(1)
2 22
2
=1
x =
( 3)
3) 2 4(1)( 1)
2(1)
3 13
2
Suppose we have a pair of baby rabbits: one male and one female. Let us assume that rabbits
cannot reproduce until they are one month old and that they have a one-month gestation
period. Once they start reproducing, they produce a pair of bunnies each month (one of each
sex). Assuming that no pair ever dies, how many pairs of rabbits will exist in a particular
month? (Fn = Fn-1 + Fn-2 )
Time in Months
Start
Number of Pairs
13
21
2 of 40

Pei-Hsin Lins HW1

March 12, 2013
HEART SECTION 2.2

Determine a simple formula for (Fn+1 )2 + (Fn)2 ; that is, a formula for the sum of the squares of
8.
two consecutive Fibonacci numbers.

n
Fn
13
21
(Fn+1 )2 + (Fn)2
2 = F3
5 = F5
13 = F7
34 = F9
89 = F11
233 = F13
610 = F15
1597 = F17
Based on the pattern above, (Fn+1 )2 + (Fn )2 = F2n+1 .

10.
Suppose we build a sequence of numbers using the method of adding the previous two numbers
to build the next one. This time, however, suppose our first two numbers are 2 and 1. Generate
the first 15 terms. This sequence is called the Lucas sequence and is written as L1 , L2 , L3 ,... .
Compute the quotients of consecutive terms of the Lucas sequence. What number do these
quotients approach? What role do the initial values play in determining what number the
quotients approach? Try two other first terms and generate a sequence. What do the quotients
approach?
n
10
11
12
13
14
15
Ln
11
18
29
47
76
123
199
322
521
843
Pn
14
23
37
60
97
157
254
411
665
1076
Ln+1 /Ln for n = 1 through n = 14:

0.5 3 1 .3 1.75 1 .571428 1 .63 1 .61 1.620689655... 1.6170212777...
1.618421053... 1.617886179... 1.618090452... 1.618012422... 1.618042226...
Ln+1 /Ln approaches the golden mean,
1+5
2
Pn+1 /Pn for n = 1 through n = 14:

0 .3 4 1.25 1.8 1 .5 1 .64285714 1.608695652... 1.621621622... 1 .616
1.618556701... 1.617834395... 1.618110236... 1.618004866... 1.618045113...
Pn+1 /Pn also approaches the golden mean,
1+5
2
3 of 40

Pei-Hsin Lins HW1

March 12, 2013
HEART SECTION 2.2

12.
Determine a formula for Fn-1 + Fn+1 .

n
10
11
12
13
14
15
Fn
13
21
34
55
89
144
233
377
610
Fn-1 + Fn+1
11
18
29
47
76
123
199
322
521
843
1364
Based on the pattern above, Fn-1 + Fn+1 = Ln+1 .

14.
Determine a formula for Fn + Ln.

n
10
11
12
13
14
15
Fn
13
21
34
55
89
144
233
377
610
Ln
11
18
29
47
76
123
199
322
521
843
Fn + Ln
12
19
31
50
81
131
212
343
555
898
1453
Based on the pattern above, Fn + Ln = 2Fn - Fn-2 .

16.
Express each of the following natural numbers as a sum of distinct, non-consecutive Fibonacci
numbers: 52, 143, 13, 88.
52 = 34 + 13 + 5
143 = 89 + 34 + 13 + 5 + 2
13 8 + 3 + 1
(impossible)
88 = 55 + 21 + 8 + 3 + 1
18.
Suppose you are about to play a game of Fibonacci nim. You start with 50 sticks. What is your
first move?
My first move would be to take 16 sticks. This would leave 34 sticks, and restrict my opponent to
taking 32 or fewer sticks on their move. If my opponent then took 11 sticks, leaving 23, I would
take 7, leaving 16. If my opponent then took 5 sticks, leaving 11, I would take 3 sticks, leaving
8. If my opponent then took 2 sticks, leaving 6, I would take 1 stick, leaving 5. If my opponent
then took 1 stick, leaving 4, I would take 1 stick, leaving 3. Then if my opponent took either 1
or 2 sticks, I would win by taking the remaining 1 or 2 sticks.
4 of 40

Pei-Hsin Lins HW1

March 12, 2013
HEART SECTION 2.2

22.
Suppose you are playing a round of Fibonacci nim with a friend. The game begins with 50
sticks. You start by removing three sticks; your friend then takes five; you then take eight;
your friend then takes ten. How many sticks should you take next to win?
50 - 3 - 5 - 8 - 10 = 24 sticks
I would take 7 sticks next, leaving 17 sticks.
24 - 7 - 5 - 3 - 2 - 2 = 5 sticks, which forces a first-player win (cf. my solution to II.18).
26.
Determine a formula for Fn+1 Fn-1 - (Fn)2 . (Hint: The answer will be different depending on
whether n is even or odd. Consider examples of different cases separately.)
n
Fn
13
21
Fn+1 Fn-1 - (Fn)2
-1
-1
-1
Based on the pattern above, Fn+1 Fn-1 - (Fn )2 = (-1)n .

29.
Evaluate each number in the top row and record the answer in the bottom row.
Number
Estimate
1.414213562
F3
F1
2
1
F4
F2
3
1
1.732050808
As n gets larger and larger,
F5
F3
5
2
1.58113883
F n+2
Fn
F6
F4
8
3
1.632993162
F7
F5
13
5
1.61245155
21
8
1.620185175
appears to approach the golden mean,
5 of 40
F8
F6
1+5
2
F9
F7
34
13
1.61721508

Pei-Hsin Lins HW1

March 12, 2013
HEART SECTION 2.2

30.
Write out the first 15 terms of the Tribonacci sequence, starting with the first 1, using the
numbers 0, 0, 1 and generating future numbers by adding up the previous three numbers.
Evaluate the value of the quotients of consecutive terms, dividing the smaller term into the
larger one. Do the quotients seem to be approaching a fixed number?
n
10
11
12
13
14
15
Tn
13
24
44
81
149
274
504
927
1705
3136
Tn+1 /Tn for n = 1 through n = 14:

1 2 2 1.75 1 .857142 1.846153846... 1 .83 1 .8409 1.839506173... 1.838926174...
1.839416058... 1.839285714... 1.839266451... 1.839296188...
3
Tn+1 /Tn approaches the tribonacci constant,
1+ 19+3 33 +19 333

3
This number is a root of the polynomial x3 - x2 - x - 1.

31.
Suppose you are playing a round of Fibonacci nim with a friend. You start with 15 sticks. You
start by removing 2 sticks; your friend then takes 1; you take 2; your friend takes 1. What
should your next move be? Can you make it without breaking the rules of the game? Did you
make a mistake at some point? If so, where?
15 - 2 - 1 - 2 - 1 = 9 sticks
I would take 2 sticks next, leaving 7 sticks. But then if my friend takes 2 sticks, it forces a
second-player win (cf. my solution to II.18). The mistake I made was taking 2 sticks the
previous turn, leaving 10 sticks. I should have taken 3 sticks at that point, leaving 9 sticks.
36.
Is it possible for a Fibonacci number greater than 2 to be exactly twice as big as the Fibonacci
number immediately preceding it? Explain why or why not. What would your answer be if we
removed the phrase greater than 2?
It is not possible for a Fibonacci number greater than 2 to be exactly twice as big as the Fibonacci
number preceding it, because that would imply that the two consecutive Fibonacci numbers
preceding it were exactly the same in size. This only occurs at the very beginning of the
Fibonacci sequence. If the phrase greater than 2 were removed, then F3 = 2 would be the
obvious answer, since it is exactly twice as big as F2 = 1.
6 of 40

Pei-Hsin Lins HW1

March 12, 2013
HEART SECTION 2.2

39.
Let Gn be the generalized Fibonacci sequence starting with 0 and 1, where Gn+1 = 2Gn + Gn-1 .
Can every natural number be expressed as the sum of distinct, non-consecutive generalized
Fibonacci numbers? Show why, or give several counterexamples. What if you were allowed to
use consecutive generalized Fibonacci numbers? Do you think you could do it then? Illustrate
your hunch with four or five specific examples.
10
11
12
13
14
15
Gn
12
29
70
169
408
985
2378
5741
13860
33461
80782
Many numbers, including 9, 10, 11, 27, and 28, cannot be expressed either as the sum of
distinct, non-consecutive generalized Fibonacci numbers, or the sum of distinct consecutive
generalized Fibonacci numbers.
7 of 40

Pei-Hsin Lins HW1

March 12, 2013
HEART SECTION 2.3

2.
Express each of the following numbers as a product of primes: 6, 24, 27, 35, 120.
6 = 23
24 = 2 3 3
27 = 3 3
35 = 57
120 = 2 3 35
3.
If n is an odd number greater than or equal to 3, can n + 1 ever be prime? What if n equals 1?
If n is an odd number greater than or equal to 3, n + 1 is an even number greater than 3, so n 2,
which is the only even prime number. Therefore, n + 1 cannot ever be prime. However, if n = 1,
then n + 1 = 2, which is a prime number.
8.
Does a prime multiplied by a prime ever result in a prime? Does a nonprime multiplied by a
nonprime ever result in a prime? Always? Sometimes? Never? Explain your answers.
A natural number greater than 1 is a prime number if it cannot be expressed as the product of two
smaller natural numbers. Then by definition, a prime multiplied by a prime never results in a
new, larger prime. Likewise, a nonprime multiplied by a nonprime never results in a new, larger
prime.
11.
Are there infinitely many natural numbers that are not prime? If so, prove it.
Yes, there are infinitely many natural numbers that are composite. It is simple to generate new,
larger composite numbers by multiplying together the largest numbers already enumerated.
17.
Consider the following sequence of natural numbers made up of 0s and 1s: 11, 101, 1001,
10001, 100001, 1000001, 10000001... Are all these numbers prime? If not, find the first such
number that is not prime and express it as a product of prime numbers.
1001 = 71113
23.
Suppose a number when divided by 13 yields a remainder of 7. What is the smallest number we
would have to subtract from our original number to have a number with a factor of 13?
Since some number p = 13q + 7, the smallest number we would have to subtract is 7, to have a
number p - 7 = 13q, which has a factor of 13 by definition.
8 of 40

Pei-Hsin Lins HW1

March 12, 2013
HEART SECTION 2.3

26.
Suppose we have two numbers that both have the same remmainder when divided by 57. If we
subtract the two numbers, are there any numbers that we know will definitely divide evenly into
this difference? What is the largest number that we are certain will divide into the difference?
Use this observation to state a general principle about two numbers that have the same
remainder when divided by another number.
Say we have a number 57p + r and a number 57q + r. Then the difference between the two
numbers would be (57p + r) - (57q + r) = (57p - 57q) = 57(p - q). Then all the factors of 57
definitely divide evenly into this difference, including 3, 19, and 57. 57 is the largest number
that certainly divides into the difference.
Whenever two numbers have the same remainder when divided by another number, the
difference must be evenly divisible by that other number.
27.
Write out the first 15 primes all on one line. On the next line, underneath each pair, write the
difference between the larger number and the smaller number in the pair. Continue in this
manner. What would you guess is the pattern for the sequence of numbers appearing in the
first entry of each line? The actual answer is not known. It remains an open question! What
do you think?
2 3 5 7 11 13 17 19 23 29 31 37 41 43 47
1 2 2 4 2 4 2 4 6 2 6 4 2 4
1 0 2 2 2 2 2 2 4 4 2 2 2
1 2 0 0 0 0 0 2 0 2 0 0
1 2 0 0 0 0 2 2 2 2 0
1 2 0 0 0 2 0 0 0 2
1 2 0 0 2 2 0 0 2
1 2 0 2 0 2 0 2
1 2 2 2 2 2 2
1 0 0 0 0 0
1 0 0 0 0
1 0 0 0
1 0 0
1 0
1
I think that sequence of numbers appearing in the first entry of each line is a 2 followed by an
infinite number of 1s.
9 of 40

Pei-Hsin Lins HW1

March 12, 2013
HEART SECTION 2.3

33.
Let A and B be two natural numbers. Suppose that, when A is divided by n, the remainder is a
and when B is divided by n the remainder is b. How does the remainder when A + B is divided
by n compare with the remainder when a + b is divided by n? Try some specific examples first.
Can you prove your answer?
Say A = np + a and B = nq + b. Then A + B = n(p + q) + (a + b).
Say (a + b) has the remainder r when divided by n, such that (a + b) = nx + r.
Then (A + B) = n(p + q) + (nx + r) = n(p + q + x) + r.
Thus (A + B) and (a + b) have the same remainder r when divided by n.
35.
Find a run of 6 consecutive natural numbers, none of which is a prime number. (Hint: Prove
that you can start with 7! + 2.)
5042 = 22521
5043 = 341 2
5044 = 2 2 1397
5045 = 51009
5046 = 2329 2
5047 = 7 2 103
36.
Using Problem 35, show that for a given number, there exists a run of that many consecutive
natural numbers, none of which is a prime number.
For a given number n, there exists a run of n consecutive natural numbers, none of which is a
prime number. Specifically, by definition,
(n! + 2) is divisible by 2.
(n! + n - 2) is divisible by (n - 2).

(n! + n - 1) is divisible by (n - 1).
(n! + n) is divisible by n.
10 of 40

Pei-Hsin Lins HW1

March 12, 2013
HEART SECTION 2.6

1.
What is the definition of a rational number?

A rational number is a number that can be written in the form ab , where a, b and b 0.
4.
Show that each of the decimal numbers below is actually a rational number by expressing it as a
ratio of two integers.
Decimal
0.02
6.23
2.71828
-168.5
-0.00005
Ratio
1 : 50
623 : 100
67957 : 25000
-337 : 2
-1 : 20000
5.
Square the numbers from 1 to 12. Do the even numbers have even squares? Do the odd
numbers have odd squares? Make a conjecture based on your observations.

n
10
11
12
n2
16
25
36
49
64
81
100
121
144
Conjecture: All even numbers have even squares, and all odd numbers have odd squares.
10.
Prove that 5 is irrational.

Assume that 5 is rational.
Then 5 =
Then 5 =
p2
q2
p
q
for some p, q . w.l.o.g., (p, q) = 1.
5q 2 = p 2 5 | p 2 , 5 is prime 5 | p p = 5n for some n
p 2 = 25n 2 5q 2 = 25n 2 q 2 = 5n 2 5 | q 2 , 5 is prime 5 | q (p, q) = 5.

This contradicts the previous assumption that (p, q) = 1.
We conclude that the assumption that 5 is rational is false, i.e. 5 is irrational.
18.
Suppose that E is the number such that 13 E = 8. Show that E is an irrational number.
Given 13 E = 8, assume that E is rational.
Then E =
p
q
p
q
for some p, q . w.l.o.g., (p, q) = 1.

q
Then 13 = 8 13 p = 8 q = (2 3 ) = 2 3q .
But the only prime factor of the left side is 13, and the only prime factor on the right side is 2.
This is a contradiction, since 2 divides 2 3q but not 13 p , and 13 divides 13 p but not 2 3q .
Then the assumption that E is rational must be false. That is, E is irrational.
11 of 40

Pei-Hsin Lins HW1

March 12, 2013
HEART SECTION 2.6

20.
Suppose that E is the number such that 8 E = 4. If possible, show that E is a rational number. In
Problem 18, you developed an argument that showed that an exponent was irrational. Where
does that argument break down in this case?
Given 2 3E = 8 E = 4 = 2 2 , 3E = 2 and E = , which is a rational number. This problem differs from
Problem 18 because 8 and 13 share none of their prime factors, while 8 and 4 share all of their
prime factors.
22.
Show that the sum of any two rational numbers is another rational number. (Hint: Let a/b be
one rational number and c/d be the other. Now show that a/b + c/d is another rational number.)
Let ab and dc be rational numbers, where a, b, c, d and b 0, d 0.
Then
a
b
c
d
ad+bc
bd
where (ad + bc), bc , since the integers are closed under addition and
multiplication, and b 0, d 0 bd 0. Then
26.
a
b
c
d
is also a rational number.
Using the fact that is irrational, show that + 3 is also irrational.

Assume that + 3 is rational. Then + 3 = ab , where a, b and b 0.
Then =
a
b
3=
a 3b
b
, where (a - 3b) , since the integers are closed under subtraction and
multiplication. Then would be a rational number, which contracts the fact that is irrational.
Therefore the assumption that + 3 is rational must be false. That is, + 3 is irrational.
30.
Show that 2 is irrational.

3
Assume that 2 is rational. Then 2 =

3
Then 2 =
p3
q3
p
q
, where p, q . w.l.o.g. (p, q) = 1.
2q 3 = p 3 2 | p 3 , 2 is prime 2 | p p = 2n for some n
p 3 = (2n)3 = 8n 3 2q 3 = 8n 3 q 3 = 4n 3 4 | q 2 | q (p, q) = 2.
This contradicts the previous assumption that (p, q) = 1.
We conclude that the assumption that 2 is rational must be false. That is, 2 is irrational.
3
12 of 40

Pei-Hsin Lins HW1

March 12, 2013
HEART SECTION 2.6

34.
Does an irrational number multiplied by an irrational number equal an irrational number? If

so, show why. If not, give some counterexamples.
Obvious counterexamples of irrational numbers whose product is rational include,
2 2 = 2 and 3 12 = 6 .
36.
Show that for any prime number p, p is an irrational number.

Assume that p is a rational number.
a
b
Then p =
Then p =
a2
2
b
where a, b . w.l.o.g. (a, b) = 1.
pb 2 = a 2 p | a 2 , p is prime p | a
a = pn for some n a 2 = p 2 n 2 pb 2 = p 2 n 2 b 2 = pn 2 p | b 2 , p is prime p | b.

Then (a, b) = p, but this contradicts the previous assumption that (a, b) = 1.
Thus the assumption that p is a rational number must be false. That is, p is irrational.
37.
Show that, for any two different prime numbers p and q, pq is an irrational number.
Assume that pq is a rational number, where p and q are prime and p q.
Then pq =
Then p q =
a2
b2
a
b
where a, b . w.l.o.g. (a, b) = 1.
pqb 2 = a 2 p | a 2 , p is prime, and q | a 2 , q is prime p | a and q | a
a = pqn for some n a 2 = p 2 q 2 n 2 pqb 2 = p 2 q 2 n 2 b 2 = pqn 2

p | b 2 , p is prime, and q | b 2 , q is prime p | b and q | b (a, b) = pq.
This contradicts the previous assumption that (a, b) = 1.
Thus the assumption that pq is a rational number must be false. That is, pq is irrational.
39.
4 is equal to 2, which is rational. Carefully modify the argument for showing that 2 is
irrational to try to show that 4 is irrational. Where / why does the argument break down?
Assume that 4 is rational.
Then 4 =
Then 4 =
p2
q2
p
q
for some p, q and q 0. w.l.o.g., (p, q) = 1.
4q 2 = p 2 4 | p 2 , but 4 is not prime, so we cannot conclude that 4 | p, and the
proof cannot proceed in the same manner as before.
13 of 40

Pei-Hsin Lins HW1

March 12, 2013
AP SECTION 2.1.1
1B.
Write
35789.22
47.6
as the product of two integers. If this number can be written as a mixed number,
identify its integer part and fractional part in lowest terms.

35789.22
47.6
1C.
3578922
4760
1789461
2380
= 7 51 2081
2380
Write ??? as the product of two integers. If this number can be written as a mixed number,
identify its integer part and fractional part in lowest terms.
2A.
2B.
Give examples that floor( x +
1
10
) = floor( x ) is not true for all positive rational numbers x.
floor( 0 .99 +
1
10
) = 1
floor(0.99) = 0
floor( 1 .98 +
1
10
) = 2
floor(1.98) = 1
Give examples that floor( x ) + floor( y ) = floor( x + y ) is not true for all positive rational
numbers x and y.
floor(1.3) + floor(1.75) = 1 + 1 = 2
floor(1.3 + 1.75) = floor(3.05) = 3
floor(2.2) + floor(5.9) = 2 + 5 = 7
floor(2.2 + 5.9) = floor(8.1) = 8
2C.
Give examples that ??? is not true for all positive rational numbers x and y.
3A.
Write
3 + 7
3 + 7
4C.
27 as the quotient of two integers.
27 =
3 + 7
(7
1 ) = 4 =
2
1
Prove Theorem 2.1(b): The set - {0} of nonzero rational numbers is closed under division.
Let ab and dc be nonzero rational numbers, where a, b, c, d and a 0, b 0, c 0, d 0.
Then
a
b
c
d
a
b
d
c
ad
bc
, and ad, bc and ad 0, bc 0.
Thus the set - {0} of nonzero rational numbers is closed under division.
14 of 40

Pei-Hsin Lins HW1

March 12, 2013
AP SECTION 5.2.1
7.
Modify the proof of Theorem 2.2 to show that the positive nth root of any prime is irrational.
n
Assume
p is a positive rational number. p is prime.
n
Then
p=
Then p =
an
n
b
a
b
for some a, b . w.l.o.g. (a, b) = 1.
pb n = a n p | a n , p is prime p | a
Then a = pm for some m a n = p n mn pb n = p n mn b n = p n-1 mn

Then p | b n , p is prime p | b (a, b) = p.
This contradicts the previous assumption that (a, b) = 1.
n
n
Thus the assumption that
p is a rational number must be false. That is,
p is irrational.
9A.
Let s be a nonzero rational number and v be irrational. Prove that s - v is irrational.

Let s be a nonzero rational number, i.e., s =
a
b
for some a, b , a 0, b 0. w.l.o.g. (a, b) = 1.
Let v be irrational. Assume that s - v is rational, i.e., s

Then
a
b
v=
c
d
and v =
a
b
c
d
ad bc
bd
v=
c
d
for some c, d and d 0.
for some (ad - bc), bd and bd 0.
Then v would be rational, which contradicts the fact that v is irrational.

Then the assumption that s - v is rational must be false. That is, s - v is irrational.
9B.
Let s be a nonzero rational number and v be irrational. Prove that sv is irrational.

Let s be a nonzero rational number, i.e., s =
a
b
for some a, b , a 0, b 0. w.l.o.g. (a, b) = 1.
Let v be irrational. Assume that sv is rational, i.e., sv =

Then
a
b
v=
c
d
and v =
c
d
b
a
bc
ad
c
d
for some c, d and d 0.
for some ad, bc and ad 0.
Then v would be rational, which contradicts the fact that v is irrational.

Then the assumption that sv is rational must be false. That is, sv is irrational.
15 of 40

Pei-Hsin Lins HW1

March 12, 2013
AP SECTION 5.2.1
11A.
Prove that if a, b, c and b 2

Given a, b, c and b 2
4 ac , then
4 ac . Assume
b 2
4ac
2a
b 2
2a
4ac
is irrational.
Since the nonzero rational numbers are closed under addition, subtraction, and multiplication,
this implies that
multiplication, b 2
b2
4 ac .
4 ac . But the square root of an integer is either integral or irrational
(Theorem 2.2). Given that b 2
4 ac b 2
which implies that the assumption
11B.
Since the integers are closed under subtraction and
b 2
2a
4ac
4 ac . This is produces a contradiction,
is false. That is,
b 2
2a
4ac
Give a specific example of a quadratic equation whose solutions are proved irrational by
applying the result of Problem 11A.
x2 + x + 1 = 0, where a, b, c , and b 2
4 ac .
16 of 40

Pei-Hsin Lins HW1

March 12, 2013
HEART SECTION 2.7

2.
Simplify each of the following expressions.

10(3.14) = 31.4
1000(0.123123...) = 123.123... = 1 23.123
10(0.4999...) = 4.999... = 4 .9
98.6
100
= 0 .986
0.333...
10
4.
= 0 .0333... = 0 .03
Suppose M = 0.4999... Then what does 10M equal? Find two expressions for the quantity 10M -
M and set those two expressions equal to each other. (Hint: One expression is simply 9M.) Can
you solve your equation to discover something marvelous about M?
M = 0.4999...
10M = 4.999...
9M = 10M - M = (4.999...) - (0.4999...) = 4.5
M = 4.5 9 = 0.5
In other words, M = 0.4999... = 0.5
5.
Explain what it means for a number to be irrational.

An irrational number cannot be written as the indicated quotient of two integers. In decimal
form, the number continues infinitely without any kind of periodic pattern of repetition.
7.
The 5 has an unending decimal expansion, but it might eventually repeat. T or F? Explain.
If the decimal representation of 5 ever repeated, then it could be algebraically converted into a
fraction using the same method as in Problem 4, and thus it would be a rational number. Yet it
was proven in Section 2.6 Problem 10 that 5 is an irrational number. Hence, the given
statement is definitely false.
10.
Describe an irrational number that is bigger than 5.7 but smaller than 5.72.
5.7 < x < 5.72, x
570 < 100x < 572 x could be equal to
571
10
17 of 40

Pei-Hsin Lins HW1

March 12, 2013
HEART SECTION 2.7

14.
Express 67 in its decimal expansion.

6
7
= 0 .857142
25.
Show that the number 0.0100100010000100000100000010000000100... is irrational.
26.
Let Fn be the collection of all rational numbers between 0 and 1 (we write 0 as 0/1 and 1 as 1/1)
whose numerators and denominators do not exceed n. Fn is called the nth Farey fractions. List
F4 , F5 , F6 , F7 , and F8 . Make a large number line segment between 0 and 1 and write in the
Farey fractions. How can you generate F8 using F7 ? Generalize your observations and
describe how to generate Fn. (Hint: Try adding fractions a wrong way.)
F 1 = { 01 , 11 }
F 2 = { 01 , 12 , 11 }

F 3 = { 01 , 13 , 12 , 23 , 11 }

F 4 = { 01 , 14 , 13 , 12 , 23 , 34 , 11 }

F 5 = { 01 , 15 , 14 , 13 , 25 , 12 , 35 , 23 , 34 , 45 , 11 }

F 6 = { 01 , 16 , 15 , 14 , 13 , 25 , 12 , 35 , 23 , 34 , 45 , 56 , 11 }

F 7 = { 01 , 17 , 16 , 15 , 14 , 27 , 13 , 25 , 37 , 12 , 47 , 35 , 23 , 57 , 34 , 45 , 56 , 67 , 11 }

F 8 = { 01 , 18 , 17 , 16 , 15 , 14 , 27 , 13 , 38 , 25 , 37 , 12 , 47 , 35 , 58 , 23 , 57 , 34 , 45 , 56 , 67 , 78 ,

18 of 40
1
1

Pei-Hsin Lins HW1

March 12, 2013
HEART SECTION 2.7

31.
Is it possible to build an irrational number whose decimal digits are just 1s and 2s? If so,
describe such a number and show why its irrational. If not, explain why.
0.1211211121111211111211111121111111211... is an irrational number, in which each nth 2
is preceded by n 1s. It continues infinitely without repetition and has no equivalent fractional
representation.
32.
Is it possible to build an irrational number whose decimal digits are just 1s and 2s and only
finitely many 2s appear? If so, describe such a number and show why its irrational. If not,
explain why.
It is not possible to build such an irrational number because if only finitely many 2s appear,
once that number of 2s has been included, the remaining digits would be repeating 1s. The
resulting number would be a delayed-periodic decimal, which is rational and has a corresponding
fractional representation.
33.
Suppose you are just a point and are standing on the number line at 1 but are dreaming of 0.
You take a step to the point , the midpoint between 0 and 1. You proceed to move closer to 0
by taking a step that is half of the previous one. You continue this process again and again.
Will you ever land on 0? Explain. Is this observation hard to accept?
By following the method described, one will never land on 0. Each step will traverse half of the
remaining distance, never all of the remaining distance. However, the distance remaining will
become infinitesimally small and approach a limit of 0.
36.
Find a real number that has an unending and non-repeating decimal expansion, with the
property that if you square the number, the decimal expansion of the squared number
terminates.
The real number
6
2
= 1 .224744871... , but the decimal expansion of the square of that number
is 1.5, which terminates.
19 of 40

Pei-Hsin Lins HW1

March 12, 2013
HEART SECTION 2.7

37.
Show that, between any two different real numbers, there is always a rational number.
Given any two numbers a, b , a < b b - a > 0 and 1 > 0.
By the Archimedean property of the real numbers,
there exists some integer m such that 1 < m(b - a) ma + 1 < mb.
Let n be the largest integer such that n ma n + 1 ma + 1 < mb.
Also ma < n + 1 (since otherwise n + 1 would have been the largest integer).
Therefore ma < n + 1 < mb a < n+1
m < b.
Thus
38.
n+1
m
is a rational number between the real numbers a and b, as desired.
Show that, between any two different real numbers, there is always an irrational number.
Given any two numbers a, b , a < b b - a > 0 and 2 > 0.
By the Archimedean property of the real numbers,
there exists some integer m such that 2 < m(b - a) ma + 2 < mb.
Let n be the largest integer such that n ma n + 2 ma + 2 < mb.
Also ma < n + 2 (since otherwise n + 1 would have been the largest integer).
Therefore ma < n + 2 < mb a < n+2
m < b.
Thus
n+2
m
is an irrational number between the real numbers a and b, as desired.
20 of 40

Pei-Hsin Lins HW1

March 12, 2013
AP SECTION 2.1.2
1.
2B.
Find decimals representing the rational numbers

21
20
= 1 .05
20
21
= 0 .952380
21
20
and
20
21
Suppose that x is a rational number represented by the finite decimal D.d 1 d 2 ...d k-1 d k and the
infinite decimal D.d 1 d 2 ...d k-1 d k 0000... What other infinite decimal represents x?
x may also be represented by the infinite decimal D.d 1 d 2 ...d k-1 (d k-1)99999...
4.
Find the first three decimal places of 7 using only multiplication.

2 = 4 < 7 < 9 = 3
2.6 = 6.76 < 7 < 7.29 = 2 .7
2.64 = 6.9696 < 7 < 7.0225 = 2 .65
2.645 = 6.996025 < 7 < 7.001316 = 2 .646
therefore 7 2.645...
7.
Suppose that p and q are positive integers and that a =
p
q
. Explain why long division of p by q
results in the decimal representation of a. (Hint: It is enough to explain why the decimal d = [D,
d 1 , d 2 , d 3 , , d k , ] produced by long division satisfies, for all k ,
d
D + 101 + ... + 10kk a < D + 101 + ... + 10kk +
21 of 40
1
10 k

Pei-Hsin Lins HW1

March 12, 2013
AP SECTION 2.1.3
1.
Predict the general form of the decimal representations of the reciprocals of the integers 17 to
41; that is, the type as well as the period and delay if the type is periodic.
Decimal
Fraction
Factorization
Type
t = ? and/or p = ?
0 .0588235294117647
1/17
17
SP
p = 16; cyclic
0 .05
1/18
2 3 2
DP
t = 1, p = 1
0 .052631578947368421
1/19
19
SP
p = 18; cyclic
0.05
1/20
2 2 5
0 .047619
1/21
3 7
SP
p = 6
0 .045
1/22
2 11
DP
t = 1, p = 2
0 .0434782608695652173913
1/23
23
SP
p = 22; cyclic
0 .0416
1/24
2 3 3
DP
t = 3, p = 1
0.04
1/25
52
0 .0384615
1/26
2 13
DP
t = 1, p = 6
0 .037
1/27
33
SP
p = 3
0 .03571428
1/28
2 2 7
DP
t = 2, p = 6
very long decimal
1/29
29
SP
p = 28; cyclic
0 .03
1/30
2 3 5
DP
t = 1, p = 1
1/31
31
SP
0.03125
1/32
25
0 .03
1/33
3 11
SP
p = 2
1/34
2 17
DP
0 .0285714
1/35
5 7
DP
t = 1, p = 6
0 .027
1/36
2 2 3 2
DP
t = 2, p = 1
0 .027
1/37
37
SP
p = 3
1/38
2 19
DP
0 .025641
1/39
3 13
SP
p = 6
0.025
1/40
2 3 5
0 .02439
1/41
41
SP
p = 5
22 of 40

Pei-Hsin Lins HW1

March 12, 2013
AP SECTION 2.1.3
2.
Explain why, if
m
n
is a rational number between 0 and 1, and if m and n are relatively prime,
then the type of the decimal representation of
m
n
is independent of m. (Hint: Consider the three
types of decimal representations separately.)
3A.
The rational number
1
19
has decimal representation 0 .052631578947368421 . This can be
verified by a pencil and paper application of the Division Algorithm, but this is laborious. It
would be nice to be able to do this on a calculator, but many calculators show only 6 or 7 digits.
Find a method for using a calculator to piece together the full 18 digits of the period of
1 = 0.052631578(19) + (1.810 -8 )
1.810 -8 = (9.473684210 -10 )(19) + (2.010 -17 )
2.010 -17 = (1 10 -18 )(19) + (110 -18 ) repeat starts here
110 -18 = (5.2631578 10 -20 )(19) + (1.810 -26 )
Thus 1 = (0.052631578 + 9.473684210 -10 + 1 10 -18 )(19) + (1.8 10 -26 )
= (0.052631578947368421)(19) + (1.8 10 -26 )
and
1
19
= 0 .052631578947368421 .
23 of 40
1
19

Pei-Hsin Lins HW1

March 12, 2013
AP SECTION 2.1.3
3B.
Find the decimal representation of
12
71
12 = 0.169014084(71) + (3.610 -8 )
3.610 -8 = (5.070422510 -10 )(71) + (2.510 -16 )
2.510 -16 = (3.521126710 -18 )(71) + (4.310 -24 )
4.310 -24 = (6.056338010 -26 )(71) + (2.010 -32 )
2.010 -32 = (2.816901410 -34 )(71) + (6.010 -41 )
6.010 -41 = (08.450704210 -43 )(71) + (1.810 -49 )
1.810 -49 = (2.535211210 -51 )(71) + (4.810 -57 )
4.810 -57 = (6.760563310 -59 )(71) + (5.710 -65 )
5.710 -65 = (8.02810 -67 )(71) + (1.210 -69 ) repeat starts here
Thus 12 = (0.169014084 + 5.070422510 -10 + 3.521126710 -18 + 6.056338010 -26 +
2.816901410 -34 + 08.450704210 -43 + 2.535211210 -51 + 6.760563310 -59 + 8.02810 -67 )(71) +
(1.210 -69 ) =
(0.1690140845070422535211267605633802816901408450704225352112676056338028)(71)
+ (1.210 -69 ) and
12
71
4C.
= 0 .1690140845070422535211267605633802816901408450704225352112676056338028
Consider those reciprocals of primes that have simple-periodic decimal representations. Using
the theorems of the section, prove that, of these, there is exactly 1 with period 3. What is it?
999 = 3 3 37

1
37
27
999
= 0 .027 with p = 3.
Because of the primes in 999, the only other possibility would be 13 , which has p = 1.
4E.
Consider those reciprocals of primes that have simple-periodic decimal representations. Using
the theorems of the section, prove that, of these, there are exactly 2 with period 5. What are
they?
99999 = 3 2 41271

1
41
1
271
2439
99999
369
99999
= 0 .02439 with p = 5.
= 0 .00369 with p = 5.
Because of the primes in 99999, the only other possibility would be 13 , which has p = 1.
24 of 40

Pei-Hsin Lins HW1

March 12, 2013
AP SECTION 2.1.3
5B.
Consider those reciprocals of integers that have simple-periodic decimal representations. Using
the theorems of the section, prove that, of these, there are exactly 3 with period 2. What are
they?
99 = 3 2 11

1
11
9
99
= 0 .09 with p = 2.
1
33
3
99
= 0 .03 with p = 2.
1
99
= 0 .01 with p = 2.
Because of the primes in 99, the only other possibilities would be 13 and 19 , which have p = 1.
7.
Find the prime factorization of integers of the form 10 p - 1 for p = 1 to 7. What is the relevance
of these factorizations to the behavior of decimal representations?
10 1 - 1 = 9 = 3 2 13 and 19 are simple-periodic with p = 1.
10 2 - 1 = 99 = 3 2 11
1
11
10 3 - 1 = 999 = 3 3 37
1
33
1
27
, and
1
37
10 4 - 1 = 9999 = 3 2 11101
1
99
1
, 111
,
1
101
are simple-periodic with p = 2.

1
333
1
303
1
, 999
1
, 909
,
1
1111
1
, 3333
,
1
9999
10 5 - 1 = 99999 = 3 2 41271

1
41
1
123
1
, 271
,
1
369
1
, 813
,
1
2439
1
11111
1
, 99999
10 6 - 1 = 999999 = 3 3 7111337
17 ,
1
13
1
, 21
,
1
27
1
1
, 39
, 63
,
1
77
1
, 91
,
1
117
1
1
, 143
, 189
,
1
231
1
, 259
,
1
273
1
, 297
, etc.

10 7 - 1 = 9999999 = 3 2 2394649

1
239
1
717
1
, 2151
,
1
4649
1
, 13847
,
1
41841
1
1111111
1
, 3333333
,
1
9999999

9.
Prove the ( ) direction of Theorem 2.5: If x =

x has a terminating decimal representation.
25 of 40
M
10 t
and M is an integer not divisible by 10, then

Pei-Hsin Lins HW1

March 12, 2013
HEART SECTION 3.1

8.
The following are two collections of the symbols @ and :
@ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @

Are there more @s than s? Describe how you can quickly answer the question without
counting, and explain the connection with the notion of a one-to-one correspondence.
The @s and s are paired up in a one-to-one correspondence. That is, for every @, there is a
lined up below it. Therefore it is easy to determine that there are not more @s than s,
without even counting.
11.
Suppose a stranger tells you that the license plate number on his car is 791ZWV. If you had a
listing of all automobiles in the U.S. together with their license plate numbers, would you be able
to precisely identify the strangers vehicle? If so, explain why. If not, explain why, and identify
what additional information you would require to identify it exactly. Discuss the connection
between this situation and the notion of a one-to-one correspondence.
The strangers license plate number suggests an alphanumeric format that can be used to
uniquely identify 101010262626 = 27,576,000 vehicles. However, the total number of
registered vehicles in the U.S. exceeds 240.5 million (as of 2011). The disparity between 27
million and 240 million suggests that there must not be a one-to-one correspondence between the
strangers license plate format and all registered vehicles in the United States. Either each
individual license plate number is used to tag different cars in different states, or states may
employ different alphanumeric formats, such as using a state abbreviation for the first two spaces.
The additional information of which state the license plate number is from should be sufficient to
identify the vehicle exactly.
14.
A professor wishes to distribute one examination to each student in the class. What is the most
efficient way for her to determine whether she has more students than exams? Pass out the
exams or count?
Both methods will determine the answer. Taking a head count is faster than waiting for papers to
distribute through a classroom. However, if the test papers must be distributed either way, it
would be less work to determine the answer by distribution, rather than counting.
26 of 40

Pei-Hsin Lins HW1

March 12, 2013
HEART SECTION 3.1

16.
Do there exist two non-bald people on Earth such that there is a one-to-one correspondence
between the collection of hairs on one persons body and the collection of hairs on the other
persons body? Feel free to use facts from previous chapters, but explain how they provide an
answer to the one-to-one correspondence question.
The collection of hairs on each persons body is a finite number. For two sets of finite size to
have a one-to-one correspondence between them, they would have to be of exactly the same
size. Therefore the chance that there exists two nonbald people on Earth with exactly the same
finite number of hairs is infinitesimally small, and effectively zero.
17.
Social security numbers contain nine digits. Suppose that all nine-digit numbers are allowable
social security numbers. Is there a one-to-one correspondence between allowable social
security numbers and U.S. residents? You may assume that the U.S. population is about 300
million. Explain your answer.
If all nine-digit numbers are allowable social security numbers, then 10 9 or 1,000,000,000 total
allowable social security numbers exist. The total number of U.S. residents as of March 2013 is
315,475,000. One billion and 315.475 million are distinct finite numbers, so there is not a
one-to-one correspondence between allowable social security numbers and U.S. residents.
20.
Every student at a certain college is assigned to a dorm room. Does this imply that there is a
one-to-one correspondence between dorm rooms and students? Explain your answer.
If every student at a certain college is assigned to a dorm room, this does not imply that there is a
one-to-one correspondence between dorm rooms and students for several reasons. The total
number of dorm rooms could exceed the total number of students. Alternately, multiple students
could be assigned to the same dorm room, such as a freshman triple. The information provided
implies neither that that all dorm rooms on campus are singles, nor that the total number of dorm
rooms exactly matches the total number of students.
27 of 40

Pei-Hsin Lins HW1

March 12, 2013
HEART SECTION 3.2

5.
Define the cardinality of a set.

The cardinality of a set means the number of things in the set, with the understanding that the
set may contain infinitely many things. Two sets have the same cardinality if there is a
one-to-one correspondence between the elements of one set and the elements of the other.
6.
Let E stand for the set of all even natural numbers (so E = {2, 4, 6, 8, ...}) and O stand for the
set of all odd natural numbers (so O = {1, 3, 5, 6, ...}). Show that the sets E and O have the
same cardinality by describing an explicit one-to-one correspondence between the two sets.
10
12
14
16
18
2n
11
13
15
17
19
2n + 1
The sets E and O have the same cardinality with each other and the set of all natural numbers,
since the nth member of may be described as n, the nth member of set E may be described as
2n, and the nth member of set O may be described as (2n + 1). Thus there exists a one-to-one
correspondence between the members of these three sets.
7.
Let EIF be the set of all natural numbers ending in 5 (EIF stands for ends in five). That is,
EIF = {5, 15, 25, 35, 45, 55, 65, 75, ...}. Describe a one-to-one correspondence between the set
of natural numbers and the set EIF.
EIF
10
15
20
25
30
35
40
45
5n
The nth member of the set EIF may be described as 5n, while the nth member of the set may
be described as n. Thus there exists a one-to-one correspondence between the members of the
two sets, and they share the same cardinality of being countably infinite. In keeping with the
notation in Problem 9, the set EIF is in fact identical to the set 5.
28 of 40

Pei-Hsin Lins HW1

March 12, 2013
HEART SECTION 3.2

If we let stand for the set of all natural numbers, then we write 6 for the set of natural
9.
numbers all multiplied by 6 (so 6 = {6, 12, 18, 24, }). Show that the sets and 6 have the
same cardinality by describing an explicit one-to-one correspondence between the two sets.
12
18
24
30
36
42
48
54
6n
The nth member of the set 6 may be described as 6n, while the nth member of the set may be
described as n. Thus there exists a one-to-one correspondence between the members of the two
sets, and they share the same cardinality of being countably infinite.
11.
Let TIM be the set of all natural numbers except the number 3 (TIM stands for three is
missing), so TIM = {1, 2, 4, 5, 6, 7, 8, 9, }. Show that the set TIM and the set of all natural
numbers have the same cardinality by describing an explicit one-to-one correspondence
between the two sets.
TIM
10
n + 1
After the first two elements, the nth member of the set TIM may be described as (n + 1), while the
nth member of the set may be described as n. Thus there exists a one-to-one correspondence
between the members of the two sets, and they share the same cardinality of being countably
infinite.
29 of 40

Pei-Hsin Lins HW1

March 12, 2013
HEART SECTION 3.2

13.
Let S stand for the set of all natural numbers that are perfect squares, so S = {1, 4, 9, 16, 25,
36, 49, 64, }. Show that the set S and the set of all natural numbers have the same cardinality
by describing an explicit one-to-one correspondence between the two sets.
16
25
36
49
64
81
n2
The nth member of set S may be described as n 2 , while the nth member of the set may be
Suppose R is the set defined by R = { 11 , 12 , 13 , 14 , 15 , 16 , ...} . Describe the set R in words. Show
15.
that it has the same cardinality as the set of natural numbers.
1
1
1
2
1
3
1
4
1
5
1
6
1
7
1
8
1
9
1
n
The nth member of set R may be described as
1
n
, while the nth member of the set may be
19.
Prove that there cannot be an infinite number of grains of sand on Earth.

The Earth in space has a finite amount of total mass. Assume that there exist an infinite number
of grains of sand on Earth. Since sand is a subset of all matter on Earth, the Earths mass would
include an infinite number of grains of sand in addition to the other matter. But an infinite set
cannot be a subset of a finite set. So the number of grains of sand on Earth must be finite.
30 of 40

Pei-Hsin Lins HW1

March 12, 2013
HEART SECTION 3.2

20.
Suppose you take the line below, cut it in half, and then take the left piece and cut it in half, and
then take the leftmost piece and cut it in half, and so on, without ever stopping. How many
different pieces of the line would you have? Does the set of all pieces have the same cardinality
as the set of all natural numbers? Justify your answer.
1
2
1
4
1
8
1
16
1
32
1
64
1
128
1
256
1
512
1
2n
Following the stated procedure would create an infinite number of pieces of the original line.
W.l.o.g., say that the original line had a length of 1. Then the length of the nth new piece created
would be
1
2n
(e.g., the first new piece, created by the first cut, has length
piece, created by the second cut, has length
1
4
1
2
; the second new
). Thus the set of all pieces does have the same
cardinality as the set of all natural numbers.

24.
Suppose we have two sets and we are able to pair elements from one set with elements from the
other set in such a way that all the elements from the first set are paired with elements from the
second set; but there are elements from the second set that were never paired. Does this
pairing imply that the two sets do not have the same cardinality? Justify your answer.
1
1
3
1
1
2
1
1
2
7
2
1
1
2
3
1
3
2
The mere existence of a pairing that excludes some elements of one set does not imply that the
two sets have different cardinalities. For example, a one-to-one correspondence can be
constructed between and a subset of , such as set R in Problem 15 (the set of reciprocals of
the natural numbers). But actually has the same cardinality as , even though the nth rational
number cannot be described in terms of n in closed form. Instead, an explicit one-to-one
correspondence can be constructed between and with the Cantor pairing function.
31 of 40

Pei-Hsin Lins HW1

March 12, 2013
HEART SECTION 3.2

26.
Devise and then describe a method to systematically list all rational numbers between 0 and 1.
(0,1)
1
2
1
3
2
3
1
4
3
4
1
5
2
5
3
5
4
5
Write the rational numbers between 0 and 1 (non-inclusive) in a triangular array as follows,
where any rational number
1
2
m
n
is in the (n - 1)th column of the mth row.
1
3
1
4
1
5
1
6
1
7
2
3
2
4
2
5
2
6
2
7
3
4
3
5
3
6
3
7
4
5
4
6
4
7
5
6
5
7
6
7
Then systematically order the arrayed numbers starting with column 1, proceeding from the top
down, then proceed to column 2, and so on, skipping any fractions that are equivalent to
numbers that have already been ordered (e.g., skip
2
4
since
1
2
has already been included in the
list). This method can be repeated infinitely to enumerate all the rational numbers between 0 and
1, even though the nth rational number listed cannot be described in terms of n in closed form.
29.
Take the set of natural numbers and remove a finite number of numbers from it. Prove that
this new set has the same cardinality as the set of natural numbers.
2014
2015
2016
2017
2018
2019
2020
2021
2022
n + 2013
If all the numbers from 1 to 2013 are removed from , the set of natural numbers, the set X of
the remaining numbers {2014, 2015, 2016, } still has the same cardinality as , because the
nth member of this set can be described as (n + 2013), and thereby paired in a one-to-one
correspondence with the nth member of , which is can be described as n.
32 of 40

Pei-Hsin Lins HW1

March 12, 2013
HEART SECTION 3.2

31.
You have infinitely many piles of peanuts. In the first pile you have one peanut; in the second
pile you have two; in the third pile you have three; and so on. How many nuts do you have?
Does the set of all these nuts have the same cardinality as the set of natural numbers? If not,
explain why. If so, provide a one-to-one correspondence.
After n piles of peanuts, each containing consecutive triangular numbers of peanuts, we would
n
have
i=1
n(n+1)
2
n(n+1)(n+2)
6
peanuts. There is an infinite number of piles of peanuts, but it is still
possible to identify precisely which pile the mth peanut is in, and the mth peanut can be paired
with the mth natural number in a one-to-one correspondence.
35.
Consider the infinite collection of circles below:
Suppose you have two markers, one red and one blue, and you color each circle one of the two
colors. How many different ways can you color the circles? Do you think that the set of all
possible circle colorings has the same cardinality as the set of all natural numbers? This
question is tricky; just make a guess and explain why you guessed what you guessed (you need
not rigorously justify your answer). You may first want to answer the question for just these
four circles as a warm-up.
10
11
100
101
110
111
1000
1001
Each circle can be colored either red or blue. For the first n circles, the number of all possible
colorings is 2 n , but the number of circles is actually infinite. Nevertheless, each coloring can be
mapped to a binary number, where red is represented by a 1 and blue is represented by a 0. The
one-to-one correspondence between the binary numbers B and the natural numbers can be
achieved by converting from base 2 to base 10. Thus the set of all possible circle colorings
should have the same cardinality as the set of all natural numbers.
33 of 40

Pei-Hsin Lins HW1

March 12, 2013
HEART SECTION 3.2

36.
Suppose you dump 10 ping-pong balls into a barrel, numbered 1 - 10, and remove number 1,
using 30 seconds. Next you add 100 ping-pong balls, numbered 11 - 110, and remove number 2,
using 15 seconds. Then you put in 1000 ping-pong balls, numbered 111 - 1110, and remove
number 3, using 7.5 seconds, and so on. The question is: How many ping-pong balls remain in
the barrel after the stopwatch beeps at the end of 60 seconds? Infinitely many? Finitely many?
Can you name one?
n
60
i
i=1 2
After
seconds, the barrel contains (10 i

i=1
1 ) = 10 i
n ping-pong balls. However,
i=1
the nth ping-pong ball is removed during the nth step, for all n, and it is impossible to name a
specific ping-pong ball that managed to stay in the barrel. Therefore, at the end of 60 seconds,
zero ping-pong balls remain in the barrel.
37.
This time, the ping-pong balls are not numbered! You play the same game but at each stage,
reach in and remove one indistinguishable ping-pong ball. How many ping-pong balls might
remain in the barrel?
n
60
i
i=1 2
After
seconds, the barrel contains (10 i

i=1
1 ) = 10 i
n ping-pong balls. The balls in
i=1
the barrel are unnumbered and indistinguishable, but they still correspond one-to-one to the
natural numbers. If a ping-pong ball is removed during the nth step for all n from 1 to infinity, at
the end of 60 seconds, zero ping-pong balls remain in the barrel once again.
38.
Show that the set of all prime numbers has the same cardinality as the set of all natural
numbers.
11
13
17
23
29
The set of prime numbers P can be enumerated in ascending order and mapped one-to-one to the
set of natural numbers , so they have the same cardinality of being countably infinite.
34 of 40

Pei-Hsin Lins HW1

March 12, 2013
HEART SECTION 3.3

7.
Explain the connection between the Dodgeball game and Cantors proof that the cardinality of
the reals is greater than the cardinality of the natural numbers.
Player Two will always win the Dodgeball game. Player One can perfectly match the first (n - 1)
letters on Player Twos game board, but once he commits and writes down a letter in the nth
space of the nth row on Game Board One, it is trivial for Player Two to dodge a match by
writing a different letter into the nth space on Game Board Two.
Cantors proof first assumed that a complete, ordered list of real numbers could be made. Then
he used the dodging mechanism to construct, digit-by-digit, a real number that would not
match any of n real numbers on the list, for any n , no matter how large. This result means
that no matter how the real numbers are ordered, a real number can be found that is missing from
the list, and thus it is impossible to establish a one-to-one correspondence between the natural
numbers and the real numbers that successfully includes all the real numbers.
8.
Rework Cantors proof from the beginning.
This time, however, if the digit under
consideration is 3, then make the corresponding digit of M a 7; and if the digit is not 3, make the
associated digit of M a 3.
Construct a table with two columns, with a list of the natural numbers in the left-hand column,
and some list of real numbers in the right-hand column. Claim that this list of real numbers is
complete. Then begin to construct a special real number, by examining the first real number in
the list. If the tenths digit is observed to be a 3, choose the tenths digit to be 7. Next consider the
second real number in the list. If the hundredths digit is not a 3, choose the hundredths digit to
be a 3. Continue in this fashion with the nth digit of the nth real number on the list. Then no
matter how big n becomes and how long we look, the constructed number will still be a match
with any of the n real numbers in the right-hand column. Thus given any pairing between the
natural numbers and the reals, a real number can be shown to be missing. The impossibility of
one-to-one correspondence suggests that the set of reals is uncountably infinite in size.
11.
Cantors proof is often referred to as Cantors diagonalization argument. Explain why this
is a reasonable name.
The digits that are used during the construction of the missing real number form a diagonal,
which passes through each member of the list of reals exactly once.
35 of 40

Pei-Hsin Lins HW1

March 12, 2013
HEART SECTION 3.3

12.
Consider the following infinite collection of real numbers. Describe in your own words how
these numbers are constructed (that is, describe the procedure for generating this list of
numbers). Then using Cantors diagonalization argument, find a number not on the list. Justify
your answer.
0.123456789101112131415161718
0.2468101214161820222426283032
0.369121518212427303336394245
0.4812162024283236404448525660
0.510152025303540455055606570
The nth decimal in the list of numbers above is generated by listing all the positive multiples of n
in order after the decimal point. Using Cantors diagonalization argument, where any 2 is
switched out for a 5, and any digit that is not 2 is switched out for a 2, a real number that begins
with 0.22252 can be constructed such that it is certainly not included in the list.
13.
In Problem 25 of Section 2.2, we considered the following infinite collection of circles and all the
different ways of coloring the circles with either red or blue markers. Show that the set of all
possible circle colorings has a greater cardinality than the set of all natural numbers.
Using the digit 1 to represent a red circle, and the digit 0 to represent a blue circle, the set of all
possible circle colorings can be represented by decimals greater than 0 and less than 1 consisting
entirely of 0s and 1s. Assume that these decimals can be countably ordered in one-to-one
correspondence with the natural numbers, in a two-column table. Using Cantors diagonalization
argument, where any 0 is switched out for 1, and any 1 is switched out for 0, a number whose
nth digit always mismatches with the nth digit of the nth listed coloring can be constructed.
Since we can always find one coloring that was omitted from the list, it is not possible to
construct a one-to-one correspondence between the set of all possible circle colorings and the set
of natural numbers. Thus the set of all possible circle colorings must be uncountably infinite.
36 of 40

Pei-Hsin Lins HW1

March 12, 2013
HEART SECTION 3.3

14.
Suppose you had infinitely many people, each one wearing a uniquely numbered button: 1, 2, 3,
4, 5, You also have lots of pennies (infinitely many). Now you give each person a penny;
then ask them to shout out in order what they flipped (H for heads and T for tails). So you
might
hear
THTTTHTHHTTHTHTTTTTHHHTHTHTH
or
you
might
hear
HHTHHTTTHTTHTHTHTHHHTH, and so forth. Consider the set of all possible outcomes

of their flipping (all possible sequences of Hs and Ts). Does the set of possible outcomes have
the same cardinality as the natural numbers? Justify your answer.
Represent each possible coin toss outcome with a decimal greater than 0 and less than 1
consisting entirely of 6s and 7s, where every 6 represents a T and every 7 represents an H.
Assume that these decimals can be countably ordered in one-to-one correspondence with the
natural numbers, in a two-column table. Using Cantors diagonalization argument, where any 6
is switched out for 7, and any 7 is switched out for 6, a number whose nth digit always
mismatches with the nth digit of the nth listed coloring can be constructed. Since we can always
find one coin toss outcome that was omitted from the list, it is not possible to construct a
one-to-one correspondence between the set of all possible coin toss outcomes and the set of
natural numbers. Thus the set of all possible coin toss outcomes must be uncountably infinite.
16.
Show that the set of all real numbers between 0 and 1 just having 1s and 2s after the decimal
point in their decimal expansions has a greater cardinality than the set of natural numbers. (So,
the number 0.112111122212122211112 is a number in this set, but 0.1161221212122122 is
not, because it contains digits other than just 1s and 2s.)
Assume that these decimals can be countably ordered in one-to-one correspondence with the
natural numbers, in a two-column table. Using Cantors diagonalization argument, where any 1
is switched out for 2, and any 2 is switched out for 1, a number whose nth digit always
mismatches with the nth digit of the nth listed decimal can be constructed. Since we can always
find decimal between 0 and 1 made up of just 1s and 2s that was omitted from the list, it is not
possible to construct a one-to-one correspondence between the set of all real numbers between 0
and 1 made up of just 1s and 2s and the set of natural numbers. Thus the set of such decimals
must be uncountably infinite.
37 of 40

Pei-Hsin Lins HW1

March 12, 2013
HEART SECTION 3.3

21.
Would Cantors argument work if we used 2 and 9 instead of 2 and 4 as the digits? That is, for
each digit we ask whether the digit is a 2. If it is 2, we make the analogous digit of M a 9, and
otherwise we make the digit a 2. Using this method, we are not guaranteed that the number M
we construct is not on our list. Provide a scenario in which the constructed number is on the list!
(Hint: Remember from Chapter 2 that 0 .19 = 0.2. The number 9 is key here.)
The reason the construction could fail is that if the constructed number contained an infinite tail
of repeating 9s, then it would actually be equivalent to a terminating decimal with an infinite tail
of repeating 0s. Thus the constructed decimal would not belong to the set of all real numbers
between 0 and 1 made up of entirely the 2s and 9s, as intended. In fact, Cantors argument
works when any two digits are used, when the digit 9 is excluded from being one of them.
22.
Could you modify the diagonalization procedure so that the missing real you produce is a
rational number? How could you modify the diagonalization argument so that the missing real
number you produce is an irrational number? (Hint: Using the construction in this section, each
digit of M is a 2 or a 4. Modify the construction so the 10th place, the 100th place, the 1000th
place, and so on, are either a 3 or a 5, whereas the rest are 2s and 4s. Why will such a
number be irrational?)
38 of 40

Pei-Hsin Lins HW1

March 12, 2013
AP SECTION 2.1.4
1B.
Identify a rational number and an irrational number between -0.00004 and -0.00005.
-.000045 is a rational number between -0.00004 and -0.00005.
17
100000
1C.
is an irrational number between -0.00004 and -0.00005.
Identify a rational number and an irrational number between and

3.14 is a rational number between and
2.
2
28
1
27
1
27
is an irrational number between and
1
27
Show that, for any real numbers x and y with 0 < x < y, there exist positive integers p and q
such that the irrational number s =
p2
q
is in the interval (x, y).

y
x
For any real numbers x and y with 0 < x < y, 2 > 0 0 < 2
< 2
Since there is a rational number between any two real numbers (Theorem 2.12),
there exists
p
q
Then 0 < x <

3.
x
where p, q such that 0 < 2
< q < 2 .
p2
q
< y and the irrational number s =
p2
q
is in the interval (x, y).
Prove Theorem 2.13(a): Every rational number is an algebraic number.

To prove Theorem 2.13(a), it is sufficient to state that, for all
p(x) = qx - p with integer coefficients p and q such that
5B.
Do ??? with 1 + 3 .
5D.
Do ??? with 1 + 5 .
3
39 of 40
p
q
p
q
, there exists a polynomial
is a root of p(x) = 0.

Pei-Hsin Lins HW1

March 12, 2013
AP SECTION 2.1.4
6.
Prove that the set of transcendental numbers is not countably infinite.
8A.
Show that the set E of all even integers and the set of all integers have the same cardinality.
10
12
14
16
18
2n
-1
-2
-3
-4
(-1)n floor(0.5n)
An explicit one-to-one correspondence can be constructed between E and , and between and
. The nth terms of each sequence can be paired together, as shown in the chart. Thus the set E
and the set have the same cardinality; they are both countably infinite.
9.
Prove that the set of all rational numbers is countably infinite.
1
1
3
1
1
2
1
1
2
7
2
1
1
2
3
1
3
2
Even though the nth rational number cannot be described in terms of n in closed form, an explicit
one-to-one correspondence can be constructed between and with the Cantor pairing
function. Therefore the set of all rational numbers is countably infinite.
40 of 40

PHL - Math 620 hw1

Uploaded by

Document Information

Original Description:

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

PHL - Math 620 hw1

Uploaded by

Copyright:

Available Formats

MATH 620.

Pei-Hsin Lins HW1

HUNTER COLLEGE OF THE CITY UNIVERSITY OF NEW YORK

1, 3, 5, 6, 8, 10, 12, 14, 16,

2, 3, 8, 11, 17, 23, 26, 27, 33, 35, 36

1, 4, 5, 10, 18, 20, 22, 26, 30, 34, 36, 37, 39

2, 4, 5, 7, 10, 14, 25, 26, 31, 32, 33, 36, 37, 38

1, 2, 3a, 3b, 4c, 4e, 5b, 7, 9

8, 11, 14, 16, 17, 20

5, 6, 7, 9, 11, 13, 15, 19, 20,

7, 8, 11, 12, 13, 14, 16, 21, 22

1b, 1c, 2, 3, 5b, 5d, 6, 8a, 9

OVERALL PROBLEM SET MINIMUM = 95

Points earned: ____________

MATH 620.00 Sequential Math I

Pei-Hsin Lins HW1

HEART SECTION 2.2

List the first 15 Fibonacci Numbers.

Solve the following equations for x.

MATH 620.00 Sequential Math I

Pei-Hsin Lins HW1

HEART SECTION 2.2

two consecutive Fibonacci numbers.

Based on the pattern above, (Fn+1 )2 + (Fn )2 = F2n+1 .

Ln+1 /Ln for n = 1 through n = 14:

Pn+1 /Pn for n = 1 through n = 14:

MATH 620.00 Sequential Math I

Pei-Hsin Lins HW1

HEART SECTION 2.2

Determine a formula for Fn-1 + Fn+1 .

Based on the pattern above, Fn-1 + Fn+1 = Ln+1 .

Determine a formula for Fn + Ln.

Based on the pattern above, Fn + Ln = 2Fn - Fn-2 .

MATH 620.00 Sequential Math I

Pei-Hsin Lins HW1

HEART SECTION 2.2

Fn+1 Fn-1 - (Fn)2

Based on the pattern above, Fn+1 Fn-1 - (Fn )2 = (-1)n .

As n gets larger and larger,

appears to approach the golden mean,

MATH 620.00 Sequential Math I

Pei-Hsin Lins HW1

HEART SECTION 2.2

Tn+1 /Tn for n = 1 through n = 14:

Tn+1 /Tn approaches the tribonacci constant,

1+ 19+3 33 +19 333

This number is a root of the polynomial x3 - x2 - x - 1.

MATH 620.00 Sequential Math I

Pei-Hsin Lins HW1

HEART SECTION 2.2

MATH 620.00 Sequential Math I

Pei-Hsin Lins HW1

HEART SECTION 2.3

MATH 620.00 Sequential Math I

Pei-Hsin Lins HW1

HEART SECTION 2.3

MATH 620.00 Sequential Math I

Pei-Hsin Lins HW1

HEART SECTION 2.3

(n! + n - 2) is divisible by (n - 2).

MATH 620.00 Sequential Math I

Pei-Hsin Lins HW1