因此，如果文本匹配了整个模式，第一组括号将生成表示一个正整数或负整数的的字符串，例如+ 49。

Hence, if text matched the entire pattern, the first set of parentheses would yield a string representing a positive or negative integer, such as + 49.

youdao

您还可以编写代码，用一个正整数的因子来确定它是否为素数(定义为大于1的整数，该数字仅有的因子为1和本身)。

You could also write code that USES a positive integer's factors to determine if it is a prime number (defined as an integer greater than 1 whose only factors are 1 and the number itself).

youdao

否则，任何正整数或负整数都可以用来对结果排序。

Otherwise, any positive or negative integer may be used to rank productions. Now we can run.

youdao

I print out -- and this is only wrapping - because of the big font -- I print out, "I demand that you give me a positive integer."

我打印出来--这个字符相互覆盖了,因为用的是大字体-,我打印：“我需要你给我一个正整数“

哈佛公开课 - 计算机科学课程节选

I demand that you give me a positive integer.

我要求你给我一个正整数。

哈佛公开课 - 计算机科学课程节选

But also unlike n, l cannot have just any value, we can't go into infinity.

但不像n，l，不能取所有整数，不能到正无穷。

麻省理工公开课 - 化学原理课程节选