Hello all(adsbygoogle = window.adsbygoogle || []).push({});

I need help with the problem attached below. I tried proof by induction, but cannot prove it. P(n) is a polynomial of degree 2n-2. I have to establish the recurrence relation.

Any help is greatly appreciated!

Thanks

**Physics Forums - The Fusion of Science and Community**

Join Physics Forums Today!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# Hard Problem concerning logarithms

Loading...

Similar Threads - Hard Problem concerning | Date |
---|---|

Very hard modelling and problem solving Calculus Question! | Mar 7, 2013 |

Hard problem(integration) | Oct 16, 2010 |

Really hard intergration problem\ take a look | May 10, 2009 |

Hard Problem | Dec 20, 2007 |

Hard problem | Oct 8, 2006 |

**Physics Forums - The Fusion of Science and Community**