Testwiki:Reference desk/Archives/Mathematics/2008 October 1
Template:Error:not substituted
|- ! colspan="3" align="center" | Mathematics desk |- ! width="20%" align="left" | < September 30 ! width="25%" align="center"|<< Sep | October | Nov >> ! width="20%" align="right" |Current desk > |}
| Welcome to the Wikipedia Mathematics Reference Desk Archives |
|---|
| The page you are currently viewing is a transcluded archive page. While you can leave answers for any questions shown below, please ask new questions on one of the current reference desk pages. |
Contents
October 1
Recurrence
Can someone please explain this to me: I have the Ramsey function . I want to show that . My book says that use a certain binomial coefficient. Can someone help? Thanks--Shahab (talk) 07:44, 1 October 2008 (UTC)
- Oh never mind. Pascal's identity was what I was looking for. The proof was by double induction.--Shahab (talk) 08:11, 1 October 2008 (UTC)
algebra
They gave me this equation to use and I was ookay with it for a while. x = a1 b1 + a2 b2 / a1 + a2 but now they expect me to find b2!
I know I should bring it around so that the one side is x/a1 b1 + a2
But what do I do with a1 + a2? Do I put it so that x + (a1 + a2) or should I do it like x(a1 + a2)? --Jeevies (talk) 15:24, 1 October 2008 (UTC)
- Step by step, apply the same operation to both sides. Adding parentheses and operators as my assumption of what you mean with your equation we have
x = ( ( ( a1 * b1 ) + ( a2 * b2 ) ) / a1 ) + a2.
Thus your first step would transform to the equation
( x - a2 ) = ( ( ( a1 * b1 ) + ( a2 * b2 ) ) / a1 ) + a2 - a2 = ( ( ( a1 * b1 ) + ( a2 * b2 ) ) / a1 ).
Carry on from there. -- SGBailey (talk) 15:39, 1 October 2008 (UTC)