query: Infinite number of apples in a box
positive_passages.docid: 87968
positive_passages.text: A strange puzzle having two possible solutions
negative_passages.docid: 4747
negative_passages.text: arrangement of $n$ oranges and $n$ apples around a circle
negative_passages.docid: 73671
negative_passages.text: Solving TISE for particle in the box for Infinite square well
negative_passages.docid: 38380
negative_passages.text: An infinite Penney's game.
negative_passages.docid: 148776
negative_passages.text: A different approach in distributing $8$ distinct balls into $6$ distinct boxes
negative_passages.docid: 141978
negative_passages.text: How to find the infinite sum
negative_passages.docid: 46420
negative_passages.text: Infinite Atwood's machine
negative_passages.docid: 24924
negative_passages.text: Computing an infinite product
negative_passages.docid: 56509
negative_passages.text: What is the correct way to think about this yet another balls/boxes problem?
negative_passages.docid: 132921
negative_passages.text: Counting problem, number of moves
negative_passages.docid: 54525
negative_passages.text: Why is scanf() causing infinite loop in this code?
negative_passages.docid: 147920
negative_passages.text: Infinite powering by $i$
negative_passages.docid: 67343
negative_passages.text: How to count total items on the ground
negative_passages.docid: 103252
negative_passages.text: Ways to put numbered balls in boxes no box being empty
negative_passages.docid: 158381
negative_passages.text: Distinct balls into distinct boxes
negative_passages.docid: 97062
negative_passages.text: Integers as the only valid inputs
negative_passages.docid: 78404
negative_passages.text: How to avoid infinite recursion with super()?