Two numbers x and y are chosen at random without replacement from the first 3 0 natural numbers. the probability that x 2 − y 2 is divisible by 3 is given by b a . where a and b are co-prime to each other. Then a + b is equal to
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.
Superb solution.
We know that x 2 ≡ 1 , 0 m o d 3 . Hence the possibilities for x 2 − y 2 not to be divisible by 3 are just x ≡ 0 m o d 3 ∧ y ≡ 0 m o d 3 and the other way round, therefore 2 0 ∗ 1 0 + 1 0 ∗ 2 0 ordinate couples. All of the ordinate couples are 3 0 ∗ 2 9 . So , 1 − 3 0 ∗ 2 9 2 0 ∗ 1 0 + 1 0 ∗ 2 0 = 8 7 4 7 gives us the probability , and 4 7 + 8 7 = 1 3 4 the result.
In this case you are assuming that each possible pair has equal number of choices, which is incorrect.
(3n,3n), (3n+1,3n+1) and (3n+2,3n+2) has 45 possibilities for (x,y) since we are choosing 2 numbers out of 10.
(3n,3n+1), (3n,3n+2) and (3n+1,3n+2) each has 100 possibilities since we are looking at 10 numbers in each form.
The 6 pairs have a total of 435 possibilities, which is consistent with the value we get when we choose 2 numbers out of 30.
The pairs divisible by 3 are the ones which you have correctly picked out, which gives you a total of (100+45x3)/435 = 235/435 = 47/87
Log in to reply
I reckon neither mine nor yours are incorrect , we just follow different paths. Indeed I specified I was picking ordinate couples , the total of which is definitely 30*29 . What you found is , on the other hand , the total of non-ordinate couples which is fine if you stay coherent with what you have done before : so did I , and therefore the number was , for ordinate couples (x,y), 20(when x =/= 0 mod 3) * 10(y = 0 mod 3) + 10(when x = 0 mod 3) * 20 ( when y =/= 0 mod 3).
Log in to reply
Your solution is correct. Song Kai Tan is assuming that x 2 − y 2 and y 2 − x 2 are the same and shouldn't be counted twice, however (x,y) and (y,x) are two different possibilities.
i.e. " (3n,3n), (3n+1,3n+1) and (3n+2,3n+2) has 90 possibilities for (x,y) since we are choosing 2 numbers out of 10. "
or
" (3n,3n+1), (3n,3n+2) and (3n+1,3n+2) each has 200 possibilities since we are looking at 10 numbers in each form.. "
Log in to reply
@Pouya Hamadanian – Ok thanks for pointing that out, it was an oversight on my part. I suppose the question should have been phrased in a way to assume that x> y or y> x, so that there is no ambiguity over the sign of x^2-y^2
I get your solution,but whats wrong with this approach. There are 10 nos. each of the form 3n,3n+1 and 3n+2. x^2-y^2=(x+y)(x-y) We can have the pair of nos, in the following ways, (3n,3n) (3n,3n+1) (3n,3n+2) (3n+1,3n+1) (3n+1,3n+2) (3n+2,3n+2). Of these pairs ,(3n,3n) (3n+1,3n+1) (3n+1,3n+2) (3n+2,3n+2), are divisible by 3. So, should'nt we have direct ans as 4/6 or 2/3??? Am i missing any cases??
We can see that all number squares are of the form 3k+1 or 3k for some integer k. So both nos x&y should either be both divisible my 3 in which case their squares will be of the form 3m &3n and thus their difference is divisible by 3 Or the 2 nos may both be not divisible by 3 in which case their squares are 3m+1 & 3n+1 form their difference again being divisible by 3 So x&y can be chosen in (10 choose 2)+ (20 choose 2) ways out of total possible 30 choose 2 ways thus answer is 47/87 i.e 47 + 87 = 134
I get your solution,but whats wrong with this approach. There are 10 nos. each of the form 3n,3n+1 and 3n+2.
x^2-y^2=(x+y)(x-y)
We can have the pair of nos, in the following ways, (3n,3n) (3n,3n+1) (3n,3n+2) (3n+1,3n+1) (3n+1,3n+2) (3n+2,3n+2).
Of these,(3n,3n) (3n+1,3n+1) (3n+1,3n+2) (3n+2,3n+2), are divisible by 3.
So, should'nt we have direct ans as 4/6 or 2/3??? Am i missing any cases??
Log in to reply
The no of pairs following each case is not equal for eg. There are 45 unordered x,y of the form(3m,3n) but 100 of the form (3m,3n+1). Thus you cant take the no of favoured outcomes as 4 since it is actually sum of total pairs following each case . Let me know if you get it now or ill explain in further length
For any x , we have x 2 ≡ 0 ( m o d 3 ) or x 2 ≡ 1 ( m o d 3 ) . Hence x 2 − y 2 is divisible by 3 if and only if both x , y are divisble by 3 or both x , y are not divisble by 3 .
There are 1 0 numbers less than 3 0 divisible by 3 , so there are ( 2 1 0 ) options to choose two of those.
There are 2 0 numbers less than 3 0 not divisible by 3 , so there are ( 2 2 0 ) options to choose two of those.
There are total of ( 2 3 0 ) options to choose a pair, so the probability we seek is: ( 2 3 0 ) ( 2 1 0 ) + ( 2 2 0 ) = 4 3 5 2 3 5 = 8 7 4 7 = b a So a + b = 4 7 + 8 7 = 1 3 4
Look for number: x ≡ 0 ( m o d 3 ) x ≡ 1 ( m o d 3 ) x ≡ 2 ( m o d 3 )
Case I: If we choice number remainder 2 as first number, there is two subcase, first subcase pair remainder of ( x y ) are ( 2 , 2 . Second subcase pair remainder of x , y ) are 2 , 1
probability x 2 − y 2 ≡ ( m o d 3 ) is 3 0 1 0 × 2 9 9 + 3 0 1 0 × 2 9 1 0 = 8 7 1 9
case II If we choice first number is 1 ≡ ( m o d 3 ) It's same case I, because case I and case II symetric relation so probability is
(\displaystyle \frac{9}{29}+\frac{10}{30} \times \frac{10}{29}=\frac{19}{87})
Case III
If first number x ≡ 0 ( m o d 3 )
Probability for this case is 3 0 1 0 2 9 9 = 2 9 9
Now, Probability x 2 − y 2 divisible by 3 is:
P ( A ) = 2 × 8 7 1 9 + 8 7 9 = 8 7 4 7
So, a + b = 4 7 + 8 7 = 1 3 4 as desired.
Problem Loading...
Note Loading...
Set Loading...
Notice 0 2 ≡ 0 ( m o d 3 ) and 1 2 , 2 2 ≡ 1 ( m o d 3 ) . We must have x 2 ≡ y 2 ( m o d 3 ) .
If x 2 ≡ y 2 ≡ 0 ( m o d 3 ) , there are ( 2 1 0 ) ways to select x , y from the 3 3 0 multiples of three.
If x 2 ≡ y 2 ≡ 1 ( m o d 3 ) , there are ( 2 2 0 ) ways to select x , y from the 3 0 − 1 0 = 2 0 non-multiples of three.
Our answer is ( 2 3 0 ) ( 2 1 0 ) + ( 2 2 0 ) = 4 3 5 4 5 + 1 9 0 = 8 7 4 7 ⟹ 1 3 4 .
For more help with Modular Arithmetic, see here