The number of ways in which the name 'ESTABROK' can be made with no restrictions is 40, 320 ways.
<h3>How to determine the number of ways</h3>
Given the word:
ESTABROK
Then n = 8
p = 6
The formula for permutation without restrictions
P = n! ( n - p + 1)!
P = 8! ( 8 - 6 + 1) !
P = 8! (8 - 7)!
P = 8! (1)!
P = 8 × 7 × 6 × 5 × 4 × 3 × 2 × 1 × 1
P = 40, 320 ways
Thus, the number of ways in which the name 'ESTABROK' can be made with no restrictions is 40, 320 ways.
Learn more about permutation here:
brainly.com/question/4658834
#SPJ1
Answer:
angel bisector
Step-by-step explanation:
this pic explains why
Using the dot product:
For any vector x, we have
||x|| = √(x • x)
This means that
||w|| = √(w • w)
… = √((u + z) • (u + z))
… = √((u • u) + (u • z) + (z • u) + (z • z))
… = √(||u||² + 2 (u • z) + ||z||²)
We have
u = ⟨2, 12⟩ ⇒ ||u|| = √(2² + 12²) = 2√37
z = ⟨-7, 5⟩ ⇒ ||z|| = √((-7)² + 5²) = √74
u • z = ⟨2, 12⟩ • ⟨-7, 5⟩ = -14 + 60 = 46
and so
||w|| = √((2√37)² + 2•46 + (√74)²)
… = √(4•37 + 2•46 + 74)
… = √314 ≈ 17.720
Alternatively, without mentioning the dot product,
w = u + z = ⟨2, 12⟩ + ⟨-7, 5⟩ = ⟨-5, 17⟩
and so
||w|| = √((-5)² + 17²) = √314 ≈ 17.720
