The basic idea is, you take a guess and you -- whoops -- and you find the tangent of that guess.
首先取个猜想数,然后,嗯,去取猜想数那儿的切线。
So what would I want to do? I'd like to somehow walk down each of the digits one at a time and add them up. Ah, that's a looping mechanism, right? I need to have some way of walking through them.
去取这个数的,每个数字然后把他们加起来,啊,这是个循环机制对不对?,我得找到一个遍历它们的方法,一种简单的方法可能。
But we might then wonder, for every person who gets less than the average amount of life-- suppose we take the median, take the amount of life that's exactly, 50 percent of the people get more, 50 percent of the people get less.
但是接着我们可能会想,对于所有活得比平均寿命要短的人-,假设我们取中间数,相对于平均寿命,刚好五成的人活得更长,五成的人活得更短。
And when we talk about l it is a quantum number, so because it's a quantum number, we know that it can only have discreet values, it can't just be any value we want, it's very specific values.
当我们讲,l是一个量子数时,因为它是量子数,我们知道,它只能去分立的值,它不能取到所有的数,它取一些确定的数。
That being the case, what's my next guess?
那下一步我该怎么取猜想数呢?
And that idea was, we make a guess in the middle, we test it so this is kind of a guess and check, and if the answer was too big, then we knew that we should be looking over here. If it was too small, we knew we should be looking over here, and then we would repeat.
这些有理数是有序排列的,然后我们的想法是,首先在中间取个数作为猜想数,然后对这个猜想数进行验证,如果由猜想数得到的答案太大,我们知道应该跳过,比猜想数大的那个区间,如果太小的话。
应用推荐