Polynomial Modulus

{ n 3 7 0 ( m o d n 4 ) n 2 + 3 0 ( m o d n 4 ) \large{\begin{cases} n^3 -7 &\equiv& 0 \pmod {n-4} \\ n^2 + 3 &\equiv& 0 \pmod{n-4} \end{cases} }

Let n n be a positive integer larger than 5, satisfying the polynomial congruence above. What is the value of n n ?


The answer is 23.

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.

2 solutions

Let f ( n ) = n 3 7 f(n) = n^3 - 7 and g ( n ) = n 2 + 3 g(n) = n^2 + 3 .

When we divide these polynomials with n 4 n-4 , the remainder of such polynomial division will equal to f ( 4 ) f(4) and g ( 4 ) g(4) respectively.

Then f ( 4 ) = 4 3 7 = 64 7 = 57 f(4) = 4^3 - 7 = 64 - 7 = 57 and g ( 4 ) = 4 2 + 3 = 19 g(4) = 4^2 + 3 = 19 .

And because of the given congruence, n 4 f ( 4 ) = 57 n-4 | f(4) = 57 and n 4 g ( 4 ) = 19 n-4 | g(4) = 19 .

The only factors that can divide both 57 57 and 19 19 are 1 1 or 19 19 .

However, since n > 5 n > 5 , n 4 = 19 n - 4 = 19 .

Therefore, n = 23 n = \boxed{23} .

Checking the answers for modulus n 4 = 23 4 = 19 n - 4 = 23-4 =19 :

2 3 3 7 = 12160 = 19 × 640 0 ( m o d 19 ) 23^3 - 7 = 12160 = 19\times 640 \equiv 0 \pmod{19}

2 3 2 + 3 = 532 = 19 × 32 0 ( m o d 19 ) 23^2 + 3 = 532 = 19\times 32 \equiv 0 \pmod{19}

How do people upload questions?

Khushi Mehta - 4 years, 6 months ago

Log in to reply

You can use the "publish" link in "community" tab.

Worranat Pakornrat - 4 years, 6 months ago

Put x = n 4 x = n - 4

Then, x > 1 x > 1 and the second congruence becomes ( x + 4 ) 2 + 3 0 ( m o d x ) ( expanding ) 19 0 ( m o d x ) ( x 0 ( m o d x ) ) (x+4)^2 + 3 \equiv 0 \pmod x \\ \left(\text{expanding} \right) \\ \implies 19 \equiv 0 \pmod x \quad(\because x \equiv 0 \pmod x)

It follows that x = 19 n = 23 x = 19 \implies \boxed{n = 23}

Note: The first congruence is satisfied for this value of n n (this can be seen by substitution).

Your solution skipped too many steps. Eg how did the second congruence become 19 0 ( m o d x ) 19\equiv 0 (\mod x) ? Why x x cannot be 1? It satisfies the second and first congruence. It would be better if you can clarify these!

Christopher Boo - 4 years, 6 months ago

Log in to reply

I guess now it's fine.

A Former Brilliant Member - 4 years, 6 months ago

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...