A JEE advanced problem

Probability of ten digit number formed by using 1 , 2 , 3 , 4 a n d 5 1,2,3,4~and~ 5 so that the difference between any two consecutive digits is unity is equal to

Details and Assumptions

Surely u are allowed to repeat the digits.

Consider the difference of both 1 , a n d 1 1,and~ -1 between the numbers.

Do like and share


The answer is 0.00006635.

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.

3 solutions

Tanishq Varshney
Mar 22, 2015

Its a bit long but I hope that u read it and tell any mistake if any freely.

Firstly total number of outcomes = For every place we have 5 choices of 1 , 2 , 3 , 4 , 5 1,2,3,4,5 = 5 10 5^{10}

Now coming on to number of favorable outcomes.

Let a n + 1 , b n + 1 a n d c n + 1 a_{n+1},b_{n+1}~and ~c_{n+1} denote ( n + 1 ) (n+1) digit number whose ( n + 1 ) t h (n+1)th digit is 1 o r 5 1~or~5 , 2 o r 4 2~or~4 and 3 3 respectively .

plz observe carefully.

c n + 1 = b n c_{n+1}=b_{n} [as with 3 3 only 2 2 or 4 4 can come]

a n + 1 = b n a_{n+1}=b_{n} [as with 1 1 only 2 2 comes and with 5 5 only 4 4 comes]

b n + 1 = 2 c n + a n b_{n+1}=2 c_{n}+a_{n}

[as 3 3 can come with 2 2 and 4 4 but 1 1 can come with only 2 2 and 4 4 can come with 5 5 ]

b n + 1 = 2 b n 1 + b n 1 b_{n+1}=2 b_{n-1}+b_{n-1}

b n + 1 = 3 b n 1 b_{n+1}=3 b_{n-1}

we have to find a 10 + b 10 + c 10 a_{10}+b_{10}+c_{10}

= b 10 + 2 b 9 b_{10}+2 b_{9} [from above relations]

b 9 = 3 b 7 b_{9}=3 b_{7} and b 7 = 3 b 5 b_{7}=3 b_{5} and b 5 = 3 b 3 b_{5}=3 b_{3}

thus b 9 = 3 4 b 1 b_{9}=3^4 b_{1}

as b 1 b_{1} can be 2 o r 4 2~or ~4

b 9 = 2 × 3 4 b_{9}=2\times 3^4

similarly b 10 = 3 4 × b 2 b_{10}=3^4 \times b_{2}

for b 2 b_{2} there are 4 4 choices

2 with 1 or with 3 and 4 with 5 or with 3.

b 10 = 4 × 3 4 b_{10}=4\times 3^4

thus favorable outcomes= b 10 + 2 b 9 = 8 × 3 4 b_{10}+2 b_{9}=8\times 3^4

P r o b a b a i l i t y = N u m b e r o f f a v o r a b l e o u t c o m e s t o t a l n u m b e r o f o u t c o m e s Probabaility =\frac{Number~ of~ favorable~ outcomes}{total~ number~of ~outcomes}

most of u might be wondering how i took c n + 1 = b n c_{n+1}=b_{n} becoz

consider 2345432123 it is of type c 10 c_{10} and leaving the 3 from right we get a number of type b 9 b_{9}

Tanishq Varshney - 6 years, 2 months ago

Log in to reply

@Tanishq Varshney I got the answer afterwards. If we split the ten digits into five consecutive pairs, we can prove that:

  1. The first pair can be chosen in 8 8 ways.

  2. Each subsequent pairs can be chosen in 3 3 ways each. (This is not entirely true, since some pairs have more cases than others, but the total number is equivalent to multiplying by 3 3 )

Hence answer is ( 8 3 4 ) / 5 10 (8*3^4)/5^{10}

Note: Current answer is incorrect. Problem is waiting to be corrected.

Raghav Vaidyanathan - 6 years, 2 months ago

Log in to reply

how was my solution, if any mistake do tell @Raghav Vaidyanathan

Tanishq Varshney - 6 years, 2 months ago

Shouldn't c n + 1 = 2 b n c_{n+1} = 2 b_n , since 3 can come from 2 or 4?
Shouldn't b n + 1 = c n + a n b_{n+1} = c_n + a_n , since 2 can come from 1 or 3?

This solution would be closer to what I think it would ultimately look like. Can you make the corresponding edit?

Calvin Lin Staff - 6 years, 2 months ago

Log in to reply

sir if u could plz change the answer to 6.635E-5

Tanishq Varshney - 6 years, 2 months ago

Log in to reply

Please make the edits throughout your solution first, to determine what the final answer should be.

For example, a 10 + b 10 + c 10 = b 9 + b 10 + 2 b 9 = b 10 + 3 b 9 a_{10} + b_{10} + c_{10} = b_9 + b_{10} + 2b_9 = b_{10} + 3 b_9 .

After you are done, let me know what the answer should be.

Calvin Lin Staff - 6 years, 2 months ago

Log in to reply

@Calvin Lin I'm giving my solution here.

