Now imagine other pool-like games where you have a cue ball and x numbered balls. You'd like to be able to rack up the x numbered balls in a triangle, and have all x + 1 balls perfectly fill a square m-by-m tray. For what values of x is this possible;jsessionid=1CC26BC19978865E98A2104A49EAE614? In this problem you'll be given an lower bound a and upper bound b, and asked how many numbers within this range have the above property.