You are not logged in.
Pages: 1
1) Find all integers for which is an integer.
For this problem, you can divide using synthetic division and get (n+2) with a remainder of 3. You can write
Find the remainder when is divided by .
And I have no idea how to do this problem...
Offline
Hi;
In mathematics, you don't understand things. You just get used to them.
If it ain't broke, fix it until it is.
Always satisfy the Prime Directive of getting the right answer above all else.
Offline
How did you get that?
Offline
Hi EVW:
In mathematics, you don't understand things. You just get used to them.
If it ain't broke, fix it until it is.
Always satisfy the Prime Directive of getting the right answer above all else.
Offline
Eric said he got it 2 minutes faster than you did. He said that you'll put it in the brittle thread.
Offline
Hi;
In mathematics, you don't understand things. You just get used to them.
If it ain't broke, fix it until it is.
Always satisfy the Prime Directive of getting the right answer above all else.
Offline
{1}Vasudhaiva Kutumakam.{The whole Universe is a family.}
(2)Yatra naaryasthu poojyanthe Ramanthe tatra Devataha
{Gods rejoice at those places where ladies are respected.}
Offline
Pages: 1