3 9 9 3 3 7 = 6 1 6 2 + 1 4 1 2 3 9 9 3 3 7 = 4 6 4 2 + 4 2 9 2 The number 3 9 9 3 3 7 is the product of two prime numbers p × q . Determine these prime numbers without using a calculator.
Submit your answer as the sum p + q .
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.
Beautiful proof man
Using the Euclidean Division Algorithm in the Gaussian integers, we calculate that the highest common factor of 6 1 6 + 1 4 1 i and 4 6 4 + 4 2 9 i is 3 6 + 1 9 i . Since 3 9 9 3 3 7 = ( 6 1 6 + 1 4 1 i ) ( 6 1 6 − 1 4 1 i ) = ( 4 6 4 + 4 2 9 i ) ( 4 6 4 − 4 2 9 i ) we deduce that 3 6 + 1 9 i divides 3 9 9 3 3 7 in the Gaussian integers, and hence 1 6 5 7 = ∣ 3 6 + 1 9 i ∣ 2 divides 3 9 9 3 3 7 2 . Since 1 6 5 7 is prime, this means that 1 6 5 7 divides 3 9 9 3 3 7 .
If we want to avoid dividing 3 9 9 3 3 7 by 1 6 5 7 , we could also note that the highest common factor of 6 1 6 + 1 4 1 i and 4 6 4 − 4 2 9 i is 4 + 1 5 i . Since 2 4 1 = ∣ 4 + 1 5 i ∣ 2 is prime, we deduce as above that it must divide 3 9 9 3 3 7 .
Thus 3 9 9 3 3 7 = 2 4 1 × 1 6 5 7 , so the answer is 1 8 9 8 .
how did you find 3 6 + 1 9 i , the highest common factor!??
Log in to reply
The Euclidean Division Algorithm (for Gaussian integers) says that for any two Gaussian integers a , b , it is possible to find Gaussian integers q , r such that a = q b + r and ∣ r ∣ 2 < ∣ b ∣ 2 .
The key point is that the HCF of a and b is equal to the HCF of b and r . So you now divide b by 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 ( 3 6 + 1 9 i ) is the "smaller" of the two numbers we are left with.
Problem Loading...
Note Loading...
Set Loading...
We write p = u 2 + v 2 and q = x 2 + y 2 . Then p q = ( u x ± v y ) 2 + ( u y ∓ v x ) 2 . Thus, assigning u , v , x , y in such a way that u x ± v y are even and u y ∓ v x are odd, u x + v y = 6 1 6 , u x − v y = 4 6 4 , u y + v x = 4 2 9 , u y − v x = 1 4 1 . It follows that u x = 2 1 ( 6 1 6 + 4 6 4 ) = 5 4 0 v x = 2 1 ( 4 2 9 − 1 4 1 ) = 1 4 4 u y = 2 1 ( 4 2 9 + 1 4 1 ) = 2 8 5 v y = 2 1 ( 6 1 6 − 4 6 4 ) = 7 6 Determine common factors: 5 4 0 1 4 4 3 6 2 8 5 7 6 1 9 1 5 4 Thus we have the prime factors 3 6 2 + 1 9 2 = 1 2 9 6 + 3 6 1 = 1 6 5 7 ; 1 5 2 + 4 2 = 2 2 5 + 1 6 = 2 4 1 . So 3 9 9 3 3 7 = 1 6 5 7 ⋅ 2 4 1 , and the answer to the problem is 1 6 5 7 + 2 4 1 = 1 8 9 8 .