Given three automates that deal with the cards with the pairs of natural numbers. The first, having got the card with (a,b), produces new card with (a+1,b+1), the second, having got the card with (a,b), produces new card with (a/2,b/2), if both a and b are even and nothing in the opposite case; the third, having got the pair of cards with (a,b) and (b,c) produces new card with (a,c). All the automates return the initial cards also. Suppose there was (5,19) card initially. Is it possible to obtain a) (1,50)? b) (1,100)? c) Suppose there was (a,b) card initially (a<b). We want to obtain (1,n) card. For what n is it possible? game strategycardscombinatorics