Problem Seminar - Assignment Four - Winter 2006 | MATH 289, Assignments of Mathematics

Material Type: Assignment; Class: Problem Seminar; Subject: Mathematics; University: University of Michigan - Ann Arbor; Term: Winter 2006;

Typology: Assignments

Pre 2010

Uploaded on 09/02/2009

koofers-user-ab9
koofers-user-ab9 🇺🇸

10 documents

1 / 1

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
Math 289 Winter 2006 Problem Set 4
Due February 8, 2006
1.(10) Find all the integer solutions of the equation:
qx5qy5 = q6510 .
2.(10) In the round robin of an Ultimate Frisbee tournament there were four different
teams in a certain group and each team played all the other teams exactly once. One
of the smart ultimate players pointed out an interesting fact, the number of “foul calls”
was different in every game but the number of “foul calls” in each game divided the total
number of “foul calls” in all the games. What is the smallest possible total number of “foul
calls” (in this particular group)?
3.(10) Find all the pairs of integers (a, b) for which a+bis a root of the quadratic equation
x2+ax +b= 0 .
4.(15) Given is the sequence of real numbers (an)
n=1:
a11 = 4, a22 = 2, a33 = 1,
an+3 an+2
anan+1
=an+3 +an+2
an+an+1
for n1.
Prove that
ak
1+ak
2+. . . +ak
100
is a square of an integer for each k,k= 1,2, . . ..
5.(15) Solve the following system of equations for the unknown real numbers xand y:
sin2x+ cos2y=y2,
sin2y+ cos2x=x2.
6.(15) Initially, we have three piles with a, b, and cchips, respectively. In one step, you
may transfer one chip from any pile with xchips onto any other pile with ychips. Let
d=yx+ 1. If d > 0, the bank pays you ddollars. If d < 0, you pay the bank |d|dollars.
Repeating this step several times you observe that the original distributions of chips has
been restored. What maximum amount can you have gained at this stage?
1

Partial preview of the text

Download Problem Seminar - Assignment Four - Winter 2006 | MATH 289 and more Assignments Mathematics in PDF only on Docsity!

Math 289 – Winter 2006 – Problem Set 4

Due February 8, 2006

1.(10) Find all the integer solutions of the equation: √ x

y

2.(10) In the round robin of an Ultimate Frisbee tournament there were four different teams in a certain group and each team played all the other teams exactly once. One of the smart ultimate players pointed out an interesting fact, the number of “foul calls” was different in every game but the number of “foul calls” in each game divided the total number of “foul calls” in all the games. What is the smallest possible total number of “foul calls” (in this particular group)?

3.(10) Find all the pairs of integers (a, b) for which a+b is a root of the quadratic equation

x^2 + ax + b = 0.

4.(15) Given is the sequence of real numbers (an)∞ n=1:

a 11 = 4, a 22 = 2, a 33 = 1, an+3 − an+ an − an+

an+3 + an+ an + an+

for n ≥ 1.

Prove that ak 1 + ak 2 +... + ak 100

is a square of an integer for each k, k = 1, 2 ,.. ..

5.(15) Solve the following system of equations for the unknown real numbers x and y:

sin^2 x + cos^2 y = y^2 , sin^2 y + cos^2 x = x^2.

6.(15) Initially, we have three piles with a, b, and c chips, respectively. In one step, you may transfer one chip from any pile with x chips onto any other pile with y chips. Let d = y − x + 1. If d > 0, the bank pays you d dollars. If d < 0, you pay the bank |d| dollars. Repeating this step several times you observe that the original distributions of chips has been restored. What maximum amount can you have gained at this stage?