Spain Mathematical Olympiad Problem 3

Find the largest integer N N satisfying the following two conditions:

(i) N 3 \lfloor \frac N3 \rfloor consists of three equal digits;

(ii) N 3 = 1 + 2 + 3 + + n \lfloor \frac N3 \rfloor = 1 + 2 + 3 +\cdots + n for some positive integer n . n.

\lfloor \cdot \rfloor denotes the floor function.


The answer is 2000.

This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try refreshing the page, (b) enabling javascript if it is disabled on your browser and, finally, (c) loading the non-javascript version of this page . We're sorry about the hassle.

3 solutions

Kartik Sharma
Mar 29, 2015

It's really very easy. Just see that -

111 a = n ( n + 1 ) 2 111*a = \frac{n(n+1)}{2} , such that a = [ 1 , 9 ] a = [1,9] , which I think is the immediate reaction to the problem.

Then we know that 111 = 37 3 111 = 37*3 , and that 111 n ( n + 1 ) 111|n(n+1)

Immediately, the minimum solution comes as n + 1 = 37 n+1 = 37 because if n = 37 n = 37 , then n + 1 n+1 is not a multiple of 3 3 .

And hence 666 666 becomes the answer.

But what about the case above 37 37 ? Well, it will be a multiple of 111 111 only. The minimum of the immediate multiple will be for n = 37 2 n= 37*2 and n + 1 = 25 3 n+1 = 25*3 But here it comes out to be 111 25 111*25 but wait a = [ 1 , 9 ] a = [1,9] and hence there are no more solutions(as if the 'minimum' of an increasing sequence doesn't work, how can the ones greater than it work?)

Hence, N 3 = 666 \lfloor \frac{N}{3} \rfloor = 666 . And maximum occurs obviously at N = 666 3 + 2 = 2000 N = 666*3+2 = 2000

This was an 'obvious' problem, so I wrote it a little too informal. Sorry for that!

Kartik Sharma - 6 years, 2 months ago

In fact (for those who don't know) the 'three' is unnecessary.

Joel Tan - 6 years, 1 month ago
Andrea Palma
Apr 19, 2015

( i ) (i) and ( i i ) (ii) imply that

a × 111 = n ( n + 1 ) 2 a\times 111 = \dfrac{n(n+1)}{2}

for some n N n \in \mathbb N and some a { 1 , 2 , 3 , 4 , 5 , 6 , 7 , 8 , 9 } a \in \{1,2,3,4,5,6,7,8,9 \} .

Hence

n ( n + 1 ) = 2 × a × 111 = 2 × a × 3 × 37 n(n+1) = 2\times a \times 111 = 2 \times a \times 3 \times 37

37 37 is prime so it divides either n + 1 n+1 or n n (and not both, couse two consecutive integers are prime).

This means that n + 1 n+1 or n n is a multiple of 37 37 . If this multiple was greater that 37 37 itself, we would have it is at least 74 74 . And hence we would get

n ( n + 1 ) 74 73 a × 2 × 3 × 37 74 × 73 3 a 73 n(n+1) \geq 74*73 \Rightarrow a \times 2 \times 3 \times 37 \geq 74 \times 73 \Rightarrow 3a \geq 73

against the fact that a 9 a \leq 9 .

So this multiple IS 37 37 , and this means n = 37 n = 37 or n = 36 n = 36 .

If n = 37 n = 37 we would get

37 × 38 = 2 × a × 3 × 37 38 = 2 × a × 3 37\times38 = 2 \times a \times 3 \times 37 \Rightarrow 38 = 2 \times a \times 3

that is impossible because 3 3 doesn't divide 38 38 .

The only chance is so n = 36 n= 36 and this lead to a = 6 a = 6 .

Trivially the greatest N N such that

[ N 3 ] = 666 \left[\dfrac{N}{3}\right] = 666

is 2000 2000 .

It is indeed problem 4 in year 2000.

Sum consecutive numbers 1 + 2 + + k 1+2+\ldots+k until you get over 1000 1000 . Indeed, you have to do it until k = 46 k=46 , and get the (only) solution for k = 36 k=36 . Of course this is a really bad solution, but it will not take more than 20 minutes, which is fine in an olympiad.

What about the problem with 4 or more equal digits?

If there is a better way to solve the problem in less than 20 min, why not opt for that one instead?

Yugendra Uppalapati - 9 months ago

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...