8 views

Uploaded by ssshhhki

- GRE Geometry
- Cv of Ashutosh Biswal-l
- Weekly_Exam3.pdf
- Maxima and Minima - MA Math Ed - Analysis for teachers - Module 6
- 8 Maths NCERT Solutions Chapter 3 3
- Geometry EOC Practice Questions
- Folio ADD MATH 2015
- Math Paper 3 Grade 11 Nov 2009
- Calculus Lecture 7
- Proofs of Theorems
- 2016EJ-Alg_Vect-Wilmer.2015660208.16A_AV_BF_Tarea2doDep.pdf
- Calculus 3.Formulas
- mathematicsstudysum.pdf
- Experiment 3
- 2009 Smo Booklet
- Real Analysis Notes9
- 10 2006 Mathematics 1
- Geometry Extra Notes
- solutii_seniori
- Untitled

You are on page 1of 10

1. Let a, b, and c be positive real numbers. Determine the largest total number of real roots that the

following three polynomials may have among them: ax2 + bx + c, bx2 + cx + a, and cx2 + ax + b.

Answer: 4 If all the polynomials had real roots, their discriminants would all be nonnegative: a2

4bc, b2 4ca, and c2 4ab. Multiplying these inequalities gives (abc)2 64(abc)2 , a contradiction.

Hence one of the quadratics has no real roots. The maximum of 4 real roots is attainable: for example,

the values (a, b, c) = (1, 5, 6) give 2, 3 as roots to x2 + 5x + 6 and 1, 51 as roots to 5x2 + 6x + 1.

2. Josh takes a walk on a rectangular grid of n rows and 3 columns, starting from the bottom left corner.

At each step, he can either move one square to the right or simultaneously move one square to the left

and one square up. In how many ways can he reach the center square of the topmost row?

Answer: 2n1 Note that Josh must pass through the center square of each row. There are 2 ways

to get from the center square of row k to the center square of row k + 1. So there are 2n1 ways to get

to the center square of row n.

3. Let f : R R be a differentiable function such that f (0) = 0, f (1) = 1, and |f 0 (x)| 2 for all real

Z 1

numbers x. If a and b are real numbers such that the set of possible values of

f (x) dx is the open

0

Answer:

3

4

Draw lines of slope 2 passing through (0, 0) and (1, 1). These form a parallelogram with

vertices (0, 0), (.75, 1.5), (1, 1), (.25, .5). By the mean value theorem, no point of (x, f (x)) lies outside

this parallelogram, but we can construct functions arbitrarily close to the top or the bottom of the

parallelogram while satisfying the condition of the problem. So (b a) is the area of this parallelogram,

which is 34 .

4. Let ABC be a triangle such that AB = 7, and let the angle bisector of BAC intersect line BC at

D. If there exist points E and F on sides AC and BC, respectively, such that lines AD and EF

are parallel and divide triangle ABC into three parts of equal area, determine the number of possible

integral values for BC.

Answer: 13

14

[ADC]

= 2.

[ADB]

(1)

([ ] denotes area.) Since AD is the angle bisector, and the ratio of areas of triangles with equal height

is the ratio of their bases,

AC

DC

[ADC]

=

=

.

AB

DB

[ADB]

Hence (1) is equivalent to AC = 2AB = 14. Then BC can be any length d such that the triangle

inequalities are satisfied:

d + 7 > 14

7 + 14 > d

Hence 7 < d < 21 and there are 13 possible integral values for BC.

5. Nathaniel and Obediah play a game in which they take turns rolling a fair six-sided die and keep a

running tally of the sum of the results of all rolls made. A player wins if, after he rolls, the number

on the running tally is a multiple of 7. Play continues until either player wins, or else indefinitely. If

Nathaniel goes first, determine the probability that he ends up winning.

5

For 1 k 6, let xk be the probability that the current player, say A, will win when

Answer: 11

the number on the tally at the beginning of his turn is k modulo 7. The probability that the total

is l modulo 7 after his roll is 61 for each l 6 k (mod 7); in particular, there is a 16 chance he wins

immediately. The chance that A will win if he leaves l on the board after his turn is 1 xl . Hence for

1 k 6,

X

1

1

(1 xl ) + .

xk =

6

6

1l6, l6=k

P6

xk s

Letting s = l=1 xl , this becomes xk = 6 + 1 or 5x6k = 6s + 1. Hence x1 = = x6 , and 6xk = s

