document.write( "Question 1205092: #1.
\n" ); document.write( "Prove for all integers n, k, and r with n ≥ k ≥ r that nCk×kCr = nCr×(n-r)C(k-r)\r
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "#2.
\n" ); document.write( "The binomial theorem states that for any real numbers a and b,
\n" ); document.write( "(a + b)n =∑_(k=0)^n▒〖(n¦k) a^(n-k) b^k 〗 for any integer n ≥ 0.
\n" ); document.write( "Use this theorem to show that for any integer n ≥ 0, ∑_(k=0)^n▒〖〖(-1)〗^k (n¦k) 3^(n-k) 2^k 〗 = 1.\r
\n" ); document.write( "
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "
\n" ); document.write( "

Algebra.Com's Answer #841735 by math_tutor2020(3817)\"\" \"About 
You can put this solution on YOUR website!

\n" ); document.write( "Tutor mccravyedwin has covered problem 1.
\n" ); document.write( "I'll take a look at problem 2.\r
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "\"%28a%2Bb%29%5En+=+sum%28nCk%2Aa%5E%28n-k%29%2Ab%5Ek%2Ck=0%2Cn%29\" The binomial theorem where n is an integer and \"n+%3E=+0\"\r
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "\"%283%2B%28-2%29%29%5En+=+sum%28nCk%2A3%5E%28n-k%29%2A%28-2%29%5Ek%2Ck=0%2Cn%29\" Plug in a = 3 and b = -2\r
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "\"%283-2%29%5En+=+sum%28nCk%2A3%5E%28n-k%29%2A%28-1%2A2%29%5Ek%2Ck=0%2Cn%29\"\r
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "\"%281%29%5En+=+sum%28nCk%2A3%5E%28n-k%29%2A%28-1%29%5Ek%2A2%5Ek%2Ck=0%2Cn%29\"\r
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "\"1+=+sum%28%28-1%29%5Ek%2AnCk%2A3%5E%28n-k%29%2A2%5Ek%2Ck=0%2Cn%29\"\r
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "\"sum%28%28-1%29%5Ek%2AnCk%2A3%5E%28n-k%29%2A2%5Ek%2Ck=0%2Cn%29+=+1\" where \"n+%3E=+0\"\r
\n" ); document.write( "
\n" ); document.write( "
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "The nCk refers to the combination formula
\n" ); document.write( "\"nCk+=+%28n%21%29%2F%28k%21%2A%28n-k%29%21%29\"
\n" ); document.write( "The nCk values are found in Pascal's Triangle.
\n" ); document.write( "The nCk replaces the notation (n¦k) which is often written as \"%28matrix%282%2C1%2Cn%2Ck%29%29\"
\n" ); document.write( "
\n" ); document.write( "
\n" );