查询词典 positive integer

Let m be a three-digit positive integer with sum of digits n.

设m是三位正整数，m的数字之和是n而n的数字之和是8。

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+均为质数。

The object of this paper is to derive a general formula to evaluate the sum of the series wherein N may be any positive integer.

的求和。本文目的在于得到一个N为任意正整数的通式，对于任何N均可直接套用，而且这个结果也可作为一个不难实现的计算机用算法。

In addition, by utilizing Jacobi two square numbers theorem and Lagrange four square numbers theorem and some theta function identities, we also prove the known results of number theory: two triangular number theorem, four triangular number theorem, and the number of representations of a positive integer by various quadratic forms in terms of divisor functions

包括Jacobi二平方数定理，Lagrange四平方数定理等，然后利用这些结果结合几个theta函数恒等式，我们获得了把任意一个正整数表示成两个三角数或四个三角数的和以及其他的二次形式的方法数，这些方法数都是用因子函数来表示的。

In 2004 Zhang Zhongfu presented the concept ofadjacent vertex distinguishing total coloring whose content is: Let G be a connectedsimple graph with order at least 2, k be a positive integer and f be a mappling fromV∪E to {1,2,...,k}. Let C={f}∪{f|uv∈E,v∈V}for all u∈V. If (1) for any uv, vw∈E,u≠w, we have f≠f;(2) for any uv∈E, we have f≠f, f≠f, f≠f,then f is called a k-proper total coloring of graph G.

第三章和第四章主要研究了两种联图的邻点可区别全染色，邻点可区别全染色的定义是张忠辅在2004年提出来的，其内容为：设G是阶至少为2的简单连通图，k是正整数，f是V∪E到{1，2，…，k}的映射，对任意u∈V，记C={f}∪{f|uv∈E，v∈V}。

Thus given a positive integer N , by our algorithm we can find an abelian Cayley Digraph with degree 2 whose diameter is minimal.

因此， 对一个给定的正整数，用我们的算法可以找到一个直径最小的阿贝尔群上2度有向凯莱图。

A composite is a positive integer with more than two divisors.

复合数就是具有一个以上约数的正整数。

Then they calculate the magic number N that is the number of positive integer divisors of the product a1*a2*...

这位牺牲自己的英雄将由N的个位数来决定（编号为N的个位数加1的人要跳下去）。

To any positive integer n, we apply the general term formular for the equation of devision that can produce a general equation or nth degree in one unknown, i.

对任意正整数n，运用等分方程定理的通项公式，就可产生一个一元n次方程的一般式。

But we don't care about Battlegrounds.

但我们并不在乎沙场中的显露。

Ah! don't mention it, the butcher's shop is a horror.

啊！不用提了。提到肉，真是糟透了。