6

k

for every k. Plugging this in gives 11x

6 = 1, or xk = 11 .

Since Nathaniel cannot win on his first turn, he leaves Obediah with a number not divisible by 7.

6

5

Hence Obediahs chance of winning is 11

and Nathaniels chance of winning is 11

.

6. Let a ? b = ab + a + b for all integers a and b. Evaluate 1 ? (2 ? (3 ? (4 ? . . . (99 ? 100) . . .))).

Answer: 101! 1

Commutativity: a ? b = ab + a + b = b ? a

Associativity: a ? (b ? c) = a(bc + b + c) + a + bc + b + c = abc + ab + ac + bc + a + b + c and

(a ? b) ? c = (ab + a + b)c + ab + a + b + c = abc + ab + ac + bc + a + b + c. So a ? (b ? c) = (a ? b) ? c.

So we need only calculate ((. . . (1 ? 2) ? 3) ? 4) . . . ? 100). We will prove by induction that

((. . . (1 ? 2) ? 3) ? 4) . . . ? n) = (n + 1)! 1.

Base case (n = 2): (1 ? 2) = 2 + 1 + 2 = 5 = 3! 1

Inductive step:

Suppose that

(((. . . (1 ? 2) ? 3) ? 4) . . . ? n) = (n + 1)! 1.

Then,

((((. . . (1 ? 2) ? 3) ? 4) . . . ? n) ? (n + 1)) = ((n + 1)! 1) ? (n + 1)

= (n + 1)!(n + 1) (n + 1) + (n + 1)! 1 + (n + 1)

= (n + 2)! 1

Algebra & Calculus Individual Test

Hence, ((. . . (1 ? 2) ? 3) ? 4) . . . ? n) = (n + 1)! 1 for all n. For n = 100, this results to 101! 1.

7. Let f : [0, 1) R be a function that satisfies the following condition: if

x=

X

an

= .a1 a2 a3 . . .

n

10

n=1

is the decimal expansion of x and there does not exist a positive integer k such that an = 9 for all

n k, then

X

an

.

f (x) =

102n

n=1

Determine f 0 13 .

P

Answer: 0 Note that 13 = n=1 103n .

Clearly f is an increasing function. Also for any integer n 1, we see from decimal expansions that

f ( 31 101n ) f ( 13 ) = 1012n .

1

Consider h such that 10n1 |h| < 10n . The two

1properties

of f outlined above show that |f ( 3 +

1

f ( +h)f ( 3 )

1

h) f ( 13 )| < 1012n . And from | h1 | 10n+1 , we get 3 h

. Taking n gives h 0

< 10n1

and f 0 ( 13 ) = limn

1

10n1

= 0.

8. Find all integers x such that 2x2 + x 6 is a positive integral power of a prime positive integer.

Answer: 3, 2, 5 Let f (x) = 2x2 + x 6 = (2x 3)(x + 2). Suppose a positive integer a divides

both 2x 3 and x + 2. Then a must also divide 2(x + 2) (2x 3) = 7. Hence, a can either be 1 or

7. As a result, 2x 3 = 7n or 7n for some positive integer n, or either x + 2 or 2x 3 is 1. We

consider the following cases:

(2x 3) = 1. Then x = 2, which yields f (x) = 4, a prime power.

(2x 3) = 1. Then x = 1, which yields f (x) = 3, not a prime power.

(x + 2) = 1). Then x = 1, which yields f (x) = 5 not a prime power.

(x + 2) = 1. Then x = 3, which yields f (x) = 9, a prime power.

(2x 3) = 7. Then x = 5, which yields f (x) = 49, a prime power.

(2x 3) = 7. Then x = 2, which yields f (x) = 0, not a prime power.

(2x 3) + 7

(2x 3) = 7n , for n 2. Then, since x + 2 =

, we have that x + 2 is divisible by 7

2

but not by 49. Hence x + 2 = 7, yielding x = 5, 9. The former has already been considered,

while the latter yields f (x) = 147.

So x can be either -3, 2 or 5.

