Difference between revisions of "1963 AHSME Problems/Problem 31"

(i just added another solution.)
Line 13: Line 13:
 
Solving for <math>x</math> in the equation yields <math>x =rfthe meaning of theta 0</math>.  Solving the inequality results in <math>y \le 254 \frac{1}{3}</math>.  From the two conditions, <math>y</math> can be an odd number from <math>1</math> to <math>253</math>, so there are <math>127</math> solutions where <math>x</math> and <math>y</math> are integers.  The answer is <math>\boxed{\textbf{(D)}}</math>.
 
Solving for <math>x</math> in the equation yields <math>x =rfthe meaning of theta 0</math>.  Solving the inequality results in <math>y \le 254 \frac{1}{3}</math>.  From the two conditions, <math>y</math> can be an odd number from <math>1</math> to <math>253</math>, so there are <math>127</math> solutions where <math>x</math> and <math>y</math> are integers.  The answer is <math>\boxed{\textbf{(D)}}</math>.
 
==Solution 2==
 
==Solution 2==
We will prove that <math>y</math> is an odd number by contradiction. If <math>y</math> is even, then we know that <math>y = 2m</math> where <math>m</math> is some integer. However, this immediately assumes that <math>\text{ even } + \text{ even } = \text{ odd }</math> which is impossible. therefore <math>y</math> must ben odd.  
+
We will prove that <math>y</math> is an odd number by contradiction. If <math>y</math> is even, then we know that <math>y = 2m</math> where <math>m</math> is some integer. However, this immediately assumes that <math>\text{ even } + \text{ even } = \text{ odd }</math> which is impossible. therefore <math>y</math> must ben odd. then we can easily prove that <math>x</math> .....
 +
 
 +
==Solution 3==
 +
We can solve the problem as following,
 +
We can apply hit and trial for the first solution <math>x_0</math> = 380 and <math>y_0</math> =1. then the general solution of the given diophanitine equation will be x = <math>x_0</math> +3t and y = <math>y</math> - 2t. we know that we need only positive integer solutions. so 380 + 3t > 0 and 1-2t >0 to get t>0 (applying Greatest integer function) also we can clearly see that <math>t_min</math> = 0 so,t < GIF(383/3). That implies t ranges from 0 to 127. Hence,the correct answer is 127, <math>\boxed{\textbf{(D)}}</math>..
  
then we can easily prove that <math>x</math> .....
 
  
 
==See Also==
 
==See Also==

Revision as of 02:17, 31 December 2023

Problem

The number of solutions in positive integers of $2x+3y=763$ is:

$\textbf{(A)}\ 255 \qquad \textbf{(B)}\ 254\qquad \textbf{(C)}\ 128 \qquad \textbf{(D)}\ 127 \qquad \textbf{(E)}\ 0$

Solution 1

Solving for $x$ in the equation yields $x =rfthe meaning of theta 0$. Solving the inequality results in $y \le 254 \frac{1}{3}$. From the two conditions, $y$ can be an odd number from $1$ to $253$, so there are $127$ solutions where $x$ and $y$ are integers. The answer is $\boxed{\textbf{(D)}}$.

Solution 2

We will prove that $y$ is an odd number by contradiction. If $y$ is even, then we know that $y = 2m$ where $m$ is some integer. However, this immediately assumes that $\text{ even } + \text{ even } = \text{ odd }$ which is impossible. therefore $y$ must ben odd. then we can easily prove that $x$ .....

Solution 3

We can solve the problem as following, We can apply hit and trial for the first solution $x_0$ = 380 and $y_0$ =1. then the general solution of the given diophanitine equation will be x = $x_0$ +3t and y = $y$ - 2t. we know that we need only positive integer solutions. so 380 + 3t > 0 and 1-2t >0 to get t>0 (applying Greatest integer function) also we can clearly see that $t_min$ = 0 so,t < GIF(383/3). That implies t ranges from 0 to 127. Hence,the correct answer is 127, $\boxed{\textbf{(D)}}$..


See Also

1963 AHSC (ProblemsAnswer KeyResources)
Preceded by
Problem 30
Followed by
Problem 32
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40
All AHSME Problems and Solutions

The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions. AMC logo.png