Thread: help would be appreciated, thanks!

as n takes each positive integer value in turn (that is n=1, n=2, n=4 and so on) how many different values are obtained for the remainder when n(squared) is divede by n+4?

a)1 b)8 c)9 d)16 e) infinitely many


help would be appreciated, thanks!

xxx

Originally Posted by mich13

as n takes each positive integer value in turn (that is n=1, n=2, n=4 and so on) how many different values are obtained for the remainder when n(squared) is divede by n+4?

a)1 b)8 c)9 d)16 e) infinitely many


help would be appreciated, thanks!

xxx

So for n being an integer what are the possible remainders for:


Start by looking at n = 1:

so the remainder is 1.

n= 2: so the remainder is 4. (No simplifying the fraction!)

n= 3: so the remainder is 2.

n= 4: so the remainder is 0.

n= 5: so the remainder is 7.

Continue by doing the long division:


Does this help?

-Dan

noo it ddnt help
im 13 i dnt get a WORD of that lol
but thanks anywways.. i appreciate your time xxx

Originally Posted by topsquark

Continue by doing the long division:

Well, you can also do this without long division



Though I don't think you used long division for this

--

mich13, I suggest you appreciate the help, read carefully. Our help it depends of the time.

Originally Posted by mich13

noo it ddnt help
im 13 i dnt get a WORD of that lol
but thanks anywways.. i appreciate your time xxx

I simply considered the cases for n = 1 to n = 5. This is just division. My point is, what is the remainder when n is larger than 12? Try a few of these.

-Dan