Counting Candy Sequences An Enumeration Problem

被引：0
|
作者：
Sarkar, Jyotirmoy [1 ]
机构：
[1] Indiana Univ Purdue Univ Indianapolis, Math Sci, 402 North Blackford St, Indianapolis, IN 46202 USA
来源：
RESONANCE-JOURNAL OF SCIENCE EDUCATION | 2023年 / 28卷 / 05期
关键词：
Recursive relation; paths on a graph; Delannoy numbers; inner product; mathematical induction;
D O I：
10.1007/s12045-023-1601-9
中图分类号：
G40 [教育学];
学科分类号：
040101 ; 120403 ;
摘要：
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?
引用
收藏
页码：719 / 735
页数：17
相关论文
共 50 条
12345