11/01/2016 - 4:00pm

Speaker:

Mark Huber

Abstract:

Recurrsion is a powerful tool in mathematics. In example such as the Fibonacci sequence and Pascal's Triangle, it provides a fast way to compute complext functions. It also plays a key role in random number generation. For instance, suppose that I have a six-sided fair die that I can roll as often as I like, an want to roll a five-sided fair die. Recurrsion is the key to accomplishing this task! I will explain how exactly recurssion helps us solve this random problem and those arrising in real application in my talk.

Where:

CMC Freeberg Forum

__Claremont Graduate University__ | __Claremont McKenna__ | __Harvey Mudd__ | __Pitzer__ | __Pomona__ | __Scripps__

Proudly Serving Math Community at the Claremont Colleges Since 2007

Copyright © 2018 Claremont Center for the Mathematical Sciences