The function 
accepts an ordered pair as input and gives another ordered pair as output. It is defined according to the following rules: If 
, 
. If 
but 
, 
. Otherwise, 
. A robot starts by moving to the point 
. Every time it arrives at a point 
, it applies 
to that point and then moves to . If the robot runs forever, how many different points will it visit? ...Sorry for the long question
+130511 The function accepts an ordered pair as input and gives another ordered pair as output. It is defined according to the following rules: If , . If but , . Otherwise, . A robot starts by moving to the point . Every time it arrives at a point , it applies to that point and then moves to . If the robot runs forever, how many different points will it visit? ...Sorry for the long question
(1,1) → (6, 7) → (2, 7) → (2, 3) → (7, 9) → ( 3, 9) → (3, 5) → (3, 1) → (8, 7) → (4, 7) → (4, 3) → (9, 9) →
(5, 9) → (1, 9) → (1, 5) → (1, 1)
15 points...and the cycle starts over......
+130511 The function accepts an ordered pair as input and gives another ordered pair as output. It is defined according to the following rules: If , . If but , . Otherwise, . A robot starts by moving to the point . Every time it arrives at a point , it applies to that point and then moves to . If the robot runs forever, how many different points will it visit? ...Sorry for the long question
(1,1) → (6, 7) → (2, 7) → (2, 3) → (7, 9) → ( 3, 9) → (3, 5) → (3, 1) → (8, 7) → (4, 7) → (4, 3) → (9, 9) →
(5, 9) → (1, 9) → (1, 5) → (1, 1)
15 points...and the cycle starts over......
