SOAR Homework Three
These homework problems are meant to expand your understanding of what
goes on during class. Any you turn in will be graded and returned to
you. Answers may or may not be posted on the web, depending on demand.
Problems
-
- Show that the continued fraction x=[1,2,1,2,1,2,1,2,...]
satisfies the quadratic equation 2x2 - 2x -1 = 0. Find the
value of x.
-
Show that the other root of this equation is
-1/[2,1,2,1,2,1,...].
-
Find the quadratic equation that the continued fraction
x=[a,b,a,b,a,b,...] satisfies. Show that the other root of this
equation is -1/[b,a,b,a,b,a,b,a,...].
-
Find the quadratic equation that the continued fraction
x=[a,b,c,a,b,c,a,b,c,....] satisfies.
-
The other root of this equation is probably either
-1/[c,b,a,c,b,a,...], -1/[a,c,b,a,c,b,...], or
-1/[b,a,c,b,a,c,...]. Can you tell which without solving the
equation?
-
One of the skipped parts of a proof from today's class was the
following claim: that x can be written as
x = |
xn pn-1 + pn-2
xn qn-1 + qn-2
|
|
| (1) |
where x = [a1,a2,a3,...], xn is defined by
x=[a1,a2,...,an-1,xn], and the nth convergent is Cn = pn/qn = [a1,a2,...,an].
- Prove that pn+1 = an+1pn + pn-1 and an+1 = an+1qn + qn-1 for n=1, n=2, and n=3. By
convention, (that is, so the formulas work) we assume p0 = 1
and q0 = 0.
-
Prove equation (1) for
n=1, n=2, and n=3.
-
Another of the skipped parts is that
equation (1) gives
us a nice inequality for x:
|
pn-1
qn-1
|
< x < |
pn-2
qn-2
|
|
| (2) |
(provided n is even). We prove this by showing that A/B < C/D implies that
and
(Here A, B, C, D, and x are any positive real numbers.)
- For the first equation, prove that A(xB+D) = AD + xAB < BC + xAB=B(xA+C).
-
Use the inequality from part (a) to prove that A/B < (xA+C)/(xB+D).
-
Use a similar technique to prove the other inequalities involved
in
equations (3) and (4).
-
Use equations and to prove
equation .
Note: In the following problems, I use for the three-line ``equivalent to'' sign, for
ease of browsing.
-
Solve the following equations for x. That is, find a value
(not all values) satisfying the equations. Fair warning: at
least one has no solution!
- 203x + 73 = 0 mod 8
- x2 + 42x + 64 = 0 mod 3
- (x+2)3 = 1 mod 3
- (x+2)3 = 2 mod 3
- (x+2)4 = 2 mod 3
-
In class we discussed a simple version of the Chinese Remainder
Theorem, which says that if gcd(m,n) = 1, then given two integers
a and b there is a unique value of x with 0 =< x < mn such
that
- Solve for x if m=5, n=6, a=3, and b=1. That is,
solve
- Solve for x if m=13, n=11, a=1, and b=2. That is,
solve
- Can you write x (up to multiples of mn) in terms of a, b,
m, and n?
These problems are also available as a pdf file.
Solutions
Please email Peter
if you are interested in answers or solutions for the web. Thanks.
SOAR Spring 2003 Course Homepage