I'm an English major who decided to take a history of math class this semester, since I enjoy studying history. At the end of class today, my professor asked us this:
"Are there infinitely many n so that (2n)!/((n!)((2n-n)!)) is not an integer multiple of 3, 5, or 7?"
I'm rather unfamiliar with factorials, so I thought I'd ask for advice. We're not required to solve this problem--it is, after all, a history course that just has to do with math. Nonetheless, I'd like to see how it's done, or at least some observations on how I could solve it. I'm not entirely sure whether this belongs in Advanced Math, this question coming from a history course rather than a math one, but I decided to play it safe and post it here.
"Are there infinitely many n so that (2n)!/((n!)((2n-n)!)) is not an integer multiple of 3, 5, or 7?"
I'm rather unfamiliar with factorials, so I thought I'd ask for advice. We're not required to solve this problem--it is, after all, a history course that just has to do with math. Nonetheless, I'd like to see how it's done, or at least some observations on how I could solve it. I'm not entirely sure whether this belongs in Advanced Math, this question coming from a history course rather than a math one, but I decided to play it safe and post it here.