text: clocking question? there are n children seated in a circle on the floor. the teacher walks behind the children in a clockwise direction with a box of candies. starting from a given child, she drops a candy behind this child. she then skips one child and drops a candy behind the next child. now, she skips two children and drops a candy behind the next child. she continues in this way, at each stage skipping one child more than at the preceding stage before dropping a candy behind the next child.  (a) for n = 4,5,6,7,8 determine which children will have been given candies and the corresponding number of candies given at the 9th stage.  (b) for those values of n in (a) above, which children do you think will never receive any candy? prove it mathematically.  can anyone pls help? thanks! thge kids that gets a candy are caractreised by the following :  1,3,6,10,15 etc ( cn+1 = cn + n) where c a child n the childs index.  because sghe can walk multiple tours you have to take the modulo n to get the proper child's index.  so for 4 kids : 1,3,2,2,3,1...