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
来源
关键词
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 条
  • [11] Fast Approximate Subgraph Counting and Enumeration
    Slota, George M.
    Madduri, Kamesh
    2013 42ND ANNUAL INTERNATIONAL CONFERENCE ON PARALLEL PROCESSING (ICPP), 2013, : 210 - 219
  • [12] COUNTING CHAMBERS FOR THE ENUMERATION OF TUBERCLE BACILLI
    KROHN, EF
    AMERICAN REVIEW OF TUBERCULOSIS, 1954, 70 (02): : 376 - 377
  • [13] Counting and Enumeration Problems with Bounded Treewidth
    Pichler, Reinhard
    Ruemmele, Stefan
    Woltran, Stefan
    LOGIC FOR PROGRAMMING, ARTIFICIAL INTELLIGENCE, AND REASONING (LPAR-16), 2010, 6355 : 387 - 404
  • [14] Stochastic Enumeration Method for Counting Trees
    Radislav Vaisman
    Dirk P. Kroese
    Methodology and Computing in Applied Probability, 2017, 19 : 31 - 73
  • [15] ALGORITHMS FOR COUNTING AND ENUMERATION IN DECOMPOSABLE GRAPHS
    FERNANDEZBACA, D
    SLUTZKI, G
    PROCEEDINGS OF THE 22ND CONFERENCE ON INFORMATION SCIENCES AND SYSTEMS, VOLS 1 & 2, 1988, : 731 - 735
  • [16] Stochastic Enumeration Method for Counting Trees
    Vaisman, Radislav
    Kroese, Dirk P.
    METHODOLOGY AND COMPUTING IN APPLIED PROBABILITY, 2017, 19 (01) : 31 - 73
  • [17] ENUMERATION OF CERTAIN TYPES OF SEQUENCES
    CARLITZ, L
    MATHEMATISCHE NACHRICHTEN, 1971, 49 (1-6) : 125 - &
  • [18] ENUMERATION OF SEQUENCES BY LEVELS AND RISES
    ABRAMSON, M
    DISCRETE MATHEMATICS, 1975, 12 (02) : 101 - 112
  • [19] THE ENUMERATION OF SHIFT REGISTER SEQUENCES
    BRYANT, PR
    CHRISTENSEN, J
    JOURNAL OF COMBINATORIAL THEORY SERIES A, 1983, 35 (02) : 154 - 172
  • [20] ENUMERATION OF PAIRS OF PERMUTATIONS AND SEQUENCES
    CARLITZ, L
    SCOVILLE, R
    VAUGHAN, T
    BULLETIN OF THE AMERICAN MATHEMATICAL SOCIETY, 1974, 80 (05) : 881 - 884