1 / 18

A Coin Separation Problem and Its Mathematical Solution

This mathematical exploration involves taking 'n' coins and dividing them into two separate piles. The process continues recursively with the remaining coins, multiplying the sizes of the piles formed at each step. This method leads to generating various products, which can then be summed up to derive an overall total. The approach highlights an identity for 'n+1' coins, fostering deeper understanding of combinatorial mathematics as seen in historical works by figures like William Whiston.

grizelda
Télécharger la présentation

A Coin Separation Problem and Its Mathematical Solution

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. 5 Minutes, 3 Problems,0Solutions David Bedford d.bedford@keele.ac.uk

  2. Take n coins and separate them into two piles

  3. Take n coins and separate them into two piles Now multiply their sizes together Do the same with the remaining piles and keep going until all the coins are separated. Add up all the products formed.

  4. Take n coins and separate them into two piles

  5. William Whiston, 1667-1752

  6. An identity for n+1 coins n-k coins k+1 coins

More Related