We will first divide the ten digits into five consecutive pairs. The first pair of numbers can be chosen in 8 8 ways. The number of different pairs of form X a Xa for a in ( 1 , 2 , 3 , 4 , 5 ) a \text{ in } (1,2,3,4,5) is given below. Also, the different ways of selecting the numbers for the next consecutive pairs has also been given:

X 1 = 1 ( 21 ) ( 21 ) , ( 23 ) X 2 = 2 ( 12 ) , ( 32 ) ( 12 ) , ( 32 ) , ( 34 ) X 3 = 2 ( 23 ) , ( 43 ) ( 21 ) , ( 23 ) , ( 43 ) , ( 45 ) X 4 = 2 ( 34 ) , ( 54 ) ( 32 ) , ( 34 ) , ( 54 ) X 5 = 1 ( 45 ) ( 43 ) , ( 45 ) X1=1\quad \equiv (21)\rightarrow (21),(23)\\ X2=2\quad \equiv (12),(32)\rightarrow (12),(32),(34)\\ X3=2\quad \equiv (23),(43)\rightarrow (21),(23),(43),(45)\\ X4=2\quad \equiv (34),(54)\rightarrow (32),(34),(54)\\ X5=1\quad \equiv (45)\rightarrow (43),(45)

Now, we have the different ways of selecting the first four numbers. Observe that the number of cases ending with each number has tripled. For example, for one pair, we had 2 2 cases which ended in 3 3 , but once we added another pair, we have 6 6 cases which end in 3 3 . Hence:

X Y Z 1 = 3 , X Y Z 2 = 6 , X Y Z 3 = 6 , X Y Z 4 = 6 , X Y Z 5 = 3 \Rightarrow XYZ1=3,\quad XYZ2=6,\quad XYZ3=6,\quad XYZ4=6,\quad XYZ5=3

We can easily see here that for every pair of numbers added, the number of cases which end in a certain digit is tripled. The first can be chosen in 8 8 ways, adding subsequent pairs will multiply our number by a factor of 3 3 . Hence, the number of favorable cases is 8 3 4 8*3^4 .

@Calvin Lin

Raghav Vaidyanathan - 6 years, 2 months ago

Log in to reply

@Raghav Vaidyanathan would u plz correct ur latex code.

Tanishq Varshney - 6 years, 2 months ago

sir, in this 3212145432 if u take 4 with 3 then the consecutive difference wont be unity.

Tanishq Varshney - 6 years, 2 months ago

i guess my answer 6.635E-5 is correct sir, so kindly plz change the answer

Tanishq Varshney - 6 years, 2 months ago

Log in to reply

Thanks. I have updated the answer accordingly.

Calvin Lin Staff - 6 years, 2 months ago

What's wrong with this logic? (for the number of favourable cases) @Calvin Lin

Choose the first digit in 5 ways. For every choice of k t h kth digit, there exist 2 choices for ( k + 1 ) t h (k+1)th digit. So, number of favorable cases is 5 × 2 9 5\times 2^9 .

Deeparaj Bhat - 5 years, 1 month ago

Log in to reply

If the first number is 1, how many choices are there for the 2nd number?

Calvin Lin Staff - 5 years, 1 month ago

Log in to reply

Thanks for pointing out my mistake.

Deeparaj Bhat - 5 years, 1 month ago

Did exactly the same! Nice problem! We can find the general answer -

Number of such n-digit numbers using any 5 consecutive digits = { 5 , if n = 1 ; 14 × 3 ( n 1 ) / 2 , if n is odd 8 × 3 n / 2 1 , if n is even \displaystyle \text{Number of such n-digit numbers using any 5 consecutive digits} = \begin{cases} 5, \text{if} \ n =1 ; \\ 14 \times 3^{(n-1)/2}, \text{if n is odd} \\ 8 \times 3^{n/2 -1}, \text{if n is even} \end{cases}

Kartik Sharma - 4 years, 5 months ago
Adit Mohan
Apr 14, 2015

I've used a path counting approach. the rows represent each digit 1 through 5 and the columns represent the positions 1 through 10.
The number in each box represent he number of ways it is possible to have the corresponding digit at the corresponding position.
the numbers in the first column will all be one and the subsequent numbers can be obtained by adding the numbers in the top and bottom left boxes. hence total ways = 81+162+162+162+81=648.
probability = no of favorable ways/total possibilities=648/5^10=6.635E-5.


Joe Mansley
Jun 4, 2021

Let's count the number of allowed numbers.

Every other digit must be even.

Let a n a_n denote the number of 2n-digit allowable numbers, starting with a 2. The next digits can be either 12 12 , 32 32 or 34 34 .

So a n = 3 a n 1 a_n=3a_{n-1} .

a 1 = 2 a_1=2

So a 5 = 2 3 4 a_5=2 \cdot 3^4

Half of the allowable numbers will start with an even, and half of those will start with a 2. So the number of allowable numbers is 8 3 4 = 648 8 \cdot 3^4=648 .

So the probability is 648 / 5 10 648/5^{10} .

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...