主平方根函数是使用非正实轴作为分支切割定义的。
The principal square root function is defined using the nonpositive real axis as a branch cut.
这个让你知道怎样寻找平方根。
100的平方根永远等于10。
2π乘以R/d的平方根,得到1。
You take two pi times the square root 85 of R over d and you find 1.85.
一个数的平方根会小于0么？
我大概能理解它，即使平方根很难看到。
I can sort of understand that although the square root is hard to see.
请考虑清单1所示的平方根函数的原型。
Consider the prototype for a simple square root function shown in Listing 1.
或者，它可以表现的像个开平方根的机器。
你应该用乘积的平方根。
标准差是方差的平方根。
它不会帮你算出平方根。
过滤目标数的所有因子，从1到其平方根。
Filter all of the target number's factors from 1 to the square root of the number.
2的平方根，乘以15。
另外，计算平方根。
所以你看联系总是,在于2平方根。
So you see the connection is always through this square root of two.
如果有人请求负数的平方根，也将发送错误响应。
You also send a fault response if someone requests the square root of a negative number.
取平方根，乘以。
取它的平方根。
但是系统能量的变化量大约,会是N的平方根乘以ε
But the system variance is going to be on the order of the square root of N times epsilon.
假设我想在一大段代码中，计算很多次平方根。
Suppose I want to compute square roots a lot of places in a big chunk of code.
我接下来要求b的平方和h的平方,的和的平方根对不对？
I want to then do, I need to find the square root b squared plus h squared, right?
你会做数学吗：100乘4除以100的平方根是多少呢？
Can you do the math: What is one hundred times four, divided by the square root of a hundred?
如果我可以成对获得因子，那么我只需要循环到该数字的平方根。
I only need to go up to the square root of the number if I can harvest the factors in pairs. To that end, I improve the algorithm and refactor the code to Listing 3.
,这是我们写的计算平方根的代码，计算完全全平方根的。
It's the piece of code we wrote for computing square roots, square roots of actually perfect squares.
如果您成对获取因子，您只需要检查到目标数的平方根即可。
If you can harvest factors in pairs, you need only check factors up to the square root of the target number.
对输入的整数求平方根，遍历所有小于或等于平方根的整数。
It loops through all of the integers that are less than or equal to the square root of the input integer.
对输入的整数求平方根，遍历所有小于或等于平方根的整数。
It loops through all of the integers that are less than or equal to the square root of the input integer.
应用推荐