00:01
In this problem, it is said that m is a positive integer and an is equal to m raised to the power of n divided by n factorial.
00:10
We need to show that an decreases for n greater than or equal to m.
00:14
So let's consider an plus 1.
00:17
This is the next term in the sequence.
00:19
We replace n by n plus 1 over here to obtain m raised to the power of n plus 1 divided by n plus 1 factorial.
00:26
Now, let's consider a n plus 1 divided by a n.
00:32
So what is a n plus 1? this is m raised to the power of n plus 1 divided by n plus 1 factorial, and a n is m raised to the power of n divided by n factorial.
00:45
So we can write this as m raised to the power of n plus 1 divided by m raised to the power power of n times n factorial divided by n plus 1 factorial.
00:58
So m raised to the power of n plus 1 can be written as m raised to the power of n times m raised to the power of 1...