您要查找的是不是:
- LAST INTEGER SOLUTION IS THE BEST FOUND! 以上整数解是最优解!
- Does not contain the specified value, the method returns a negative integer. 不包含指定值,则该方法会返回负整数。
- Fixed a couple of overflow bugs in case of very large negative integer numbers. 修正了在非常的的负整数情况下的一对溢出错误
- Function returns the first negative integer greater than or equal to the number. 函数返回大于或等于该数字的第一个负整数。
- Class B decrements a counter when class A generated a negative integer and increments when class A generated a positive integer. 当A类生成了一个负整数并且增加一个正数时B类减少了一个计数器。
- Gets or sets a positive or negative integer offset from the starting node that determines the root hierarchy that is exposed by the data source control. 获取或设置一个从起始节点开始计算的正整数或负整数偏移量,该起始节点确定了由数据源控件公开的根层次结构。
- 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. 对于具有整数约束条件的问题,应该减小“规划求解选项”对话框中的“允许误差”的设置,使“规划求解”找到更好的整数解。
- non negative semidefinite matrix 非负半正定阵
- 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为奇素数方幂的必要条件.
- non Negative Matrix Factorization(NMF) 非负矩阵因子
- 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是奇素数的方幂。
- You're given an array containing both positive and negative integers and required to find the sub-array with the largest sum(O(N) a la KBL). 译:一个包含正整数和负整数的数组,找出和最大的子串.
- Given a cube of positive and negative integers, find the sub-cube with the largest sum.The sum of a cube is the sum of all the elements in that cube. 给出一个正整数和负整数组成的立方体,找出其中具有最大和的子立方体。
- 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. 并且利用其结果得到了几类二元二次不定方程的整数解表达式。
- A member of any of the further sets of mathematical objects,such as negative integers and real numbers,that can be derived from the positive integers by induction. 数更多的数学集合中的一元,如负整数或实数,通过归纳正整数而得出。
- number of positive integer solution 正整数解数
- A member of any of the further sets of mathematical objects, such as negative integers and real numbers, that can be derived from the positive integers by induction. 数更多的数学集合中的一元,如负整数或实数,通过归纳正整数而得出
- You're given an array containing both positive and negative integers and required to find the sub-array with the largest sum(O(N) a la KBL).Write a routine in C for the above. 译:一个包含正整数和负整数的数组,找出和最大的子串,用C程序描述。