Bob rolls a fair six-sided die each morning. if bob rolls a composite number, he eats sweetened cereal. if he rolls a prime number, he eats unsweetened cereal. if he rolls a 1, then he rolls again. in a non-leap year, what is the expected number of times bob will roll his die?

(n^3 - n)

= n(n-1)(n+1)

since it is divisible by 3 and 2 ,because it is a multiple 3 consecutive number

if, n-1 is odd then n+1 is also odd, then it is a multiple of 9

but if, n-1 is even then n+1 is also even, then it is a multiple of 4

so, largest multiple = max(9*2, 4*3) = max(18, 12) = 18

13. jbhgfsfyfvhvbjko

i believe b is the answer