Problem: what is the largest power of 3 contained in 200 !
Rationale: "in real basic terms , we ' re asked to find all of the ' 3 s ' in 200 ! we can figure out that 200 / 3 = 66 , so we know that there are at least 66 ' 3 s ' in 200 ! while that answer is among the 5 choices , it seems a bit too ' easy ' , so let ' s do a bit more work and list out the first few numbers that we know have a ' 3 ' in them : 3 = 3 x 1 6 = 3 x 2 9 = 3 x 3 notice how both 3 and 6 have just one 3 in them , but 9 has two 3 s ( there ' s an ' extra ' 3 that we have to account for ) . this implies that there are probably other numbers that include ' extra 3 s ' that we have to figure out : to find those extra 3 s , we have to look at numbers that contain ' powers of 3 ' . . . 3 ^ 2 = 9 3 ^ 3 = 27 3 ^ 4 = 81 3 ^ 5 = 243 , but that ' s too big ( we ' re only going up to 200 ) . keep in mind that a multiple of 81 is also a multiple of 9 and 27 , so we do n ' t want to count any of those values more than once . 200 / 9 = 22 , so we know that there are at least 22 extra 3 s ( and certainly more because of the 27 and 81 ) . with the 66 3 s that we already have , those 22 extra 3 s increase the total to 88 . with the other extra 3 s , we ' ll end up with more than 88 3 s . there ' s only one answer that fits that logic . . . answer : d"
annotated_formula: multiply(floor(divide(power(const_10, 3), 200)), 200)