Let denote the event that a 6-digit integer formed by 0, 1, 2, 3, 4, 5, 6 without repetitions, be divisible by 3. Then probability of event is equal to:
We need to form a 6-digit integer using digits from without repetition, and the number must be divisible by 3.
The total sum of all 7 digits is . To form a 6-digit number, we exclude one digit. For the number to be divisible by 3, the sum of the 6 chosen digits must be divisible by 3. Since is divisible by 3, the excluded digit must also be divisible by 3. The digits divisible by 3 from the set are .
The total number of valid 6-digit integers (no repetition, first digit non-zero) from 7 digits: we exclude one digit out of 7. If 0 is excluded, the remaining digits are , giving six-digit numbers. If a non-zero digit is excluded, the remaining 6 digits include 0, giving valid six-digit numbers (subtracting those starting with 0). Total = .
Now we count favorable cases where we exclude a digit divisible by 3. Case 1: Exclude 0. Remaining digits , sum = 21, divisible by 3. Number of 6-digit numbers = . Case 2: Exclude 3. Remaining , sum = 18, divisible by 3. Number of valid 6-digit numbers = . Case 3: Exclude 6. Remaining , sum = 15, divisible by 3. Number of valid 6-digit numbers = .
Total favorable = .
Probability = .
The answer is , which corresponds to Option (2).
Tagged Classical probability and sample spaces. Machine-assigned, so read it as a strong shortlist rather than a verdict.