Answer:
<h2>101010101010101010 </h2>
Step-by-step explanation:
given the binary operation a⊕ b=a^3−b and c = 101010101010101010
To get the value of c⊕ (c ⊕ c), we will express the binary given as that in question as shown;
c⊕ (c ⊕ c) = c³-(c ⊕ c)
c⊕ (c ⊕ c) = c³-(c³-c)
On expansion;
c⊕ (c ⊕ c) = c³-c³+c
c⊕ (c ⊕ c) = c
since c = 101010101010101010
c⊕ (c ⊕ c) = 101010101010101010
We have the sequence 2, 6, 10, 14, 18, ... Always 4 being added, so we can say:
The first term is 2. The added is 4, so,
a1 = 2
Prove:
A- 325 b- 382.8 C- 196 D- 9.375 E- 54 F- 828
Answer: 15120
Step-by-step explanation:
Given: The number of players at point guard = 10
The number of players at shooting guard = 12
The number of players at small forward = 7
The number of players at power forward = 2
The number of players at center = 9
Then, the number of different teams William could draft is given by :-
10∗12∗7∗2∗9=15120
Hence, William could draft 15120 different teams.
