Out of 3 n consecutive integers three are selected at random the probability that there sum is divisible by 3 is (a) \(\left[\left(3 n^{2}-n-2\right) /\\{(3 n-1)(3 n-2)\\}\right]\) (b) \(\left[\left(n^{2}-3 n+2\right) /\\{(3 n-1)(3 n-2)\\}\right]\) (c) \(\left[\left(3 n^{2}-3 n+2\right) /\\{(3 n-2)(3 n-3)\\}\right]\) (d) \(\left[\left(3 n^{2}-3 n+2\right) /\\{(3 n-1)(3 n-2)\\}\right]\)

Short Answer

Expert verified
The short answer is: \(\frac{3n^{2}-3n+2}{(3n-1)(3n-2)}\).

Step by step solution

01

Examining divisibility by 3

The sum of three integers is divisible by 3 if and only if their remainders when divided by 3 add up to a multiple of 3. Let's see how this can happen: 1. All three integers have a remainder of 0. 2. Two integers have a remainder of 1, and one integer has a remainder of 2. 3. Two integers have a remainder of 2, and one integer has a remainder of 1.
02

Count the number of each type of integer

Out of 3n consecutive integers, there will be n integers with each type of remainder (0, 1, and 2). So, we have n numbers divisible by 3, n numbers with a remainder of 1 when divided by 3, and n numbers with a remainder of 2 when divided by 3.
03

Calculate the number of favorable combinations

Now we will count the number of combinations for each case mentioned in Step 1: 1. All three integers have a remainder of 0. There are \(\dbinom{n}{3}\) ways to pick 3 numbers from n numbers with a remainder of 0. 2. Two integers have a remainder of 1, and one integer has a remainder of 2. There are \(\dbinom{n}{2} \times \dbinom{n}{1}\) ways to do this. 3. Two integers have a remainder of 2, and one integer has a remainder of 1. There are \(\dbinom{n}{2} \times \dbinom{n}{1}\) ways to do this. So, the total number of favorable combinations is \[\dbinom{n}{3} + 2 \times \dbinom{n}{2} \times \dbinom{n}{1}\].
04

Calculate the total number of combinations

We have 3n integers, and we need to select 3 integers out of those. So the total number of combinations is \[\dbinom{3n}{3}\].
05

Calculate the probability

Now, we will calculate the probability by dividing the number of favorable combinations by the number of possible combinations: \[P=\frac{\dbinom{n}{3} + 2 \times \dbinom{n}{2} \times \dbinom{n}{1}}{\dbinom{3n}{3}}\] After simplification, we get: \[P=\frac{3n^{2}-3n+2}{(3n-1)(3n-2)}\] So, the correct answer is (d) \(\left[\left(3 n^{2}-3 n+2\right) /\\{(3 n-1)(3 n-2)\\}\right]\).

Unlock Step-by-Step Solutions & Ace Your Exams!

  • Full Textbook Solutions

    Get detailed explanations and key concepts

  • Unlimited Al creation

    Al flashcards, explanations, exams and more...

  • Ads-free access

    To over 500 millions flashcards

  • Money-back guarantee

    We refund you if you fail your exam.

Over 30 million students worldwide already upgrade their learning with Vaia!

One App. One Place for Learning.

All the tools & learning materials you need for study success - in one app.

Get started for free

Most popular questions from this chapter

See all solutions

Recommended explanations on English Textbooks

View all explanations

What do you think about this solution?

We value your feedback to improve our textbook solutions.

Study anywhere. Anytime. Across all devices.

Sign-up for free