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 条
  • [21] ENUMERATION OF PERMUTATIONS AND SEQUENCES WITH RESTRICTIONS
    CARLITZ, L
    SCOVILLE, R
    VAUGHAN, T
    DUKE MATHEMATICAL JOURNAL, 1973, 40 (04) : 723 - 741
  • [22] ENUMERATION OF SEQUENCES OF NONNEGATIVE INTEGERS
    HODEL, MJ
    MATHEMATISCHE NACHRICHTEN, 1974, 59 (1-6) : 235 - 252
  • [23] ENUMERATION OF CERTAIN WEIGHTED SEQUENCES
    CARLITZ, L
    FIBONACCI QUARTERLY, 1978, 16 (03): : 249 - 254
  • [24] MUTUALLY COUNTING SEQUENCES
    KAHAN, S
    FIBONACCI QUARTERLY, 1980, 18 (01): : 47 - 50
  • [25] COUNTING THE GOOD SEQUENCES
    RAWSTHORNE, DA
    FIBONACCI QUARTERLY, 1987, 25 (02): : 161 - 162
  • [26] Enumeration, Counting, and Random Generation of Ladder Lotteries
    Yamanaka, Katsuhisa
    Nakano, Shin-ichi
    IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, 2017, E100D (03): : 444 - 451
  • [27] TREE COUNTING PROBLEMS WITH AN APPLICATION TO MOSAIC ENUMERATION
    GUERIN, E
    VISENTIN, T
    ARS COMBINATORIA, 1986, 21 : 137 - 144
  • [28] Fast compilation of graph substructures for counting and enumeration
    Sugaya T.
    Nishino M.
    Yasuda N.
    Minato S.-I.
    Behaviormetrika, 2018, 45 (2) : 423 - 450
  • [29] CONFIGURATIONAL EFFECTS ON THE ENUMERATION OF DOTS - COUNTING BY GROUPS
    VANOEFFELEN, MP
    VOS, PG
    MEMORY & COGNITION, 1982, 10 (04) : 396 - 404
  • [30] Counting and enumeration complexity with application to multicriteria scheduling
    T'kindt V.
    Bouibede-Hocine K.
    Esswein C.
    4OR, 2005, 3 (1) : 1 - 21