Y = [ ( 1 + n 1 ) ( 1 + n 2 ) ( 1 + n 3 ) ⋯ ( 1 + n n ) ] n 1
Find the value of ⌈ Y ⌉ , where n is a positive integer.
Submit your answer as 123 if you think that the answer depends on the value of n
Notation : ⌈ ⋅ ⌉ denotes the ceiling function .
This problem is a part of the set All-Zebra
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.
Elegant :) !!
Log in to reply
Yes, but can there be an alternative approach for solving problems which state that n is a positive integers by substituting n = 1,2,3,... For example
when n=1, then
⌈
Y
⌉
=
2
when n=2, then
⌈
Y
⌉
=
2
when n=3, then
⌈
Y
⌉
=
2
Thoughts?
Log in to reply
But it does not prove that for all infinitely many values of n it equals 2.
Log in to reply
@Nihar Mahajan – Yes it is but then the question itself becomes wrong if it the answer is equal for some n but not for others right? :thinkingface:
Log in to reply
@Ashish Menon – Its a more like proof based question rather than answer-computing.Proving that would improve your skills rather than taking advantage of the brilliant's system of answer-accepting ;)
@Nihar Mahajan – I think the question should include "this should be true for all n. If you think this is not possible, enter 123".
@Nihar Mahajan – It never equals to 2, but always stays between 1 and 2.
Log in to reply
@Abhay Tiwari – I obviously know that.But ⌈ Y ⌉ remains 2 right?
Log in to reply
@Nihar Mahajan – Yes, it will a l w a y s remain 2.
@Abhay Tiwari – What about when n=1?
Log in to reply
@Ashish Menon – Ohk, it equal to 2, forgot to mention that. :P
Log in to reply
@Abhay Tiwari – Nvm, i agree with nihar though it is better to prove it for all values than that method, btw it is valid still in JEE right?
Log in to reply
@Ashish Menon – Yep, you can use it as a "shortcut" or "time-saving" method in JEE. (Though such a question has a very low probability to be asked in JEE).However, its not mathematically complete.
@Nihar Mahajan – Congo on 2000 followers
Ashish, there is one more solution at the last, maybe that is the answer to all the questions you seek. ;), he has done simply by logic plus by conventional method.
Log in to reply
@Abhay Tiwari – That was a small typo plz correct it thanks! :))
Awesome solution from you as always @Chew-Seong Cheong
On one hand,
Y
>
(
(
1
+
n
1
)
(
1
+
n
1
)
⋯
(
1
+
n
1
)
)
n
1
=
1
+
n
1
>
1
On the other hand,
Y
<
(
(
1
+
n
n
)
(
1
+
n
n
)
⋯
(
1
+
n
n
)
)
n
1
=
1
+
n
n
=
2
Concluded,
1
<
Y
<
2
∴
⌈
Y
⌉
=
2
Great, can you find the exact value?
Log in to reply
Exact value? Do you mean when n → ∞ ?
Log in to reply
Yes. When n → ∞
Log in to reply
@Abhay Tiwari
–
ln
lim
n
→
∞
(
(
1
+
n
1
)
(
1
+
n
2
)
⋯
(
1
+
n
n
)
)
n
1
=
lim
n
→
∞
n
1
(
ln
(
1
+
n
1
)
+
ln
(
1
+
n
2
)
+
⋯
ln
(
1
+
n
n
)
)
=
∫
0
1
ln
(
1
+
x
)
d
x
=
(
1
+
x
)
ln
(
1
+
x
)
∣
0
1
−
∫
0
1
d
x
=
2
ln
2
−
1
∴
n
→
∞
lim
Y
=
e
2
ln
2
−
1
=
e
4
Log in to reply
@展豪 張 – Great :(+1): :)
Log in to reply
@Abhay Tiwari
–
At first I thought your question is asking this, but I soon find out it's actually asking
⌈
Y
⌉
. =D
:like: (+1)
Abhay, it was me who change the wording of the problem. I hope it is okay for you.
Without loss of generality, we can assume n is equal to 1. Plugging it in, we find that Y is 2.
Problem Loading...
Note Loading...
Set Loading...
Using the AM-GM inequality, we have:
Y ⟹ Y ≤ n 1 k = 1 ∑ n ( 1 + n k ) ≤ n 1 k = 1 ∑ n 1 + n 2 1 k = 1 ∑ n k ≤ n n + 2 n 2 n ( n + 1 ) ≤ 2 3 + 2 n 2 1 As 2 3 + 2 n 2 1 is maximum when n = 1 and 2 3 + 2 n 2 1 ≤ 2 ≤ 2
Since each factor ( 1 + n k ) > 1 , their product Y > 1 .
Therefore 1 < Y ≤ 2 ⟹ ⌈ Y ⌉ = 2