= y 1 + 2 1 + 3 x + 4 y + 9 1 + 8 1 + 2 7 x + 1 6 y + 8 1 1 + 3 2 1 + 2 4 3 x + … + …
Find the smallest positive integer x , such that there exists an integer y which satisfies the above equation.
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.
Look at Amit's solution. We can get 3 2 f ( x ) − 9 x = 1 1 ; [1] . We are looking for integers solutions for [1] , so [1] is a diophantine equation which solutions are ( f ( x ) = 2 2 + 9 ⋅ λ , x = 7 7 + 3 2 ⋅ λ ) with λ ∈ Z , therefore the minimum value for x to be a natural number is got for λ = − 2 ⇒ x = 1 3
How did this get changed to number theory from algebra??
Probably the staff or some moderator changed it. This problem does seem to belong in Number Theory instead of Algebra.
Log in to reply
Why so? When I created this problem, I intended it to be solved through mainly algebraic methods (as shown by Amit's solution above).
Is it the fact that I asked for the "smallest natural integer" x ?
Log in to reply
Yup! Because of that, the final answer is the smallest positive solution to the congruence 9 z ≡ − 1 1 ( m o d 3 2 ) which is usually solved by finding the modular inverse of 9 modulo 3 2 , although it can be solved using just basic modular arithmetic manipulations.
9 z ≡ − 1 1 ⟹ 6 3 z ≡ − 7 7 ⟹ − z ≡ − 7 7 ⟹ z ≡ 7 7 ≡ 1 3 ( m o d 3 2 )
This problem is actually a mix of algebra and number theory but I think it's more suited in Number Theory than in the Algebra section.
Problem Loading...
Note Loading...
Set Loading...
By rearranging the terms in LHS,
= = = f ( x ) + 2 1 + 4 f ( x ) + 8 1 + 1 6 f ( x ) + 3 2 1 ⋯ f ( x ) ( 1 + 4 1 + 1 6 1 + 6 4 1 + ⋯ ) + ( 2 1 + 8 1 + 3 2 1 + ⋯ ) , infinite geometric progression sum f ( x ) ( 1 − 1 / 4 1 ) + 1 − 1 / 4 1 / 2 3 4 f ( x ) + 3 2
Similarly, by rearranging the terms in RHS,
= = = 1 + 3 x + 9 1 + 2 7 x + 8 1 1 + 2 4 3 x … ( 1 + 9 1 + 8 1 1 + ⋯ ) + x ( 3 1 + 2 7 1 + 2 4 3 1 + ⋯ ) 1 − 1 / 9 1 + x ⋅ 1 − 1 / 9 1 / 3 8 9 + 8 3 x
Equating these two expressions:
3 4 f ( x ) + 3 2 8 ( 4 f ( x ) + 2 ) 3 2 f ( x ) + 1 6 9 x = = = = 8 9 + 8 3 x 3 ( 9 + 3 x ) 2 7 + 9 x − 1 1 + 3 2 f ( x ) .
And we want to find the smallest value of x such that 9 x + 1 1 is divisible by 32.
With modulo 32, we have 9 z ≡ − 1 1 ⇒ 6 3 z ≡ − 7 7 ⇒ − z ≡ − 7 7 ⇒ z ≡ 7 7 ≡ 1 3 ( m o d 3 2 ) .
And thus the answer is 1 3 .