Four dice are thrown simultaneously and the numbers shown on these dice are recorded in matrices. The probability that such formed matrices have all different entries and are non-singular, is:
Four dice are thrown and the four numbers are arranged in a matrix . Since each die shows a value in and the four positions in the matrix are ordered, the total number of outcomes is .
We need all four entries to be different and . The number of ordered arrangements of 4 distinct values chosen from 6 is (we pick 4 values from 6 in order, since positions are distinguishable).
Now we count how many of these 360 matrices are singular (). We need two disjoint unordered pairs from with the same product. Listing all products of pairs of distinct elements: , , , , , , , , , , , , , , .
The only products that appear for two disjoint pairs are: product from and , and product from and . (Other repeated products, if any, would share a common element.)
For each such pair of disjoint pairs, we assign one pair to positions and the other to : there are 2 ways to decide which pair goes to . Each pair can be placed in its two positions in ways (e.g., or ). So each product class gives singular matrices.
Total singular matrices with all distinct entries: . Hence the number of non-singular matrices with all distinct entries is .
The required probability is . Simplify by dividing numerator and denominator by 8: .
Tagged Probability using permutations and combinations. Machine-assigned, so read it as a strong shortlist rather than a verdict.