您要查找的是不是：
- nonnegative integer solution 非负整数解
- For any nonnegative integer m, let g(m)=[12(1m2+8)]+[12(1+m)]. 对于非负数m;设g(m)=[12(1-m2+8)]+[12(1+m)].
- Is a nonnegative integer that indicates the length for the chosen data type. 非负整数,指示所选数据类型的长度。
- LAST INTEGER SOLUTION IS THE BEST FOUND! 以上整数解是最优解!
- Remember, the number from any category can be any nonnegative integer (0, one, or many).Calculate the maximum number of possible points. 来自任意的"种类"的题目数目可能任何非负数(0或更多)。
- Is a nonnegative integer that indicates the maximum total number of decimal digits that can be stored, both to the left and to the right of the decimal point. 非负整数,指示可保留的最大十进制位数,包括小数点前面和后面的数字。
- The resulting value must be a nonnegative integer less than the sequence's length, and the sequence is asked to assign the assigned object to its item with that index. 最后的值必须是一个小于该序列长度的非负整数，然后该序列就被请求将被赋对象赋值给它带那个指标的项。
- For problems with integer constraints, you need to decrease the Tolerance setting in the Solver Options dialog box so that Solver can find a better integer solution. 对于具有整数约束条件的问题,应该减小“规划求解选项”对话框中的“允许误差”的设置,使“规划求解”找到更好的整数解。
- A symbol that represents one of the nonnegative integers smaller than the radix.In decimal notation, one of the characters from0 to9. 表示比数基小的非负整数的符号。在十进制记数法中，每位数是0到9的一个数字。
- A symbol that represents one of the nonnegative integers smaller than the radix. 表示比数基小的非负整数的符号。
- Let r be an odd integer with r>1.In this paper the author gives a necessary condition for(X,Y,Z) being a positive integer solution of the equation X~2+Y~2=Z~r with Y being a power of an odd prime. 设r是大于1的奇数;给出了方程X2+Y2=Zr的正整数解(X;Y;Z)中Y为奇素数方幂的必要条件.
- A symbol that represents one of the nonnegative integers smaller than the radix.In decimal notation,one of the characters from0to9. 表示比数基小的非负整数的符号。在十进制记数法中，每位数是0到9的一个数字。
- Let(a,b,c) be a primitive Pythagorean triple with a is even. In this paper we prove that if c is a prime power,then the equation x~2+b~y=c~z has only the positive integer solution(x,y,z)=(a,2,2) with y is even. 设(a;b;c)是一组适合a为偶数的本原商高数;该文证明了:当c是素数方幂时;方程x2+by=cz仅有正整数解(x;y;z)=(a;2;2)可使y是偶数.
- In this paper, let p be an odd prime with p>3, we prove that the equation (xp-yp)/(x-y)=z2 has only the positive integer solution (x, y, z, p)=(3,1,11,5), satisfying x>y+1. gcd (x, y)=1. As a result, x is an odd prime power. 设p是大于3的奇素数,证明:方程2)()(zyxyxpp=--,1+>yx,1),gcd(=yx仅当p=5时有正整数解)11,1,3(),,(=zyx可使x是奇素数的方幂。
- Using the elementary methods, all the positive integer solutions of the equation are obtained.The solvability of the equation is solved completely. 利用初等方法，获得了方程的所有正整数解，完全解决了该方程的可解性问题。
- And based on these results the expressions for some binary indefinite quadratic equations integer solutions are obtained. 并且利用其结果得到了几类二元二次不定方程的整数解表达式。
- number of positive integer solution 正整数解数
- In this paper we have found out all integer solutions of the Diophanine equation in the title, which was proposed by Mordell in 1969 and reproposed by Guy in 1981. 1969年,Mordell提出求解不定方程6y~2=(x+1)(x~2-x+6),本文解决了这个问题,求得了这个方程的全部整数解。
- In this paper,the author has proved that the Diophantine y(y+1)(y+2)(y+3)=nx(x+1)(x+2)(x+3) has no integer solutions when n=13~(2k),k is a natural number . 本文用初等方法证明了不定方程y(y+1)(y+2)(y+3)=nx(x+1)(x+2)(x+3)在n=13~(2k)(k为自然数)时无解.
