• We first introduce methods of finding the sum of the first n terms for an arithmetic sequence of higher order.

    我们首先介绍了高阶等差数列前n项和的求解方法。

    youdao

  • For example, if the complexity order of the current technique is O(n**2), speeding up the steps by 10x is a lot less helpful than finding an O(n) substitute.

    例如,如果当前技术的复杂性等级是O(n**2),那么将这些步骤加速10倍远不及寻找 O(n) 替代品来得有用。

    youdao

  • N on linear calibration and finding circle edge were introduced to measure the images acquired.

    系统选用背光源照明,采用非线性校准及查找圆边的方法对采集到的图像进行测量。

    youdao

  • We first introduce three methods of finding the sum of the first n terms for an arithmetic sequence of higher order, and then display another method by some formal derivatives of which are defined.

    首先,简要介绍了三种主要的求和方法。然后,根据高阶等差数列通项的特性,利用新定义的形式导数列对其进行了有效的探讨。

    youdao

  • We first introduce three methods of finding the sum of the first n terms for an arithmetic sequence of higher order, and then display another method by some formal derivatives of which are defined.

    首先,简要介绍了三种主要的求和方法。然后,根据高阶等差数列通项的特性,利用新定义的形式导数列对其进行了有效的探讨。

    youdao

$firstVoiceSent
- 来自原声例句
小调查
请问您想要如何调整此模块?

感谢您的反馈,我们会尽快进行适当修改!
进来说说原因吧 确定
小调查
请问您想要如何调整此模块?

感谢您的反馈,我们会尽快进行适当修改!
进来说说原因吧 确定