Two numbers x , y with x > y are chosen at random from the set { 1 , 2 , 3 , . . . . . , 2 9 9 , 3 0 0 } .
If the probability that x 2 − y 2 is divisible by 3 is b a , then what is the digit sum of a × b ?
Details and Assumptions:
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.
Please reply to me about the problem of this question.
Lemma: If 3 ∤ x , y , then 3 ∣ x 2 − y 2 .
Proof: Let x = 3 k ± 1 , y = 3 m ∓ 1 , ∀ k , m ∈ Z
∴ x 2 − y 2 = ( x − y ) ( x + y ) = ( 3 k ± 1 + 3 p ∓ 1 ) ( 3 k ± 1 − ( 3 p ∓ 1 ) ) = 3 ( k + m ) ( 3 k + 3 p ± 2 ) such that ( k + m ) ( 3 k + 3 p ± 2 ) ∈ Z .
Therefore, 3 ∤ x , y → 3 ∣ x 2 − y 2 .
Case1: 3 ∣ x , y
Because it's stated that x > y , choosing 2 of them doesn't require permutations because one of them is obviously less than the other.
Case2: 3 ∤ x , y from lemma
Total number of ways = ( 2 1 0 0 ) + ( 2 2 0 0 ) .
Sample spaces
Possible outcomes = ( 2 3 0 0 )
Therefore, probability = ( 2 3 0 0 ) ( 2 1 0 0 ) + ( 2 2 0 0 ) = 8 9 7 4 9 7 . ~~~
Alternative solution
x , y can't have different divisibility by 3 . Proven by lemma.
WLOG that 3 ∣ x , 3 ∤ y
Number of ways doesn't satisfy statement = 2 0 0 × 1 0 0 × 2 ! × 2 1 = 4 0 0 0 0 .
The rest follows and the answer is still 1 − ( 2 3 0 0 ) 4 0 0 0 0 = 8 9 7 4 9 7 .
What was the problem from the question? I saw lots of people reporting it, yet I still have no idea what's wrong.
Problem Loading...
Note Loading...
Set Loading...
We know that when a number is divided by 3 it can leave remainders: 0 , 1 . 2 C a s e 1 : x ≡ 0 ( m o d 3 ) , y ≡ 0 ( m o d 3 ) ⟹ x 2 ≡ 0 ( m o d 3 ) , y 2 ≡ 0 ( m o d 3 ) . ⟹ x 2 − y 2 ≡ 0 ( m o d 3 ) C a s e 2 : x ≡ 1 ( m o d 3 ) , y ≡ 1 ( m o d 3 ) ⟹ x 2 ≡ 1 ( m o d 3 ) , y 2 ≡ 1 ( m o d 3 ) ⟹ x 2 − y 2 ≡ 0 ( m o d 3 ) C a s e 3 : x ≡ 2 ( m o d 3 ) , y ≡ 2 ( m o d 3 \ ⟹ x 2 ≡ 1 ( m o d 3 ) , y 2 ≡ 1 ( m o d 3 ) ⟹ x 2 − y 2 ≡ 0 ( m o d 3 ) . Things were pretty straightforward till now,the next case is a little different. C a s e 4 : x ≡ 1 ( m o d 3 ) , y ≡ 2 ( m o d 3 ) ⟹ x 2 ≡ 1 ( m o d 3 ) , y 2 ≡ 1 ( m o d 3 ) ⟹ x 2 − y 2 ≡ 0 ( m o d 3 ) Number of ways of case1:since there are a 100 numbers which are divisible by 3 in the range 1 to 300.Selecting two numbers can be done by ( 2 1 0 0 ) . The same thing is done for cases 2 and 3.Now,in case 4 we have to choose one number from the group of numbers that are ≡ 1 ( m o d 3 ) and one number from the group of numbers that are ≡ 2 ( m o d 3 ) .This can be done in ( 1 1 0 0 ) ∗ ( 1 1 0 0 ) .The total number of ways is ( 2 3 0 0 ) . Just calculate and you get the answer.