九州大学 システム情報科学府 情報理工学専攻・電気電子工学専攻 2023年8月実施 確率・統計
Author
Casablanca, 祭音Myyura
Description
箱の中に N 1 N_1 N 1 個の白いボールと N 2 N_2 N 2 個の黒いボールがあり, その総数を N = N 1 + N 2 N = N_1 + N_2 N = N 1 + N 2 とする。この箱から 2 2 2 つのボールをランダムに選び, 両方が白いボールである確率は 1 / 2 1/2 1/2 であるとする。
(1) N 2 N_2 N 2 が奇数のとき N 1 N_1 N 1 の最小値を求めよ。
(2) N 2 N_2 N 2 が偶数のとき N 1 N_1 N 1 の最小値を求めよ。
(3) N N N を値の小さい順に 3 3 3 つ求めよ。
A box contains N 1 N_1 N 1 white and N 2 N_2 N 2 black balls, and the total number of balls is N = N 1 + N 2 N = N_1 + N_2 N = N 1 + N 2 .
When two balls are randomly drawn from the box, the probability that both balls are white is 1 / 2 1/2 1/2 .
(1) Find the minimum value of N 1 N_1 N 1 when N 2 N_2 N 2 is an odd number.
(2) Find the minimum value of N 1 N_1 N 1 when N 2 N_2 N 2 is an even number.
(3) Find the three smallest values of N N N .
Kai
Let A A A denote the event "both balls are white", then we have
P ( A ) = ( 2 N 1 ) ( 2 N 1 + N 2 ) = N 1 ( N 1 − 1 ) ( N 1 + N 2 ) ( N 1 + N 2 − 1 ) P(A) = \frac{\binom{2}{N_1}}{\binom{2}{N_1+N_2}} = \frac{N_1(N_1 - 1)}{(N_1 + N_2)(N_1 + N_2 - 1)} P ( A ) = ( N 1 + N 2 2 ) ( N 1 2 ) = ( N 1 + N 2 ) ( N 1 + N 2 − 1 ) N 1 ( N 1 − 1 )
Since P ( A ) = 1 2 P(A) = \frac{1}{2} P ( A ) = 2 1 , we have
N 1 2 − N 1 − 2 N 1 N 2 − N 2 2 + N 2 = 0 N_1^2 - N_1 - 2N_1N_2 - N_2^2 + N_2 = 0 N 1 2 − N 1 − 2 N 1 N 2 − N 2 2 + N 2 = 0
(1)
Let N 2 = 2 k + 1 N_2 = 2k + 1 N 2 = 2 k + 1 . Then we have
N 1 2 − ( 4 k + 3 ) N 1 + ( 2 k + 1 ) − ( 2 k + 1 ) 2 = 0 N_1^2 - (4k + 3)N_1 + (2k + 1) - (2k + 1)^2 = 0 N 1 2 − ( 4 k + 3 ) N 1 + ( 2 k + 1 ) − ( 2 k + 1 ) 2 = 0
from which we have
N 1 = 4 k + 3 ± 8 ( 2 k + 1 ) 2 + 1 2 (i) N_1 = \frac{4k + 3 \pm \sqrt{8(2k + 1)^2 + 1}}{2} \tag{i} N 1 = 2 4 k + 3 ± 8 ( 2 k + 1 ) 2 + 1 ( i )
when k = 0 k = 0 k = 0 , N 1 N_1 N 1 get the minimum value 3 3 3 .
(2)
Let N 2 = 2 k N_2 = 2k N 2 = 2 k . Then we have
N 1 2 − ( 4 k + 1 ) N 1 + 2 k − 4 k 2 = 0 N_1^2 - (4k + 1)N_1 + 2k - 4k^2 = 0 N 1 2 − ( 4 k + 1 ) N 1 + 2 k − 4 k 2 = 0
from which we get
N 1 = 4 k + 1 ± 32 k 2 + 1 2 (ii) N_1 = \frac{4k + 1 \pm \sqrt{32k^2 + 1}}{2} \tag{ii} N 1 = 2 4 k + 1 ± 32 k 2 + 1 ( ii )
when k = 3 k = 3 k = 3 , N 1 N_1 N 1 get the minimum value 15 15 15 .
(3)
From (i) and (ii) , we easily know that the larger N 1 N_1 N 1 , the larger N 2 N_2 N 2 we have and 8 N 2 2 + 1 8N_2^2 + 1 8 N 2 2 + 1 must be a number of squares.
Let 8 N 2 2 + 1 = K 2 8N_2^2 + 1 = K^2 8 N 2 2 + 1 = K 2 , we have 8 N 2 2 = ( K − 1 ) ( K + 1 ) 8N_2^2 = (K - 1)(K + 1) 8 N 2 2 = ( K − 1 ) ( K + 1 ) , which implies that K K K is odd.
Let K = 2 p + 1 K = 2p + 1 K = 2 p + 1 . Then we have 2 N 2 2 = p ( p + 1 ) 2N_2^2 = p(p+1) 2 N 2 2 = p ( p + 1 ) .
Easy to find that p = 1 p = 1 p = 1 , p = 8 p = 8 p = 8 and p = 49 p = 49 p = 49 are three solutions and the corresponding value of N N N is 4 4 4 , 21 21 21 and 120 120 120 .