N satisfying the following two conditions:
Find the largest integer(i) ⌊ 3 N ⌋ consists of three equal digits;
(ii) ⌊ 3 N ⌋ = 1 + 2 + 3 + ⋯ + n for some positive integer n .
⌊ ⋅ ⌋ denotes the floor function.
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.
This was an 'obvious' problem, so I wrote it a little too informal. Sorry for that!
In fact (for those who don't know) the 'three' is unnecessary.
( i ) and ( i i ) imply that
a × 1 1 1 = 2 n ( n + 1 )
for some n ∈ N and some a ∈ { 1 , 2 , 3 , 4 , 5 , 6 , 7 , 8 , 9 } .
Hence
n ( n + 1 ) = 2 × a × 1 1 1 = 2 × a × 3 × 3 7
3 7 is prime so it divides either n + 1 or n (and not both, couse two consecutive integers are prime).
This means that n + 1 or n is a multiple of 3 7 . If this multiple was greater that 3 7 itself, we would have it is at least 7 4 . And hence we would get
n ( n + 1 ) ≥ 7 4 ∗ 7 3 ⇒ a × 2 × 3 × 3 7 ≥ 7 4 × 7 3 ⇒ 3 a ≥ 7 3
against the fact that a ≤ 9 .
So this multiple IS 3 7 , and this means n = 3 7 or n = 3 6 .
If n = 3 7 we would get
3 7 × 3 8 = 2 × a × 3 × 3 7 ⇒ 3 8 = 2 × a × 3
that is impossible because 3 doesn't divide 3 8 .
The only chance is so n = 3 6 and this lead to a = 6 .
Trivially the greatest N such that
[ 3 N ] = 6 6 6
is 2 0 0 0 .
It is indeed problem 4 in year 2000.
Sum consecutive numbers 1 + 2 + … + k until you get over 1 0 0 0 . Indeed, you have to do it until k = 4 6 , and get the (only) solution for k = 3 6 . 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?
Problem Loading...
Note Loading...
Set Loading...
It's really very easy. Just see that -
1 1 1 ∗ a = 2 n ( n + 1 ) , such that a = [ 1 , 9 ] , which I think is the immediate reaction to the problem.
Then we know that 1 1 1 = 3 7 ∗ 3 , and that 1 1 1 ∣ n ( n + 1 )
Immediately, the minimum solution comes as n + 1 = 3 7 because if n = 3 7 , then n + 1 is not a multiple of 3 .
And hence 6 6 6 becomes the answer.
But what about the case above 3 7 ? Well, it will be a multiple of 1 1 1 only. The minimum of the immediate multiple will be for n = 3 7 ∗ 2 and n + 1 = 2 5 ∗ 3 But here it comes out to be 1 1 1 ∗ 2 5 but wait 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, ⌊ 3 N ⌋ = 6 6 6 . And maximum occurs obviously at N = 6 6 6 ∗ 3 + 2 = 2 0 0 0