(Note: In the official solutions packet we did not list the answer -3. This oversight was quickly noticed

on the day of the test, and only the answer 3, 2, 5 was marked as correct.

9. Let ABCDEF be a regular hexagon of area 1. Let M be the midpoint of DE. Let X be the

intersection of AC and BM , let Y be the intersection of BF and AM , and let Z be the intersection

of AC and BF . If [P ] denotes the area of polygon P for any polygon P in the plane, evaluate

[BXC] + [AY F ] + [ABZ] [M XZY ].

Answer: 0

B

Z

Y

X

O

Let O be the center of the hexagon. The desired area is [ABCDEF ] [ACDM ] [BF EM ]. Note

that [ADM ] = [ADE]/2 = [ODE] = [ABC], where the last equation holds because sin 60 = sin 120 .

Thus, [ACDM ] = [ACD] + [ADM ] = [ACD] + [ABC] = [ABCD], but the area of ABCD is half the

area of the hexagon. Similarly, the area of [BF EM ] is half the area of the hexagon, so the answer is

zero.

10. For all real numbers x, let

f (x) =

2011

1

.

1 x2011

2011

1 x2011

and f (f (f (x))) = x.

x

Hence (f (f (. . . (f (x)) . . .))) = x, where f is applied 2010 times. So (f (f (. . . (f (2011)) . . .)))2011 =

20112011 .

2011

Z

ln x

11. Evaluate

dx.

x

1

Answer:

20112011

d

n lnn1 x

(ln x)n =

.

dx

x

We calculate the definite integral using integration by parts:

Answer:

2011!

20102012

x=1

x= Z

(ln x)n

(ln x)n

n(ln x)n1

dx

=

dx

2011

2010

2011

x

2010x

x=1 2010x

x=1

(ln x)n

x2010

(ln x)n

n!

dx =

x2011

2010n

x=1

It follows that

x=1

So the answer is

(ln x)n

dx =

x2011

x=1

x=1

n(ln x)n1

dx

2010x2011

1

n!

dx =

x2011

2010n+1

2011!

20102012 .

12. Let f (x) = x2 + 6x + c for all real numbers x, where c is some real number. For what values of c does

f (f (x)) have exactly 3 distinct real roots?

Answer:

11 13

2

Suppose f has only one distinct root r1 . Then, if x1 is a root of f (f (x)), it must

be the case that f (x1 ) = r1 . As a result, f (f (x)) would have at most two roots, thus not satisfying

the problem condition. Hence f has two distinct roots. Let them be r1 6= r2 .

Since f (f (x)) has just three distinct roots, either f (x) = r1 or f (x) = r2 has one distinct root. Assume

without loss of generality that r1 has one distinct root. Then f (x) = x2 + 6x + c = r1 has one root, so

that x2 + 6x + c r1 is a square polynomial. Therefore, c r1 = 9, so that r1 = c 9. So c 9 is a

13

2

root of f . So (c 9)2 + 6(c 9) + c = 0, yielding c2 11c + 27 = 0, or (c 11

2 ) = 2 . This results to

c = 112 13 .

double root, -3. Now 5+2 13 > 72 13 so the second root is above the vertex of the parabola, and is

hit twice.

If c = 11+2 13 , f (x) = x2 + 6x + 11+2 13 = (x + 72 13 )(x + 5+2 13 ). We know f (x) = 7+2 13 has a

double root,

-3, and this is the valueof f at the vertex of the parabola, so it is its minimum value.

Since 52 13 < 7+2 13 , f (x) = 52 13 has no solutions. So in this case, f has only one real root.

So the answer is c =

11 13

.

2

Note: In the solutions packet we had both roots listed as the correct answer. We noticed this oversight

on the day of the test and awarded points only for the correct answer.

13. Sarah and Hagar play a game of darts. Let O0 be a circle of radius 1. On the nth turn, the player

whose turn it is throws a dart and hits a point pn randomly selected from the points of On1 . The

player then draws the largest circle that is centered at pn and contained in On1 , and calls this circle

On . The player then colors every point that is inside On1 but not inside On her color. Sarah goes

first, and the two players alternate turns. Play continues indefinitely. If Sarahs color is red, and

Hagars color is blue, what is the expected value of the area of the set of points colored red?

Answer:

6

7

Let f (r) be the average area colored red on a dartboard of radius r if Sarah plays first.

Then f (r) is proportional to r2 . Let f (r) = (x)r2 for some constant x. We want to find f (1) = x.

In the first throw, if Sarahs dart hits a point with distance r from the center of O0 , the radius of O1

will be 1r. The expected value of the area colored red will be ( (1r)2 )+((1r)2 f (1r)) =

f (1 r). The value of f (1) is the average value of f (1 r) over all points in O0 . Using polar

coordinates, we get

2

R R1

f (1) =

( f (1 r))rdrd

0 0

2

R R1

rdrd

0 0

R1

x =

R1

rdr

x

=

2

r xr(1 r)2 dr

1 2 1

= x( + )

2

2

2 3 4

x

x

=

2

2

12

Algebra & Calculus Individual Test

x =

6

7

14. How many polynomials P with integer coefficients and degree at most 5 satisfy 0 P (x) < 120 for all

x {0, 1, 2, 3, 4, 5}?

Answer: 86400000 For each nonnegative integer i, let xi = x(x 1) (x i + 1). (Define x0 = 1.)

Lemma: Each polynomial with integer coefficients f can be uniquely written in the form

f (x) = an xn + . . . + a1 x1 + a0 x0 , an 6= 0.

Proof: Induct on the degree. The base case (degree 0) is clear. If f has degree m with leading coefficient

c, then by matching leading coefficients we must have m = n and an = c. By the induction hypothesis,

f (x) cxn can be uniquely written as an1 xn1 (x) + . . . + a1 x1 + a0 x0 .

There are 120 possible choices for a0 , namely any integer in [0, 120). Once a0 , . . . , ai1 have been

chosen so 0 P (0), . . . , P (i 1) < 120, for some 0 i 5, then we have

P (i) = ai i! + ai1 ii1 + + a0

so by choosing ai we can make P (i) any number congruent to ai1 ii1 + + a0 modulo i!. Thus there

are 120

i! choices for ai . Note the choice of ai does not affect the value of P (0), . . . , P (i 1). Thus all

polynomials we obtain in this way are valid. The answer is

5

Y

120

i=0

= 86400000.

i!

Note: Their is also a solution involving finite differences that is basically equivalent to this solution.

One proves that for i = 0, 1, 2, 3, 4, 5 there are 5!

i! ways to pick the ith finite difference at the point 0.

15. Let f : [0, 1] [0, 1] be a continuous function such that f (f (x)) = 1 for all x [0, 1]. Determine the

Z 1

set of possible values of

f (x) dx.

0

Answer:

( 34 , 1]

R1

0

f (x)dx 1.

By our condition f (f (x)) = 1, f is 1 at any point within the range of f . Clearly, 1 is in the range of

f , so f (1) = 1. Now f (x) is continuous on a closed interval so it attains a minimum value c. Since c

is in the range of f , f (c) = 1.

R1

If c = 1, f (x) = 1 for all x and 0 f (x)dx = 1.

Now assume c < 1. By the intermediate value theorem, since f is continuous it attains all values

between c and 1. So for all x c, f (x) = 1. Therefore,

Z

Z

f (x)dx =

f (x)dx + (1 c).

0

Rc

Since f (x) c, 0 f (x)dx > c2 , and the equality is strict because f is continuous and thus cannot be

c for all x < c and 1 at c. So

Z

0

Therefore

3

4

<

R1

0

1

3

3

f (x)dx > c2 + (1 c) = (c )2 + .

2

4

4

f (x)dx 1, and it is easy to show that every value in this interval can be reached.

16. Let f (x) = x2 r2 x + r3 for all real numbers x, where r2 and r3 are some real numbers. Define a

sequence {gn } for all nonnegative integers n by g0 = 0 and gn+1 = f (gn ). Assume that {gn } satisfies

the following three conditions: (i) g2i < g2i+1 and g2i+1 > g2i+2 for all 0 i 2011; (ii) there exists

a positive integer j such that gi+1 > gi for all i > j, and (iii) {gn } is unbounded. If A is the greatest

number such that A |r2 | for any function f satisfying these properties, find A.

Answer: 2 Consider the function f (x) x. By the constraints of the problem, f (x) x must be

negative for some x, namely, for x = g2i+1 , 0 i 2011. Since f (x) x is positive for x of large

absolute value, the graph of f (x) x crosses the x-axis twice and f (x) x has two real roots, say

a < b. Factoring gives f (x) x = (x a)(x b), or f (x) = (x a)(x b) + x.

Now, for x < a, f (x) > x > a, while for x > b, f (x) > x > b. Let c 6= b be the number such that

f (c) = f (b) = b. Note that b is not the vertex as f (a) = a < b, so by the symmetry of quadratics, c

r2

r2 +1

b+a

is the vertex of

exists and b+c

2 = 2 as the vertex of the parabola. By the same token, 2 =

2

f (x) x. Hence c = a 1. If f (x) > b then x < c or x > b. Consider the smallest j such that gj > b.

Then by the above observation, gj1 < c. (If gi b then f (gi ) gi b so by induction, gi+1 gi for

all i j. Hence j > 1; in fact j 4025.) Since gj1 = f (gj2 ), the minimum value of f is less than c.

The minimum value is the value of f evaluated at its vertex, b+a1

, so

2

b+a1

<c

f

2

b+a1

b+a1

b+a1

a

b +

<a1

2

2

2

1 (b a)2

ba+1

+

<0

4

2

(b a)2

ba

3

<

4

4

2

4 < (b a 1)2 .

Then either b a 1 < 2 or b a 1 > 2, but b > a, so the latter must hold and (b a)2 > 9.

Now, the discriminant of f (x) x equals (b a)2 (the square of the difference of the two roots) and

(r2 + 1)2 4r3 (from the coefficients), so (r2 + 1)2 > 9 + 4r3 . But r3 = g1 > g0 = 0 so |r2 | > 2.

We claim that we can make |r2 | arbitrarily close to 2, so that the answer is 2. First

define Gi , i 0

as follows. Let N 2012 be an integer. For > 0 let h(x) = x2 2 , g (x) = x + 2 + and

G2N +1 = 2 + , and define Gi recursively by Gi = g (Gi+1 ), Gi+1 = h(Gi ). (These two equations are

consistent.) Note the following.

(i) G2i < G2i+1 and G2i+1 > G2i+2 for 0 i N 1. First note G2N = 4 + 2 > 4 + 2 + 2 =

2 . Let l be the negative solution to h(x) = x. Note that 2 < G2N < l < 0 since

h(G2N ) > 0 > G2N . Now g (x) is defined as long as x 2 , and it sends (2 , l) into (l, 0)

and (l, 0) into (2 , l). It follows that the Gi , 0 i 2N are well-defined; moreover, G2i < l

and G2i+1 > l for 0 i N 1 by backwards induction on i, so the desired inequalities follow.

(ii) Gi is increasing for i 2N + 1. Indeed, if x 2 + , then x2 x = x(x 1) > 2 + so h(x) > x.

Hence 2 + = G2N +1 < G2N +2 < .

(iii) Gi is unbounded. This follows since h(x) x = x(x 2) 2 is increasing for x > 2 + , so Gi

increases faster and faster for i 2N + 1.

Now define f (x) = h(x + G0 ) G0 = x2 + 2G0 x + G20 G0 2 . Note Gi+1 = h(Gi ) while

gi+1 = f (gi ) = h(gi + G0 ) G0 , so by induction gi = Gi G0 . Since {Gi }

i=0 satisfies (i), (ii), and

(iii), so does gi .

We claim that we can make G0 arbitrarily close to 1 by choosing N large enough and small enough;

this will make r2 = 2G0 arbitrarily close to 2. Choosing N large corresponds to taking G0 to be a

larger iterate of 2 + under g (x). By continuity of this function with respect to x and , it suffices to

g (n) (2) = g( g (2) ) 1 as n .

| {z }

n

2,

= 2 cos

.

2

2

2

Hence by induction, g (n) (2 cos ) = 2 cos 2 4 + + (1)n 2n . Hence g (n) (2) = g (n1) (2 cos 0)

converges to 2 cos( 2 4 + ) = 2 cos( 3 ) = 1, as needed.

17. Let f : (0, 1) (0, 1) be a differentiable function with a continuous derivative such that for every

n

positive integer

n and odd positive integer a < 2n , there exists

an odd positive integer b < 2 such

b

a

0 1

that f 2n = 2n . Determine the set of possible values of f 2 .

Answer: {1, 1}

The key step is to notice that for such a function f , f 0 (x) 6= 0 for any x.

Assume, for sake of contradiction that there exists 0 < y < 1 such that f 0 (y) = 0. Since f 0 is

a continuous function, there is some small interval (c, d) containing y such that |f 0 (x)| 21 for all

x (c, d). Now there exists some n, a such that 2an , a+1

2n are both in the interval (c, d). From the

a

0

f ( a+1

)

f

(

)

b

b

n

n

2

2

= 2n ( n n ) = b0 b where b, b0 are integers; one is odd, and one is

definition,

a

a+1

2

2

2n 2n

0

even. So b b is an odd integer. Since f is differentiable, by the mean value theorem there exists a

point where f 0 = b0 b. But this point is in the interval (c, d), and |b0 b| > 12 . This contradicts the

assumption that |f 0 (x)| 12 for all x (c, d).

Since f 0 (x) 6= 0, and f 0 is a continuous function, f 0 is either always positive or always negative. So f is

either increasing or decreasing. f ( 21 ) = 21 always. If f is increasing, it follows that f ( 14 ) = 14 , f ( 34 ) = 34 ,

and we can show by induction that indeed f ( 2an ) = 2an for all integers a, n. Since numbers of this form

are dense in the interval (0, 1), and f is a continuous function, f (x) = x for all x.

It can be similarly shown that if f is decreasing f (x) = 1 x for all x. So the only possible values of

f 0 ( 21 ) are 1, 1.

Query: if the condition that the derivative is continuous were omitted, would the same result still

hold?

2

2

18. Let z = cos

+ i sin

, and let

2011

2011

P (x) = x2008 + 3x2007 + 6x2006 + . . .

2008 2009

2009 2010

x+

2

2

Answer: 20112009 (10052011 10042011 )

2009 2010

,

2

or,

P (x)(x 1) + 2010 1005 = x2009 + 2x2008 + . . . + 2009x + 2010.

Multiplying by x 1 once again:

(x 1)(P (x)(x 1) +

2010 2011

) = x2010 + x2009 + . . . + x 2010,

2

= (x2010 + x2009 + . . . + x + 1) 2011.

Hence,

(x2010 + x2009 + . . . + x + 1) 2011

2011 1005

x1

P (x) =

x1

Note that x2010 +x2009 +. . .+x+1 has z, z 2 , . . . , z 2010 as roots, so they vanish at those points. Plugging

those 2010 powers of z into the last equation, and multiplying them together, we obtain

2010

Y

(2011) 1005 (x

P (z ) =

(x 1)2

i=1

1004

)

1005 .

Note that (x z)(x z 2 ) . . . (x z 2010 ) = x2010 + x2009 + . . . + 1. Using this, the product turns out to

be 20112009 (10052011 10042011 ).

19. Let

F (x) =

1

,

(2 x x5 )2011

an

= c.

n nd

n=0

Answer:

( 6201112010! , 2010)

First notice that all the roots of 2 x x5 that are not 1 lie strictly

outside the unit circle. As such, we may write 2 x x5 as 2(1 x)(1 r1 x)(1 r2 x)(1 r3 x)(1 r4 x)

(1x)

b0

b1

b4

1

where |ri | < 1, and let (2xx

5 ) = (1x) + (1r x) +. . .+ (1r x) . We calculate b0 as limx1 (2xx5 ) =

1

4

limx1

(1)

(15x4 )

= 61 .

2011

1/6

b1

b4

1

=

+

+

.

.

.

+

(2 x x5 )2011

(1 x) (1 r1 x)

(1 r4 x)

Expand the right hand side using multinomial expansion and then apply partial fractions. The result

will be a sum of the terms (1 x)k and (1 ri x)k , where k 2011.

Since |ri | < 1, the power series of (1 ri x)k will have exponentially decaying coefficients, so we only

need to consider the (1 x)k terms. The coefficient of xn in the power series of (1 x)k is n+k1

k1 ,

which is a (k 1)th degree polynomial in variable n. So when we sum up all coefficients, only the

power series of (1 x)2011 will have impact on the leading term n2010 .

The coefficient of the (1 x)2011 term in the multinomial expansion is ( 16 )2011 . The coefficient of

1

the xn term in the power series of (1 x)2011 is n+2010

= 2010!

n2010 + . . .. Therefore, (c, d) =

2010

1

( 62011 2010! , 2010).

p

20. Let {an } and

{b

}

be

sequences

defined

recursively

by

a

=

2;

b

=

2,

and

a

=

a

1 + a2n + b2n bn ;

n

0

0

n+1

n

p

2

2

bn+1 = bn 1 + an + bn + an . Find the ternary (base 3) representation of a4 and b4 .

Answer: 1000001100111222 and 2211100110000012

p

n

Note first that 1 + a2n + b2n = 32 . The proof is by induction; the base case follows trivially

p from what

is given. For the inductive step, note that 1+a2n+1 +b2n+1 = 1+a2n (1+a2n +b2n )+b2n 2an bn 1 + a2n + b2n +

p

b2n (1 + a2n + b2n ) + a2n + 2an bn 1 + a2n + b2n = 1q

+ (a2n + b2n )(1 + a2n + b2n ) + a2n + b2n = (1 + a2n + b2n )2 .

n

n+1

Invoking the inductive hypothesis, we see that 1 + a2n+1 + b2n+1 = (32 )2 = 32 , as desired.

The quickest way to finish from here is to consider a sequence of complex numbers {zn } defined by

n

zn = an + bn i for all nonnegative integers n. It should be clear that z0 = 2 + 2i and zn+1 = zn (32 + i).

0

1

2

3

Therefore, z4 = (2 + 2i)(32 + i)(32 + i)(32 + i)(32 + i). This product is difficult to evaluate in

Algebra & Calculus Individual Test

the decimal number system, but in ternary the calculation is a cinch! To speed things up, we will

use balanced ternary 1 , in which the three digits allowed are 1, 0, and 1 rather than 0, 1, and 2. Let

0

1

2

3

x + yi = (32 + i)(32 + i)(32 + i)(32 + i), and consider the balanced ternary representation of x and

y. For all 0 j 15, let xj denote the digit in the 3j place of x, let yj denote the digit in the 3j place

of y, and let b(j) denote the number of ones in the binary representation of j. It should be clear that

xj = 1 if b(j) 2 (mod 4), xj = 0 if b(j) 1 (mod 2), and xj = 1 if b(j) 0 (mod 4). Similarly,

yj = 1 if b(j) 1 (mod 4), yj = 0 if b(j) 0 (mod 2), and yj = 1 if b(j) 3 (mod 4). Converting

to ordinary ternary representation, we see that x = 2212112211220013 and y = 1100222022121203 . It

remains to note that a4 = 2x 2y and b4 = 2x + 2y and perform the requisite arithmetic to arrive at

the answer above.

1 http://en.wikipedia.org/wiki/Balanced_ternary

- GRE GeometryUploaded bykmeena73
- Cv of Ashutosh Biswal-lUploaded byEdwin Quinto
- Weekly_Exam3.pdfUploaded byKarumon Utsumi
- Maxima and Minima - MA Math Ed - Analysis for teachers - Module 6Uploaded byJephthah Malate Orobia
- 8 Maths NCERT Solutions Chapter 3 3Uploaded byknarasimhareddy
- Geometry EOC Practice QuestionsUploaded byoroman
- Folio ADD MATH 2015Uploaded byNtahlah Wei
- Math Paper 3 Grade 11 Nov 2009Uploaded bynealvisagie
- Calculus Lecture 7Uploaded bySuneth Kelum
- Proofs of TheoremsUploaded byNeeloufer Tabassum Shaik
- 2016EJ-Alg_Vect-Wilmer.2015660208.16A_AV_BF_Tarea2doDep.pdfUploaded byPaulina Sainz
- Calculus 3.FormulasUploaded byjeffconnors
- mathematicsstudysum.pdfUploaded bymasasaki
- Experiment 3Uploaded byAlfonso S. Espinosa Jr
- 2009 Smo BookletUploaded byRomario Tambunan
- Real Analysis Notes9Uploaded byMathsisCoolV1
- 10 2006 Mathematics 1Uploaded byprashant dwivedi
- Geometry Extra NotesUploaded byben0706
- solutii_senioriUploaded bymacoveilaurentiu
- UntitledUploaded byapi-162641823
- Analytic Geometry StandardsUploaded byKraig Angel Ramos
- CPR C Programs - CH02 if-elseUploaded byapi-3728136
- areas_sombreadas (2) (1)Uploaded byJamil Cerrato Carbajal
- proof-oneUploaded byapi-253901565
- geometry sem 2 final exam review 3Uploaded byapi-236083800
- IGO2015 Problems EnglishUploaded byNarendrn Kanaeson
- Lines Triangles Practise Exercise 1Uploaded byUtkarshKumbhare
- Bary_fullUploaded bygauss202
- NCTM ProblemsUploaded byVarun Reddy
- ifelseassUploaded byDipin Preet Singh

- algebra7combnatorcs.pdfUploaded byssshhhki
- advtopicsans.pdfUploaded byssshhhki
- calculusans.pdfUploaded byssshhhki
- algebraans.pdfUploaded byssshhhki
- combnatorics&geom.pdfUploaded byssshhhki
- Gibilisco Electronics DemystifiedUploaded byJPaulo Dandan
- calculus&combnatorcs.pdfUploaded byssshhhki
- calculus&geom.pdfUploaded byssshhhki
- Probability questionUploaded byRowEll CañEta
- 13th PMO 2010 Qualifying Stage- Anwers KeyUploaded bytesinia
- Math BooksUploaded byMONALEDEZMA
- algebra&geom.pdfUploaded byssshhhki
- combinatorics_matholympiadtraining'04.pdfUploaded byssshhhki
- ELEX 1-5Uploaded byssshhhki
- ELEX 6-10Uploaded byssshhhki
- Elementary Circuits - Circuits InstructorUploaded byssshhhki
- Mastering Hand Tool Techniques a Comprehensive GuideUploaded byssshhhki
- Antiques Investigator DKUploaded byekoya
- Examiners-Reports-NGC1-Only_September-2011-NGC11.pdfUploaded byssshhhki
- Calculus - Integration by Substitution.pdfUploaded byssshhhki
- 1000_Ideas_for_Creative_ReuseUploaded bycassia_am
- Leading-Edge Electric Power ResearchUploaded byssshhhki
- Working With WoodUploaded byAnonymous OcN0BHXFt
- Examiners-Reports-from-June-2008-NGC1-Only_December-2008-NGC.pdfUploaded byssshhhki
- AutoCAD 2010 for Dummies Cheat Sheet - For DummiesUploaded byssshhhki
- A User’s Guide to Fencing and Decking MaterialsUploaded byssshhhki
- Calculus 08 Techniques of IntegrationUploaded bytutulkar
- How to Use Microsoft Access 2010Uploaded byRebecca Yatkowitz
- The Complete Guide to DecksUploaded byssshhhki

- Mahony v. Pickus, CUMcv-04-141 (Cumberland Super. Ct., 2008)Uploaded byChris Buck
- Oscar Cullmann: Baptism in the New TestamentUploaded byStudiosus Theologiae
- People vs., SabalonesUploaded byAldrinmarkquintana
- My Bearish LifeUploaded byAlexandre Almeida
- 201805 FHSC1014 Mechanics Tutorial 6 S (1)Uploaded bySteve Thaw
- ECS203 - handout 3B.pdfUploaded bymemrah2955
- 2017 spg spelling only 0Uploaded byapi-260665081
- RBI and FunctionsUploaded byviveksharma51
- exercise 11 - heteroatoms in the hmo methodUploaded byapi-235187189
- 560 - SPL V2 for DevelopersUploaded byVinit Shah
- YgdrassilUploaded byMateo Jaramillo
- Alchemy.pdfUploaded bymastroirmo
- 10Deliverance.pdfUploaded byFERNS
- Animal Cruelty FinalUploaded byDaisy Escamilla
- Kiichiro Itsumi Pindaric Metre The Other Half.pdfUploaded byMladen Toković
- Tax CodeUploaded bypeachy_swakk
- CCNA 1 Module 8 Exam SolutionsUploaded bySarah Noureddine
- Architecture Depends by Jeremy Till : SAMPLE CHAPTER preface - mess is the lawUploaded byAdministrator
- Theory Into Practice, 45(4), 311–318Uploaded bydistanceprep
- Richard Hamilton Tabular ImageUploaded byStacey King
- Grammatical EquivalenceUploaded byEdwin Firmansyah
- Buffer Design - Posiva (2012)Uploaded byRaoni Adão
- 14 page bibliography of Feminist SF 1818-1949Uploaded byjasper_gregory
- Bernard Crawford v. Jack Cowley, Warden, 9 F.3d 116, 10th Cir. (1993)Uploaded byScribd Government Docs
- peer and self evaluationUploaded byapi-267618279
- Ppp IndonesiaUploaded byAngela Aprina Kartika Putri
- 3. Your Next Holiday Destination(1)Uploaded byjaceth villafañe
- ChaRM-CSOL and Incident_Change_Tobias Hauk.pdfUploaded bykishore
- aadhar.pdfUploaded byMahesh Sabu
- Break Even Analysis. presentation by MOhammad NawazUploaded bynwzashraf