How many pairs of positive numbers ( x , y ) satisfy 3 x + 2 y = 2 0 1 5 ?
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.
Now I assume that x a n d y are natural numbers. Using odd+even = odd, means that there are solutions (x,y), if and only if , x is odd and satisfies 3 x ≤ 2 0 1 3 ⇒ x ≤ 6 7 1 , ∀ x ∈ N Now all numbers are of the form 2n-1, so we create a simple linear equation for n : 2 n − 1 = 6 7 1 ∴ n = 3 3 6
Don't you think that the assumption must be mentioned in question?
Log in to reply
Yea definitely because otherwise there are infinitely many solutions. The only hint is that the answer has to be finite.
Log in to reply
Thanks. I've updated the problem statement to say "positive integers".
In future, if you spot any errors with a problem, you can “report” it by selecting "report problem" in the “dot dot dot” menu in the lower right corner. This will notify the problem creator who can fix it the issues.
Doing some modulo arithmetic we get:
3 x + 2 y ≡ 2 0 1 5 ( m o d 2 )
x ≡ 1 ( m o d 2 ) ⇒ x = 2 k + 1
Replacing the value found for x we get:
6 k + 3 + 2 y = 2 0 1 5 → 2 y = 2 0 1 2 − 6 k → y = 1 0 0 6 − 3 k →
s i n c e y c a n n o t e q u a l 0 : 3 k < 1 0 0 6
k < ⌊ 3 1 0 0 6 ⌋ → k ≤ 3 3 5 →
0 ≤ k ≤ 3 3 5 → k c a n h a v e 3 3 5 + 1 = 3 3 6 v a l u e s .
Problem Loading...
Note Loading...
Set Loading...
Lets assume that x and y are natural numbers. Then,
2 0 1 5 ≡ 3 x ( m o d 2 ) .Note that every odd 3x would do. The possible values of x are 1,3,5..................................671. Now calculate number of terms to get answer 3 3 6 .