#How do you do this?

18 messages · Page 1 of 1 (latest)

real basinBOT
thin flint
#

Let $S=({x:x=[1,20], x\in integers})$

gleaming sandBOT
#

becoming

thin flint
#

whereby the parentheses denote that S is not subject to a partial order

#

given that the definition of S is vague

#

let A and B be the set of cards drawn by Elgin and Yunzhi respectively

#

Let R be the relation < on S to denote the condition "starting with the player with the card numbered 1, the players take turns placing down the card from their hand that is greater than the card previously placed"

#

let $R = (A\times{B} : a,b\in{S})$ (I hope I typed that correctly)

gleaming sandBOT
#

becoming

thin flint
#

for all instances

#

Elgin was the first person to begin placing the cards

#

therefore in every instance he should have the card "1"

#

the cardinality of A and B can now be "restricted" to 3 and 2 respectively

thin flint
#

that's not the number of ways

#

it's just a part of the answer

thin flint
#

oh?

#

what was your answer

quick obsidian
#

.close