Counting Candy Sequences
| dc.contributor.author | Sarkar, Jyotirmoy | |
| dc.contributor.department | Mathematical Sciences, School of Science | |
| dc.date.accessioned | 2025-01-10T19:01:57Z | |
| dc.date.available | 2025-01-10T19:01:57Z | |
| dc.date.issued | 2023-05 | |
| dc.description.abstract | 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? | |
| dc.eprint.version | Final published version | |
| dc.identifier.citation | Sarkar, J. (2023). Counting Candy Sequences. Resonance, 28(5), 719–735. https://doi.org/10.1007/s12045-023-1601-9 | |
| dc.identifier.uri | https://hdl.handle.net/1805/45239 | |
| dc.language.iso | en | |
| dc.publisher | Springer Nature | |
| dc.relation.isversionof | 10.1007/s12045-023-1601-9 | |
| dc.relation.journal | Resonance | |
| dc.rights | Publisher Policy | |
| dc.source | Publisher | |
| dc.subject | recursive relation | |
| dc.subject | paths on a graph | |
| dc.subject | Delannoy numbers | |
| dc.title | Counting Candy Sequences | |
| dc.type | Article |