Let's re-share it!

Two numbers x , y x,y with x > y x>y are chosen at random from the set { 1 , 2 , 3 , . . . . . , 299 , 300 } . \left\{1,2,3,.....,299,300\right\}.

If the probability that x 2 y 2 x^{2} - y^{2} is divisible by 3 is a b , \frac{a}{b}, then what is the digit sum of a × b a \times b ?

Details and Assumptions:

  1. Digit sum refers to the sum of all the digits of the number. For example, the digit sum of 123 is 1 + 2 + 3 = 6. 1+2+3=6.
  2. a a and b b are co-prime numbers.


The answer is 30.

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.

2 solutions

Adarsh Kumar
Oct 2, 2014

We know that when a number is divided by 3 3 it can leave remainders: 0 , 1.2 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 ) . Case 1:x\equiv0(mod3),y\equiv0(mod3)\Longrightarrow\\x^{2}\equiv0(mod3),y^{2}\equiv0(mod3). x 2 y 2 0 ( m o d 3 ) \Longrightarrow\ x^{2}-y^{2}\equiv0(mod3) 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 ) Case2:x\equiv1(mod3),y\equiv1(mod3)\\\Longrightarrow\ x^{2}\equiv1(mod3),y^{2}\equiv1(mod3)\Longrightarrow\ x^{2}-y^{2}\equiv0(mod3) C a s e 3 : x 2 ( m o d 3 ) , y 2 ( m o d 3 Case3:x\equiv2(mod3),y\equiv2(mod3 \ x 2 1 ( m o d 3 ) , y 2 1 ( m o d 3 ) x 2 y 2 0 ( m o d 3 ) . \Longrightarrow x^{2}\equiv1(mod3),y^{2}\equiv1(mod3)\Longrightarrow\ x^{2}-y^{2}\equiv0(mod3). 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 ) Case4:x\equiv1(mod3),y\equiv2(mod3)\Longrightarrow\\\ x^{2}\equiv1(mod3),y^{2}\equiv1(mod3)\\\Longrightarrow\ x^{2}-y^{2}\equiv0(mod3) 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 ( 100 2 ) . \dbinom{100}{2}. 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 ) \equiv1(mod3) and one number from the group of numbers that are 2 ( m o d 3 ) \equiv2(mod3) .This can be done in ( 100 1 ) ( 100 1 ) \dbinom{100}{1}*\dbinom{100}{1} .The total number of ways is ( 300 2 ) . \dbinom{300}{2}. Just calculate and you get the answer.

Please reply to me about the problem of this question.

Lemma: If 3 x , y 3 \nmid x,y , then 3 x 2 y 2 3 \mid x^{2} - y^{2} .

Proof: Let x = 3 k ± 1 , y = 3 m 1 , k , m Z x = 3k \pm 1, y = 3m \mp 1, \forall k,m \in \mathbb{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 ) \therefore x^{2}-y^{2} = (x-y)(x+y) = (3k\pm 1 + 3p\mp 1)(3k\pm 1 - (3p\mp 1)) = 3(k+m)(3k+3p\pm 2) such that ( k + m ) ( 3 k + 3 p ± 2 ) Z (k+m)(3k+3p\pm 2) \in \mathbb{Z} .

Therefore, 3 x , y 3 \nmid x,y \rightarrow 3 x 2 y 2 3 \mid x^{2} - y^{2} .

Case1: 3 x , y 3 \mid x,y

  • Choose 2 2 from 100 100 for x , y x,y , ( 100 2 ) \dbinom{100}{2}

Because it's stated that x > y x > y , choosing 2 2 of them doesn't require permutations because one of them is obviously less than the other.

Case2: 3 x , y 3 \nmid x,y from lemma

  • Choose 2 2 from 200 200 for x , y x,y , ( 200 2 ) \dbinom{200}{2}

Total number of ways = ( 100 2 ) + ( 200 2 ) = \dbinom{100}{2} + \dbinom{200}{2} .

Sample spaces

  • Choose 2 2 from 300 300 for x , y x,y , ( 300 2 ) \dbinom{300}{2}

Possible outcomes = ( 300 2 ) = \dbinom{300}{2}

Therefore, probability = ( 100 2 ) + ( 200 2 ) ( 300 2 ) = 497 897 \displaystyle = \frac{\dbinom{100}{2} + \dbinom{200}{2}}{\dbinom{300}{2}} = \frac{497}{897} . ~~~

Alternative solution

x , y x,y can't have different divisibility by 3 3 . Proven by lemma.

WLOG that 3 x , 3 y 3 \mid x, 3 \nmid y

  • There're 200 200 choices for y y , 200 200 .
  • There're 100 100 choices for x x , 100 100 .
  • x , y x,y can switch places, 2 ! 2!
  • x > y x > y , number of ways are halved (divide by 2 2 )

Number of ways doesn't satisfy statement = 200 × 100 × 2 ! × 1 2 = 40000 = \displaystyle 200\times 100\times 2!\times \frac{1}{2} = 40000 .

The rest follows and the answer is still 1 40000 ( 300 2 ) = 497 897 \displaystyle 1 - \frac{40000}{\dbinom{300}{2}} = \frac{497}{897} .

Samuraiwarm Tsunayoshi - 6 years, 8 months ago

What was the problem from the question? I saw lots of people reporting it, yet I still have no idea what's wrong.

Samuraiwarm Tsunayoshi - 6 years, 8 months ago

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...