查询词典 consecutive integer

An expression of a positive integer as a sum of positive integers.

首先应了解应该除掉的三大敌人：犹豫不决、怀疑和恐惧。

For any positive integer n, letfn denote the index of the highest power of 2 which

对於任何正整数 n，设fn 为可整除 n！的 2 的最高乘幂的指数。例如：因为

Find the smallest positive integer n for which both 80 n- and 80 n+ are prime.

求最小的正整数n，使得 80 n-和 80 n+均为质数。

Where m, n is a positive integer, x, y is a positive real number and H, L represents Si, SiNx film, respectively.

前面用逗号，同时描述几组，每组都是两个。m， n是整数，x，y是正实数，H，L代表硅和氮化硅薄膜。

ZhuWenyu implemented the above two algorithms on a PC, testing 3640471 with AKSalgorithm and 4295884871 with the first AKS-Bernstein algorithm in about 2478.94hours and 28.35 hours respectively. She concluded that it's almost impossible tojudge the primality of a given integer directly with AKS algorithm, and testifiedthat the first AKS-Bernstein algorithm improves the AKS algorithm, but it's notyet suitable for use in practice, either.

朱文余在微机同禧3206c/850上用C语言实现了AKS算法及上述改进，前一算法对3640471进行测试约需2478.94小时，而后者对4295884871进行测试约需28.35小时，从而指出在实际运用中直接利用AKS算法进行素性测定几乎不可能，而AKS-Bernstein第一算法比AKS算法有一些改进，但仍不实用。

Prime Factorization. Take your solutions for isprime and getfactors in the previous problems and create a function that takes an integer as input and returns a list of its prime factors.

素因子。以刚才练习中的 isprime 和 getfactors 函数为基础编写一个函数，它接受一个整数作为参数，返回该整数所有素数因子的列表。

It can be integrated into existing applications. It is designed for application developer. The system provides power modeling. Users can widely select decision variables, such as integer, real, Boolean, etc. Users can also select extensive set of predefined constraints, such as primitive constraints and function constraints, local constraints and global constraints.

"明月"系统是开放的C++类库，可嵌入到具体的应用中，可扩展，是面向开发人员设计的；系统具有强有力的建模功能，用户可以广泛选择决策变量，例如整型、实型、布尔型等；可扩展的预定义约束集合，其中包括基本约束和功能约束，局部约束和全局约束。

It is a difficult problem for a big prime integer, if we select a primitive root according to its definition the performance of the secret communication could be affected seriously since the operation cost is very high. So this paper presents and proves an algorithm for searching a primitive root with high efficiency and gives the design of flow and corresponded JAVA program.

第一步：随机选取大素数P和在GF上的本原根g，并将P和g作为公开信息；第二步：用户A想和用户B建立保密通信时，就要交换共享的密钥KAB，A随机选取整数XA(1≤XA≤P-1)，并且计算出YA=gXAmodP经共用信道传给B，将XA保密；第三步：用户B随机选取一整数XB(1≤XB≤P-1)，计算出YB=gXBmodp，也经共用

Since the number of trips is a non-negative integer, truncated, and of endogenous stratification, this study empirically analyzes its recreational benefits by the On-site Poisson and truncated negative binomial with endogenous stratification of the Travel Cost Method. Besides, this study adopts TNBES to see how the number of trips disperse and takes the consumer surplus to assess benefits. As to visitors' valuation, this research uses the ordered probit to do empirical analysis and then divides all satisfaction factors by the factor analysis and cluster analysis into four factors and two clusters, which then are taken as explanatory variables.

考量旅游次数为非负整数、截断、内生分层等特质，本研究在游憩效益方面，采旅游成本法中的现场波松(On-site Poisson)、截断式内生分层负二项(Truncated Negtive Binomial with Endogenous Stratification， TNBES)模型做实证分析，并於TNBES模型检定旅游次数之扩散情形，效益之评估采消费者剩余为计算标准；在游客评价方面，采次序波比模型做实证分析，并将游客对科博馆各项因素满意度以因素分析、集群分析，区分为四大因素构面与二大集群，纳入游客评价为解释变数，并探讨消费者剩余对游客评价之影响。

To prepare a program for a group of integer value.

详细说明：编写一个程序求一组整数的中值。

Chimborazo and Cotopaxi, took me by the hand.

越过琴博腊索山和科托帕克西山。

This car is in a good condition.

这辆车的状况很好。