Find the largest integer N for which N − 3 evenly divides N 3 − 3 .
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
You have not mentioned anywhere why you straightaway take 2 4 = N − 3 , in particular the largest value of N is obtained when. Otherwise an error-free solution............
We know that N 3 − 3 3 = N 3 − 2 7 = ( N − 3 ) ( N 2 + 3 N + 3 2 ) .
So N − 3 ∣ N 3 − 2 7 and we are told that N − 3 ∣ N 3 − 3 so, N − 3 divides any liner combination of N 3 − 2 7 and N 3 − 3 , in particular N − 3 ∣ 2 4 .
Now, obviously the largest number that divides 24 is 24 itself, and that means that N = 2 7 .
Note that N − 3 evenly divides ( N − 3 ) ( N 2 + 3 x − 9 ) = N 3 − 2 7 .
Hence, N − 3 must evenly divide ( N 3 − 3 ) − ( N 3 − 2 7 ) = 2 4 .
The largest number that divides 2 4 is 2 4 , so N − 3 is at most 2 4 . Hence, N is at most 2 7 .
If we have N = 2 7 , then N − 3 = 2 7 − 3 = 2 4 and N 3 − 3 = 2 7 3 − 3 = 1 9 6 8 3 − 3 = 1 9 6 8 0 . 2 4 1 9 6 8 0 = 8 2 0 , which is an integer.
Hence, the maximum possible value of N such that N − 3 evenly divides N 3 − 3 is 2 7 .
If N − 3 evenly divides N 3 − 3 , and N is an integer, then
( N − 3 ) ∗ c = N 3 − 3 for some integer c .
If we divide N 3 − 3 by N − 3 using long division, we get
N 2 + 3 N + 9 + N − 3 2 4
Clearly N 2 + 3 N + 9 is an integer since N is an integer, and so we only need to worry about N − 3 2 4 being an integer, which is true when 2 4 is divisible by N − 3 . The largest factor of 2 4 is 2 4 , so N − 3 = 2 4 .
Hence N = 2 7
Once we use synthetic division to compute N − 3 N 3 − 3 , we get N 3 + 3 N + 9 + N − 3 2 4
Here we can see that N is maximized when N − 3 2 4 is minimized(for integers) So we let N − 3 2 4 = 1
Thus we get the largest integer N for which N − 3 evenly divides N 3 − 3 as 2 7
Let us say that some k satisfies the conditions. By the Euclidean Algorithm:
( k − 3 ) ( k 2 + 3 k + 9 ) + 2 4 = k 3 − 3
Therefore, if ( k − 3 ) ∣ k 3 − 3 , ( k − 3 ) ∣ 2 4 . The largest divisor of 2 4 is 2 4 . Therefore, our required number is 2 7 .
N 3 - 3 = ( N − 3 ) × ( N 2 + 3 N + 9 ) + 2 4
Clearly when N=27 then RHS divides LHS with highest quotient
We have to find N such that N − 3 N 3 − 3 = k , where k is an integer. Now N − 3 N 3 − 3 = N − 3 N 3 − 2 7 + 2 4 = N − 3 N 3 − 3 3 + 2 4 = N − 3 N 3 − 3 3 + N − 3 2 4 . And N 3 − 3 3 = ( N − 3 ) ( N 2 + 3 N + 9 ) . So the equation reduces to N 2 + 3 N + 9 + N − 3 2 4 is integer if N − 3 2 4 is an integer. So maximum value of N turns out to be 27 because if N ≥ 2 7 the fraction becomes proper and hence is not integer for any value of N
how do you write that kind
Vaishnav, what kind are you referring to? Which part of the solution is not clear to you?
Log in to reply
He may be referring to how you write Latex in general.
Log in to reply
There are some basic commands of Latex using which I write the solutions. It can be viewed here: Formatting guide
N − 3 ∣ N 3 − 3 < = > N 3 − 3 = 0 mod N − 3
< = > N 3 = 3 mod N − 3
Substitute N-3 with M to get: ( M + 3 ) 3 = 3 mod M
<=> M 3 + 9 M 2 + 2 7 M + 2 7 = 3 mod M
<=> 2 7 = 3 mod M
The maximum value of M for which this holds is M = 2 4 , which gives N = 2 7 as solution to the problem.
The problem gives us the problem N^{3}-3/N-3. We can simplify this using synthetic division. [example link] (http://www.purplemath.com/modules/synthdiv.htm)
Through synthetic division we can simplify this even more and we get that the quotient is N^{2}+3N+9+24/N-3. Every part of this expression will give an integer value except for the 24/N-3. For it to be the maximum integer value, we set 24/N-3 = 1 because if it equals less than one it will not be an integer value. We get N=27, which is the answer.
Given an integer n and positive integer d , there exist unique integers q and r such that, n = q ⋅ d + r and 0 ≤ r < d . Where q is the quotient, d is the divisor, and r is the remainder.
So we can think of the problem as ( N 3 − 3 ) = q ⋅ ( N − 3 ) ⇒ ( N − 3 ) ( N 3 − 3 ) = q where q ∈ Z
This means we have to find a value for N such that N − 3 is a factor of N 3 − 3 . However, there is more than one value that satisfies that condition, and what the largest value is, is not clear from the expression.
Our next step is to do some polynomial long division.
\begin{aligned} \renewcommand\arraystretch{2} \begin{array}{r@{\hskip\arraycolsep}c@{\hskip\arraycolsep}l*2r} &\underline{\mspace{20mu}N^2 + 3N + 9} \mspace{30mu} \\ N - 3& \Big )\mspace{10mu} N^3 - 3 \mspace{80mu} \\ & \underline{-(N^3 - 3N^2)} \mspace{50mu} \\ & 3N^2 - 3 \mspace{73mu} \\ & \underline{-(3N^2 - 9N)} \mspace{50mu} \\ & 9N - 3 \mspace{80mu} \\ & \underline{-(9N-27)} \mspace{63mu} \\ & 24 \mspace{70mu} \\ \end{array} \end{aligned} \\ \mbox{}
Now our expression looks like:
N 2 + 3 N + 9 + N − 3 2 4 = q
Let k = N 2 + 3 N + 9 where k ∈ Z
We can do this since integers are closed under multiplication and addition.
Now we have the expression:
k + N − 3 2 4 = q
Both k and q are integers. All that is left is to find the largest integer N that will still produce an integer from N − 3 2 4 .
To reduce a fraction to an integer, the denominator has to be a factor of the numerator. The largest factor of the numerator is 24 . So to solve the problem, we have to find N such that N-3 is equal to 24 .
\mspace 1 m u N − 3 = 2 4 ⇒ ∴ N = 2 7
Problem Loading...
Note Loading...
Set Loading...
FIrst. divide both of them..
N − 3 N 3 − 3
which is equal to
N 2 + 3N + 9 N − 3 2 4
then for the quotient to be an integer, the remainder should be transformed to an integer..
thus, N − 3 2 4 => 24 = N - 3 => N = 27