Which number is bigger:
2 0 1 5 2 0 1 5 ! or 2 0 1 6 2 0 1 6 !
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.
FYI There is no need to place everything within the Latex brackets. Use it only where you need to for the equations. E.g. your first paragraph is not contained within Latex.
Log in to reply
Sorry about that... still kind of learning how to use Latex.
Log in to reply
No worries. It's a learning process and you're off to a good start. I'm excited that you know how to use it pretty well, so I'm giving tips on how to improve further.
Yes! I think so.
Awesome solution!
Same Way(+1)
A nice solution.!!
I think.
A simple way "induction"
(6!)^(1/6) > (5!)^(1/5)
imply (2016!)^(1/2016) > (2015!)^(1/2015).
Each of the two numbers is the geometrical mean of the first n natural numbers:
2 0 1 5 2 0 1 5 ! = 2 0 1 5 2 0 1 5 ⋅ 2 0 1 4 ⋅ 2 0 1 3 ⋅ . . . ⋅ 1
Note that there are 2015 numbers, so the index is 2015.
2 0 1 6 2 0 1 6 ! = 2 0 1 6 2 0 1 6 ⋅ 2 0 1 5 ⋅ 2 0 1 4 ⋅ . . . ⋅ 1
Note that there are 2016 numbers, so the index is 2016.
Analysing a few examples, we can infer that the geometrical mean g(n) of the first n natural numbers increases as n does:
g ( 2 ) = 2 ! = 2 ≅ 1 . 4
g ( 3 ) = 3 3 ! = 3 6 ≅ 1 . 8
g ( 4 ) = 4 4 ! = 4 2 4 > 4 1 6 ∴ g ( 4 ) > 2
Hence, it follows that g ( 2 0 1 6 ) > g ( 2 0 1 5 ) ∴ 2 0 1 6 2 0 1 6 ! > 2 0 1 5 2 0 1 5 ! .
Same way...
n ! = n ( n − 1 ) . . . 1
( n + 1 ) n = ( n + 1 ) ( n + 1 ) . . ( n + 1 ) ( n times)
Since each term of the product ( n + 1 ) n is greater than each term in n !
We have n ! < ( n + 1 ) n for all natural numbers n
Write ( n + 1 ) = n ! ( n + 1 ) ! and multiply ( n ! ) n to both the sides
So ( n ! ) n + 1 < ( ( n + 1 ) ! ) n
Raising both sides by power n ( n + 1 ) 1
( n ! ) n 1 < ( ( n + 1 ) ! ) n + 1 1
Put n=2015 and we get ( 2 0 1 5 ! ) 2 0 1 5 1 < ( 2 0 1 6 ! ) 2 0 1 6 1 which is the desired result
NOTE: How I got this solution? I worked the same method backwards assuming this inequality. You may assume the inequality the other way to and get a contradiction.
Good approach. To better express a working backwards solution, we can use statements like:
We want to show that ...
It suffices to show ...
This is true if and only if ...
As an explicit example, the solution could be rewritten as:
( n ! ) n 1 < ( ( n + 1 ) ! ) n + 1 1 ⇔ ( n ! ) n + 1 < ( ( n + 1 ) ! ) n ⇔ n ! < ( n + 1 ) n
The last inequality is obvious (as stated in your solution).
I used small numbers to justify a trend. Rearranging the question and replacing with variables to look like
( x ! ) x 1
It's easy to just plug in small values. When x = 2 , the answer can be estimated around 1.5 when simplified to ( 2 ) 2 1 .
Use the same method for 3 to compare a higher number that can still be estimated in your head. In this case it's simplified to ( 6 ) 3 1 which can be estimated to 1.8. It can now be said that f ( x ) > f ( x − 1 ) . Not the best way to do it but it's an easy way if you have just a little experience with roots.
By Stirling's approximation ln (n!)= n ln n-n, i.e., n!= (n/e)^n. Therefore n^th root of n! is n/e. So the result now follows.
Only catch is Stirling's approximation is valid only for large n.
Problem Loading...
Note Loading...
Set Loading...
This solution is a little on the long side but because this kind of problem appeals to a large grouping of people with varying abilities I felt it best to leave nothing unexplained. A = 2 0 1 5 2 0 1 5 ! A 2 0 1 5 = 2 0 1 5 ! A 2 0 1 5 ⋅ A = 2 0 1 5 ! ⋅ A A 2 0 1 6 = 2 0 1 5 ! ⋅ 2 0 1 5 2 0 1 5 ! B = 2 0 1 6 2 0 1 6 ! B 2 0 1 6 = 2 0 1 6 ! B 2 0 1 6 = 2 0 1 5 ! ⋅ 2 0 1 6 B e c a u s e w e k n o w A a n d B a r e p o s i t i v e , w e c a n s a y 1 ) I f f B 2 0 1 6 > A 2 0 1 6 t h e n B > A 2 ) I f f A 2 0 1 6 > B 2 0 1 6 t h e n A > B 3 ) I f f A 2 0 1 6 = B 2 0 1 6 t h e n A = B B e c a u s e A 2 0 1 6 a n d B 2 0 1 6 c a n b o t h b e w r i t t e n a s 2 0 1 5 ! m u l t i p l i e d b y s o m e c o n s t a n t , w h o e v e r ′ s c o n s t a n t i s g r e a t e r w i l l b e t h e g r e a t e r n u m b e r T h e c o n s t a n t w h i c h w h e n m u l t i p l i e d w i t h 2 0 1 5 ! g i v e s A 2 0 1 6 i s 2 0 1 5 2 0 1 5 ! T h e c o n s t a n t w h i c h w h e n m u l t i p l i e d w i t h 2 0 1 5 ! g i v e s B 2 0 1 6 i s 2 0 1 6 2 0 1 5 2 0 1 5 ! = 2 0 1 5 2 0 1 5 ⋅ 2 0 1 4 . . . ⋅ 2 ⋅ 1 N o t e t h a t w i t h i n t h e 2 0 1 5 t h r o o t a r e 2 0 1 5 n u m b e r s , a l l o f w h i c h a r e l e s s t h a n 2 0 1 6 , m u l t i p l i e d t o g e t h e r 2 0 1 6 = 2 0 1 5 2 0 1 6 2 0 1 5 N o t e t h a t w i t h i n t h e 2 0 1 5 t h r o o t a r e 2 0 1 5 n u m b e r s , a l l o f w h i c h a r e e q u a l t o 2 0 1 6 , m u l t i p l i e d t o g e t h e r . O b v i o u s l y 2 0 1 5 n u m b e r s a l l e q u a l t o 2 0 1 6 m u l t i p l i e d t o g e t h e r i s g r e a t e r t h a n 2 0 1 5 n u m b e r s a l l l e s s t h a n 2 0 1 6 m u l t i p l i e d t o g e t h e r T h e r e f o r e : 2 0 1 6 > 2 0 1 5 2 0 1 5 ! B 2 0 1 6 > A 2 0 1 6 B > A 2 0 1 6 2 0 1 6 ! > 2 0 1 5 2 0 1 5 !