What is the least positive integer n such that n^2 - n is divisible by some but not all integer values of k when 1=< k =< n?
1
k=1, and n=1
\[1=<(k=1)=<(n=1)\] and if n is squared, \[n^2=1^2=1\]
@TheJoker but 1^2-1 = 0
where did the subtraction come from?
"What is the least positive integer n such that n^2 - n " @TheJoker
oops... didn't see the -n :P
then n can equal 2
and so can k if you want
@TheJoker it said the answer was 5: Note that $n^2-n=n(n-1)$ is divisible by $1$, $n-1$, and $n$. Since we want $n^2-n$ to be divisible by some but not all integer values of $k$ when $1\le k\le n$, we must have $n-1>2$ so $n>3$. If $n=4$, $n$ is divisible by 2, so $n^2-n$ is divisible by all integer values of $k$ when $1\le k\le n$. Therefore, the least $n$ is $n=\boxed{5}$.
then why did you ask here then? lol
@TheJoker No its Alcumus on AoPs... its if u get the answer wrong then itll give the solution once ur wrong... it lowered my score lol
ok
Join our real-time social learning platform and learn together with your friends!