1 2 2 3 4 3 4 6 6 4 5 8 9 8 5 6 1 0 1 2 1 2 1 0 6 ⋮
In the triangle above, the outer diagonal lines are 1 , 2 , 3 , 4 , … , which begins at 1 and each number after the first is one larger than the previous number.
The next diagonal lines are 2 , 4 , 6 , 8 , … , which begins at 2 and each number after the first is two larger than the previous number.
SImiarly, the n th diagonal begins at n and each number after the first is n larger than the previous number.
In which horizontal row does the number 2016 first appear?
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.
Nice solution. Thank you for the solution. I solved it in one page and was worried how am I gonna write all this using Latex and here you solved it in one paragraph nicely and logically. Thanks again :)
Log in to reply
You are welcome. I did the triangle in LaTex too.
The solution contains the correct steps, and I have some suggestions for clarity. Presenting a clear solution is quite different from simply solving the problem. You have to clearly explain to others, and not just yourself.
Log in to reply
I thought the comment was for me. Sir @Chew-Seong Cheong , I found your solution nice and logical. Sorry for the confusion.
I agree, thank you.
Sorry, I thought it was quite obvious and maybe it was late here then. Anyway, I have redone the solution.
Nice learned something :P
A perhaps shorter but more arbitrary and impractical solution. We know that 2016 appears in every line n = x 2 0 1 6 + x − 1 where is the line from which you start going inwards the triangle. With calculus we find the minimun value n ≈ 8 8 . 8 , but of course n needs to be a natural numbers so we get a theoretical minimum of 89. Now we see if that can be achieved. Solve for x in the above equation which yields x = 4 2 . Thus the theoretical minumun can be achieved hence n = 8 9 .
A perhaps even more "Crude" way. Note that provided n|2016, following the nth diagonal, 2016 appears on the [(2016/n)+n-1]th row. So for example, since 1|2016, 2016 appears on the 2016th row. Since 2|2016, 2016 appears not the 1009th row, and so on. Now, list all the divisors of 2016 and check which row they imply 2016 occurs in. The minimum of these rows is your target. (After some hard work, you find that 42|2016 implying 2016 occurs at the 89th row is the minimum).
The nth row will have the following n numbers;.
n,(n-1)(2),(n-2)(3),..(n-k)(k+1)...{n-(n-1)(n)
The idea is to find (n-k)(k+1)=2016,.
such that (n-k)+(k+1)=(n+1) is minimum.
The sum would be minimum when (n-k) and (k+1) are as close to each other as possible, since 2016 is not perfect square. 2016=48×42 gives the two closest factors of 42 and 48, which can be written as, (89-47)(48) or (89-41)(42),
which means n=89th row.
Problem Loading...
Note Loading...
Set Loading...
The triangle shown is in fact an infinite multiplication table of two positive integers a and b . The mulytiplands a and b are represented by the two sets of diagonals in opposite directions. Let a be represented by the diagonals from the left and b , from right. Then the first left diagonal represents a = 1 ; the second left diagonal, a = 2 ; the third left diagonal, a = 3 and so on. Similarly for b but with the right diagonal. The intersection of the a -diagonal and b -diagonal is the product n = a b . For example, 1 × 6 = 6 is the intersection of the first a -diagonal and the sixth b -diagonal. While 2 × 3 = 6 is the intersection of the second a -diagonal and the third b -diagonal.
We note that when a or b increases by 1, the row number r increases by 1. Now, let us assign the intersection be ( a , b ) . To get to the intersection n = a b , we go from ( 1 , 1 ) → ( 2 , 1 ) → ( 3 , 1 ) → . . . → ( a , 1 ) and then from ( a , 1 ) → ( a , 2 ) → ( a , 3 ) → . . . → ( a , b ) . At ( 1 , 1 ) , r = 1 ; at ( a , 1 ) , r = a ; at ( a , 2 ) , r = a + 1 . . . at ( a , b ) , r = a + b − 1 .
Without loss of generality, let us assume b > a and let δ = b − a be the difference between the two divisors a and b of n . Then, we have:
a b a ( a + δ ) a 2 + δ a − n ⟹ a = n = n = 0 = 2 − δ + δ 2 + 4 n As a > 0 , the negative root is rejected.
Now let us find the minimum r . Since r = a + b − 1 , let us find the minimum a + b .
a + b = 2 a + δ = − δ + δ 2 + 4 n + δ = δ 2 + 4 n
So we can see that a + b increases with δ , the difference between a and b . And for all positive real a and b , a + b is minimum when δ = 0 which is proven by AM-GM inequality : a + b ≥ 2 a b = 2 n . For integral a and b , minimum a + b occurs when δ = b − a is minimum. For n = 2 0 1 6 , a = 4 2 and b = 4 8 and r = 4 2 + 4 8 − 1 = 8 9 .