-
In an orbital is remember that this area right here at r equals zerio, that is not a node.
例如对于１ｓ轨道,记住这里ｒ等于０处不是一个节点。
-
And in terms of radial nodes, we have 2 minus 1 minus 0, so what we have is one radial node.
对于径向节点，我们有２减去１减去０,所以有一个径向节点。
-
And then we'll construct our tree as follows: each node, well, let me put an example here.
然后我们如下建立我们的决策树：,每一个节点，好的，让我们在这里举一个例子。
-
Point of absolute rest in a vibrating string we call a node.
一条绳子上绝对震动静止的点,我们称之为节点。
-
So, actually I want you to go ahead in your notes and circle that zero point and write "not a node."
在你们笔记上把这个零点圈出来,在旁边写上“不是节点“,它不是节点“
-
You can go ahead and use that equation, or you could figure it out every time, because if you know the total number of nodes, and you know the angular node number, then you know how many nodes you're going to have left.
你们可以直接用这个方程，或者每次都自己算出来，因为如果你们知道了总的节点数，又知道角向节点数，就知道剩下的节点数是多少。
-
This is not a node because a node is where we actually have no probability density.
因为节点处是,没有概率密度的,所以。
-
So that means this node 1 will have an index of 1.
所以这意味着,这个节点索引值将会为。
-
At each node, I'm going to go left until I can't go any further.
在每一个节点，我都会先走左边的分支,直到走不下去。
-
That is to say, I'm going to go back to a node I've already visited.
也就是说我将要,返回我访问过的节点。
-
And, in fact, these are the only two types of nodes that we're going to be describing, so we can actually calculate both the total number of notes and the number of each type of node we should expect to see in any type of orbital.
事实上，我们只,描述这两种节点，所以我们可以,计算任何轨道中的,总结点数以及各种节点数。
-
But what we're saying is there's a node here, so that there's no probability of finding an electron between those two points.
但我们说在节点这里，这两点是,不可能发现电子的。
-
So this, where we start at zero is not a node, is the first thing to point out.
零点不是节点，这是第一个要指出来的，当我们。
-
So what we should expect to see is one radial node, and that is what we see here 3s in the probability density plot.
个节点,这就是我们，在这概率密度图上所看到的,如果我们考虑。
-
So that's why we saw, for example, in the p orbitals we had one angular node in each p orbital, because l is equal to 1 there.
这就是为什么在ｐ轨道中,每个轨道节点数都是１,因为这里ｌ等于１．
-
Yeah. And what does this node look like?
太好了，那这个节点应该是怎样的呢？
-
Yup, I heard one, so 2 minus 1, one total node.
嗯，我听到有人说１个，２减去１，１个节点。
-
The node is the same thing you see in a string.
这里所说的节点和你所知道的可以同样理解。
-
5 0 The first node will be the to-pull 2, 5 and 0.
第一个节点是可获取的物品。
-
So that's why we have this zero point here, and just to point out again and again and again, it's not a radial node, it's just a point where we're starting our graph, because we're multiplying it by r equals zero.
这就是为什么在这里有个零点，我需要再三强调，这不是径向零点，他只是我们画图的起始处，因为我们用ｒ等于０乘以它。
-
I'm glad to hear that no one counted this r equal zero as a node.
我很高兴没听到有人把ｒ等于０这处也算作是一个节点。
-
We have one node here, and we can again define that most probable radius.
在这里有个一节点，另外我们可以定义最可能半径。
-
And that zero point is the node.
这个零平面就是节点。
-
Yup, so one total node, 2 minus 1 is 1, and that means since l is equal to 1, we have one angular nodes, and that leaves us with how many radial nodes?
一个节点，２减去１等于１,因为ｌ等于１,我们有一个角向节点，那剩下径向节点有多少个呢？
-
And also that we know that the zero does not count as a node, if per se I actually had managed to hit zero in drawing that, so the correct answer would be the bottom one there.
另外你们要知道零点不是节点，假设说我确实把零点画成０了，那正确的结果就是底下这个。
-
And we ask, what do we get with this node?
然后我们问，这个节点我们获得的是什么？
-
And in terms of radial nodes, we expect to see one node.
对于径向节点，应该有１个。
-
We can also specify what kind of node we're talking about.
我们说的是哪种节点,我们在下节课。
-
And what is this node going to look like?
这个节点应该是什么样子呢？
应用推荐