I think select the video insert select the movie option under illustrations resize the video player then select the insert tab i’m not 100 percent sure tho
Answer:
-
= 1
= 1
Explanation:
Argon atom has atomic number 18. Then, it has 18 protons and 18 electrons.
To determine the quantum numbers you must do the electron configuration.
Aufbau's principle is a mnemonic rule to remember the rank of the orbitals in increasing order of energy.
The rank of energy is:
1s < 2s < 2p < 3s < 3p < 4s < 3d < 4p < 5s < 4d < 5p < 6s < 4f < 5d < 6p < 7s < 5f < 6d < 7d
You must fill the orbitals in order until you have 18 electrons:
- 1s² 2s² 2p⁶ 3s² 3p⁶ : 2 + 2 + 6 + 2 + 6 = 18 electrons.
The last electron is in the 3p orbital.
The quantum numbers associated with the 3p orbitals are:
= 1 (orbitals s correspond to
= 0, orbitals p correspond to
= 1, orbitals d, correspond to
= 2 , and orbitals f correspond to
= 3)
can be -1, 0, or 1 (from -
to +
)
- the fourth quantum number, the spin can be +1/2 or -1/2
Thus, the six possibilities for the last six electrons are:
- (3, 1, -1 +1/2)
- (3, 1, -1, -1/2)
- (3, 1, 0, +1/2)
- (3, 1, 0, -1/2)
- (3, 1, 1, +1/2)
- (3, 1, 1, -1/2)
Hence, the correct choice is:
-
= 1
= 1
The answer is commas. <span>When listing columns in the select list, commas should be used to separate the columns.</span>
Answer:
1. x - 6
2. p - ? = 7
i chose these equations because
a number - 6 = the weight of your backpack.
p - an unknown number without a substitute variable = slices of bread left.
Answer:
import sys
import turtle
import random
def n_pointed_star(total_points):
if total_points <= 4:
raise ValueError('Not enough total_points')
area = 150
for coprime in range(total_points//2, 1, -1):
if greatest_common_divisor(total_points, coprime) == 1:
start = turtle.position()
for _ in range(total_points):
turtle.forward(area)
turtle.left(360.0 / total_points * coprime)
turtle.setposition(start)
return
def greatest_common_divisor(a, b):
while b != 0:
a, b = b, a % b
return a
turtle.reset()
n_pointed_star(5)
Explanation:
- Inside the n_pointed_star function, check whether the total no. of points are less than or equal to 4 and then throw an exception.
- Loop through the total_points variable and check whether the result from greatest_common_divisor is equal to 1 or not and then set the starting position of turtle and move it.
- Create the greatest_common_divisor which takes two parameters a and b to find the GCD.
- Finally reset the turtle and call the n_pointed_star function.