Does there exist positive integer n such that 2 3 . . . n − 2 n − 1 n ≥ 3 ?
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.
it's clear that there exists no positive integers > 0 for which n n ≥ 3 n ! will be true hence it is in contradiction to our assumption.
Why is this true?
Problem Loading...
Note Loading...
Set Loading...
Let's assume that : 2 3 . . . n − 2 n − 1 n ≥ 3 ⟹ n 1 × 2 × 3 × ⋯ × ( n − 1 ) 1 ≥ 3 ⟹ n ( n − 1 ) ! 1 ≥ 3 ⟹ n ≥ 3 ( n − 1 ) ! ⟹ n n ≥ 3 n ! it's clear that there exists no positive integers > 0 for which n n ≥ 3 n ! will be true ( can proved by induction) hence it is in contradiction to our assumption.
So , the answer is No .