Scribd
Upload
8 views

Tmcsoln 1 R

Uploaded by

codewizard.19
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
8 views

Tmcsoln 1 R

Uploaded by

codewizard.19
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

5.

The sum of a sequence of consecutive positive integers is equal to the


Answer Key 4. 7 number of terms multiplied by the average of the first and last terms,
1. 2 5. 40 which gives

2. 115 6. F2014 F2011 14 + 15 + 16 + · · · + n = (n − 14 + 1) · 12 (n + 14).

3. 6 7. 768 To obtain a power of 3, each separate factor must be a power of 3. Thus


both n − 13 and 21 (n + 14) must be one of 1, 3, 9, 27, . . . , giving

n = 14, 16, 22, 40, . . . and n = −12, −8, 4, 40, . . .


1. There are exactly two such circles, as illustrated by the diagram
below. This is generally true—but can you find positions for the two The smallest value of n for which both factors are powers of 3 is n = 40.
given points for which there is only one such circle?
6. Observe that the given expression may be factored as

2 2
3F2012 − 4F2012 F2010 + F2010 = (3F2012 − F2010 )(F2012 − F2010 ).

Since F2012 = F2011 + F2010 , the latter factor reduces to just F2011 . To
handle the first factor, we compute

3F2012 − F2010 = 2F2012 + (F2012 − F2010 )


2. Adarsh covers 5(14)+5(3) = 85 feet every ten seconds, so after eleven = 2F2012 + F2011
such intervals he travels (11)(85) = 935 feet. Five seconds later (moving
= F2012 + F2012 + F2011
at 14 feet per second) he will be at the 935+70 = 1005 foot mark. Hence
= F2012 + F2013
the answer is 10(11) + 5 = 115 seconds, to the nearest second.
= F2014 ,
3. The sum is easier to evaluate if we first pair adjacent numbers as
suggested in the diagram. Because of the location of the by definition of Fibonacci numbers. Hence the entire expression reduces
even and odd numbers, each pair covered by a white oval to F2014 F2011 .
sums to +1, while each pair covered by a dark oval adds
7. One shortcut to handling the count is to observe that reversing the
to −1. Hence the overall total is 18 − 12 = 6.
colors of every square within a particular column does not affect whether
4. Here is a curious instance in which the straight line path does not or not a certain coloring satisfies the given conditions. This means that
give the minimal answer! To steer clear of as many points with integer we can assume that the top row contains only white squares, find a legit-
coordinates as possible, follow a staircase path from (1, 1) to (4, 4). It imate coloring, then reverse the squares within any subset of columns,
is equally effective to head straight across to (4, 1) then up to (4, 4), or which can be done in 24 = 16 ways.
perhaps to go up to (1, 4) first before moving across to (4, 4). Any of So for now we assume that the top row contains only white squares.
these paths yields exactly 7 red points. The next row must contain a pair of black squares, which can be placed in
4
November 2011

2 = 6 ways. The third row must also contain a pair of black squares,
one that overlaps with a previous black square and one that doesn’t,
which can be done in 4 ways. Regardless of the positions of the black
squares thus far, the final row can be colored in exactly 2 ways. (Why?)
Hence the overall total is (16)(6)(4)(2) = 768.
c Greater Testing Concepts 2010

? Regional Level ?

Round One Solutions

Greater Testing Concepts The Mandelbrot Competition


PO Box 760 www.mandelbrot.org
Potsdam, NY 13676 [email protected]

You might also like