Confirming your payment

Skip to content

Competency-Based Questions (CBQ) · Question 80 of 80

A magician uses a deck of 8 cards.

Question 804 marksHard

A magician uses a deck of 88 cards. The positions in the deck are numbered 11 (top) to 88 (bottom). In a perfect out-shuffle the deck is cut into a top half (positions 11 to 44) and a bottom half (positions 55 to 88), and the two halves are interleaved so that the top card stays on top. Reading from the top, the new deck holds the cards that were in positions

1, 5, 2, 6, 3, 7, 4, 81,\ 5,\ 2,\ 6,\ 3,\ 7,\ 4,\ 8

Class 12 Maths Relation and Functions Question 80

Let A={1,2,3,4,5,6,7,8}A=\{1,2,3,4,5,6,7,8\} and let f:A→Af:A\to A send each position pp to the position f(p)f(p) that the card at pp occupies after one out-shuffle. Write f2=f∘ff^2=f\circ f, f3=f∘f∘ff^3=f\circ f\circ f, f0=IAf^0=I_A, where IAI_A is the identity function on AA.

Attempt any four of the following five sub-questions.

(a) Write ff as a table, and show that ff is a bijection.

(b) Find f2f^2 and show that f3=IAf^3=I_A. Hence write down f−1f^{-1}, and state the least number of out-shuffles that brings the deck back to its original order.

(c) On AA define p R qp\,R\,q if and only if q=fk(p)q=f^k(p) for some k∈{0,1,2}k\in\{0,1,2\}; that is, the card at position pp reaches position qq after 00, 11 or 22 out-shuffles. Show that RR is an equivalence relation, write its equivalence classes, and find the number of ordered pairs in RR.

(d) In a perfect in-shuffle the halves are interleaved with the bottom half first, so the new deck holds the cards from positions 5,1,6,2,7,3,8,45,1,6,2,7,3,8,4. Let g:A→Ag:A\to A be its position function, defined in the same way as ff. Write gg as a table, and find (g∘f)(2)(g\circ f)(2) and (f∘g)(2)(f\circ g)(2). What does the result show?

(e) Find the least n≥1n\ge 1 for which gn=IAg^n=I_A, where gng^n is gg composed with itself nn times.