A m n is defined as above, evaluate A 1 5 , 7 .
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 argument, @Chew-Seong Cheong !
This series is just a fancy way of saying A m n = ( n m )
So, A 1 5 , 7 = ( 7 1 5 ) = 6 4 3 5
Problem Loading...
Note Loading...
Set Loading...
We can prove the claim that A m n = ( n m ) is true for all m , n ≥ 0 by induction.
For m = n = 0 , A 0 0 = ( 0 0 ) = 1 as defined in A m 0 ∀ m ≥ 0 . Therefore, the claim is true for m = n = 0 .
For m = 0 and n > 0 , A 0 0 = ( n 0 ) = 0 as defined in A 0 n = 0 for n > 0 . Therefore, the claim is true for m = 0 and n > 0 .
Note that steps 1 and 2 prove that the claim is true for m = 0 for all n ≥ 0 . Now, assuming the claim A m n = ( n m ) is true for m , then:
A m + 1 , n + 1 = A m , n + 1 + A m , n = ( n + 1 m ) + ( n m ) = ( n + 1 m + 1 ) By Pascal’s identity: ( k n ) + ( k − 1 n ) = ( k n + 1 ) t
Therefore, the claim is true for m + 1 and hence true for all m ≥ 0 .
⟹ A 1 5 , 7 = ( 7 1 5 ) = 6 4 3 5