Lazy caterer’s sequence

This is one of the problems asked by a guest speaker from CMI. The lazy caterer’s sequence, formally known as the central polygonal numbers, describes the maximum number of pieces of a circle can be cut into by straight lines. For example, three cuts across a pancake will produce six pieces if the all the cuts meet at the center, but seven if they do not. This problem can be formalized mathematically as one of counting the cells in an

Continue Reading

Site Footer

Sliding Sidebar

About Me

About Me

Hey, I am Thomas Ashish Cherian. What I cannot create, I do not understand.

Social Profiles