Go Factor!

399 337 = 61 6 2 + 14 1 2 399 337 = 46 4 2 + 42 9 2 \large 399\:337 = 616^2 + 141^2 \\ \large 399\:337 = 464^2 + 429^2 The number 399 337 399\:337 is the product of two prime numbers p × q p\times q . Determine these prime numbers without using a calculator.

Submit your answer as the sum p + q p + q .


The answer is 1898.

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

We write p = u 2 + v 2 p = u^2 + v^2 and q = x 2 + y 2 q = x^2 + y^2 . Then p q = ( u x ± v y ) 2 + ( u y v x ) 2 . pq = (ux \pm vy)^2 + (uy \mp vx)^2. Thus, assigning u , v , x , y u, v, x, y in such a way that u x ± v y ux \pm vy are even and u y v x uy \mp vx are odd, u x + v y = 616 , u x v y = 464 , u y + v x = 429 , u y v x = 141. ux + vy = 616,\ \ ux - vy = 464,\ \ uy + vx = 429,\ \ uy - vx = 141. It follows that u x = 1 2 ( 616 + 464 ) = 540 u y = 1 2 ( 429 + 141 ) = 285 v x = 1 2 ( 429 141 ) = 144 v y = 1 2 ( 616 464 ) = 76 \begin{array}{ll} ux = \tfrac12(616 + 464) = 540 & uy = \tfrac12(429 + 141) = 285 \\ vx = \tfrac12(429 - 141) = 144 & vy = \tfrac12(616 - 464) = 76 \end{array} Determine common factors: 540 285 15 144 76 4 36 19 \begin{array}{cc|l} 540 & 285 & 15 \\ 144 & 76 & 4 \\ \hline 36 & 19 & \end{array} Thus we have the prime factors 3 6 2 + 1 9 2 = 1296 + 361 = 1657 ; 1 5 2 + 4 2 = 225 + 16 = 241. 36^2 + 19^2 = 1296 + 361 = 1657;\ \ \ 15^2 + 4^2 = 225 + 16 = 241. So 399 337 = 1657 241 399\:337 = 1657\cdot 241 , and the answer to the problem is 1657 + 241 = 1898 1657 + 241 = \boxed{1898} .

Beautiful proof man

Adarsh Adi - 3 years, 2 months ago
Mark Hennings
Apr 4, 2016

Using the Euclidean Division Algorithm in the Gaussian integers, we calculate that the highest common factor of 616 + 141 i 616 + 141i and 464 + 429 i 464 + 429i is 36 + 19 i 36 + 19i . Since 399337 = ( 616 + 141 i ) ( 616 141 i ) = ( 464 + 429 i ) ( 464 429 i ) 399337 \; =\; (616 + 141i)(616 - 141i) \; = \; (464 + 429i)(464 - 429i) we deduce that 36 + 19 i 36 + 19i divides 399337 399337 in the Gaussian integers, and hence 1657 = 36 + 19 i 2 1657 = |36 + 19i|^2 divides 39933 7 2 399337^2 . Since 1657 1657 is prime, this means that 1657 1657 divides 399337 399337 .

If we want to avoid dividing 399337 399337 by 1657 1657 , we could also note that the highest common factor of 616 + 141 i 616 + 141i and 464 429 i 464 - 429i is 4 + 15 i 4 + 15i . Since 241 = 4 + 15 i 2 241 = |4 + 15i|^2 is prime, we deduce as above that it must divide 399337 399337 .

Thus 399337 = 241 × 1657 399337 = 241 \times 1657 , so the answer is 1898 \boxed{1898} .

how did you find 36 + 19 i 36 + 19i , the highest common factor!??

Asif Hasan - 5 years, 2 months ago

Log in to reply

The Euclidean Division Algorithm (for Gaussian integers) says that for any two Gaussian integers a , b a,b , it is possible to find Gaussian integers q , r q,r such that a = q b + r a = qb + r and r 2 < b 2 |r|^2 < |b|^2 .

The key point is that the HCF of a a and b b is equal to the HCF of b b and r r . So you now divide b b by r r , obtaining a new quotient and remainder, and therefore another pair of Gaussian integers whose HCF is equal to the HCF you are trying to determine. Since the square of the modulus of the numbers you are working with is getting smaller all the time, this process must stop after a finite number of divisions (if I recall right, about five), and we obtain a pair of numbers, one of which divides the other. The desired HCF ( 36 + 19 i 36+19i ) is the "smaller" of the two numbers we are left with.

Mark Hennings - 5 years, 2 months ago

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...