Question No: 347
On top of a rectangular card with sides of length
and
, an identical card is placed so that two of their diagonals line up, as shown (
, in this case).
![[asy] defaultpen(fontsize(12)+0.85); size(150); real h=2.25; pair C=origin,B=(0,h),A=(1,h),D=(1,0),Dp=reflect(A,C)*D,Bp=reflect(A,C)*B; pair L=extension(A,Dp,B,C),R=extension(Bp,C,A,D); draw(L--B--A--Dp--C--Bp--A); draw(C--D--R); draw(L--C^^R--A,dashed+0.6); draw(A--C,black+0.6); dot("$C$",C,2*dir(C-R)); dot("$A$",A,1.5*dir(A-L)); dot("$B$",B,dir(B-R)); [/asy]](https://latex.artofproblemsolving.com/5/5/7/55798e965d22d0047d5702a95bff6b78fb909bf7.png)
Continue the process, adding a third card to the second, and so on, lining up successive diagonals after rotating clockwise. In total, how many cards must be used until a vertex of a new card lands exactly on the vertex labeled
in the figure?