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

Proudly Serving Math Community at the Claremont Colleges Since 2007

Copyright © 2011 Claremont Center for the Mathematical Sciences

03/20/2012 - 12:15pm

03/20/2012 - 1:10pm

Speaker:

Wai Yan Pong (California State University Dominguez Hills)

Abstract:

A decomposition of a natural number n of length m is sequence of m consecutive natural numbers whose sum is n. The length spectrum of n is the set of lengths of its decompositions. Two numbers are spectral equivalent if they have the same length spectrum. We show that this equivalence relation is computable and will demonstrate a rather surprising fact about the sizes of the spectral classes. We also talk about how often could one guess a number from its spectrum.

Where:

Millikan 208 (Pomona College)