• Counting Candy Sequences: An Enumeration Problem

    • Fulltext


        Click here to view fulltext PDF

      Permanent link:

    • Keywords


      Recursive relation, paths on a graph, Delannoy numbers, inner product, mathematical induction.

    • Abstract


      A bottle contains 7 Type A and 7 Type B candies. Each morn­ing, you select two candies at random: If they are of opposite types, eat them both; otherwise, eat one and return the other to the bottle. Continue until all candies are eaten. If ever the bottle contains only one candy, select and eat it. How many distinct candy sequences are possible?

    • Author Affiliations


      Jyotirmoy Sarkar1

      1. Mathematical Sciences Indiana University-Purdue University Indianapolis, 402 North Blackford Street Indianapolis IN 46202 , USA.
    • Dates


© 2023-2024 Indian Academy of Sciences, Bengaluru.