This is a problem of permutation. In mathematics, the permutation relates to the fact of arranging all the member of a set into order. So, the k permutations of n are the different ordered arrangements of a k element subset of a n set. In the problem above k = 9 are the elements which are all the numerals available. On the other hand, n set is equal to 4. So, the formula of such k-permutations of n is given by:
Solving for k = 9 and n = 4:
Answer:
nbr2 = 0
Step-by-step explanation:
Given
The following program segment
<em>nbr2 = 0 </em>
<em>calc = 1 </em>
<em>x= 7 </em>
<em>while x >=3: </em>
<em> calc = calc * x </em>
<em> x = x - 2</em>
<em />
Required
The value of nbr2
In the first line, nbr2 was initialized to 0 i.e.
<em>nbr2 = 0</em>
<em />
From the second line of the program till the last, no operation was carried out on nbr2
This means that nbr2 will maintain its original value (which is 0)
Hence,
<em>The value of nbr2 is 0</em>
Answer:
39 Points
Step-by-step explanation:
Giants = G
Cowboys = C
Packers = P
Packers scored 39 points
17 * 2 = 34
34 - 9 = 25
25 + 14 = 39
Your welcome!
Kayden Kohl
8th Grade
Thirty-one and 903 thousandths