Difference between revisions of "Mock AIME 2 2006-2007 Problems/Problem 2"
m |
|||
| Line 1: | Line 1: | ||
== Problem == | == Problem == | ||
| − | The [[set]] <math> | + | The [[set]] <math>S</math> consists of all [[integer]]s from <math>1</math> to <math>2007</math>, inclusive. For how many [[element]]s <math>n</math> in <math>S</math> is <math>f(n) = \frac{2n^3+n^2-n-2}{n^2-1}</math> an integer? |
==Solution== | ==Solution== | ||
| Line 7: | Line 7: | ||
---- | ---- | ||
| − | *[[Mock AIME 2 2006-2007/Problem 1 | Previous Problem]] | + | *[[Mock AIME 2 2006-2007 Problems/Problem 1 | Previous Problem]] |
| − | *[[Mock AIME 2 2006-2007/Problem 3 | Next Problem]] | + | *[[Mock AIME 2 2006-2007 Problems/Problem 3 | Next Problem]] |
*[[Mock AIME 2 2006-2007]] | *[[Mock AIME 2 2006-2007]] | ||
consists of all 
to 
, inclusive. For how many 
in 
an integer?
. So in fact, there are 0 such elements of 
