Mock AIME 2 2006-2007 Problems/Problem 2: Difference between revisions
Mock AIME II 2007 hasn't ended yet, so the solution should not be posted. |
mNo edit summary |
||
| Line 1: | Line 1: | ||
== Problem == | == Problem == | ||
The set <math>\displaystyle S</math> consists of all integers from <math>\displaystyle 1</math> to <math>\displaystyle 2007,</math> inclusive. For how many elements <math>\displaystyle n</math> in <math>\displaystyle S</math> is <math>\displaystyle f(n) = \frac{2n^3+n^2-n-2}{n^2-1}</math> an integer? | The set <math>\displaystyle S</math> consists of all integers from <math>\displaystyle 1</math> to <math>\displaystyle 2007,</math> inclusive. For how many elements <math>\displaystyle n</math> in <math>\displaystyle S</math> is <math>\displaystyle f(n) = \frac{2n^3+n^2-n-2}{n^2-1}</math> an integer? | ||
==Solution== | |||
{{solution}} | |||
---- | |||
*[[Mock AIME 2 2006-2007/Problem 1 | Previous Problem]] | |||
*[[Mock AIME 2 2006-2007/Problem 3 | Next Problem]] | |||
*[[Mock AIME 2 2006-2007]] | |||
Revision as of 18:46, 22 August 2006
Problem
The set 
consists of all integers from 
to 
inclusive. For how many elements 
in is 
an integer?
Solution
This problem needs a solution. If you have a solution for it, please help us out by adding it.
