Idioma:

Counting Candy Sequences: An Enumeration Problem

Sarkar, Jyotirmoy

Resonance, 2023-05, Vol.28 (5), p.719-735 [Periódico revisado por pares]

Texto completo disponível

Citações Citado por

Título:
Counting Candy Sequences: An Enumeration Problem
Autor: Sarkar, Jyotirmoy
Assuntos: Education ; General Article ; Humanities and Social Sciences ; multidisciplinary ; Science ; Science Education
É parte de: Resonance, 2023-05, Vol.28 (5), p.719-735
Descrição: A bottle contains 7 Type A and 7 Type B candies. Each morning, 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?
Editor: New Delhi: Springer India
Idioma: Inglês

Voltar para lista de resultados