Search Results for ""

If r is a root of the polynomial equation x^n+a_(n-1)x^(n-1)+...+a_1x+a_0=0, where the a_is are integers and r satisfies no similar equation of degree <n, then r is called an ...

The complexity c_n of an integer n is the least number of 1s needed to represent it using only additions, multiplications, and parentheses. For example, the numbers 1 through ...

A p-adic integer is a p-adic number of the form sum_(k=m)^(infty)a_kp^k, where m>=0, a_k are integers, and p is prime. It is sufficient to take a_k in the set {0,1,...,p-1}. ...

A set of real numbers x_1, ..., x_n is said to possess an integer relation if there exist integers a_i such that a_1x_1+a_2x_2+...+a_nx_n=0, with not all a_i=0. For ...

A sequence whose terms are integers. The most complete printed references for such sequences are Sloane (1973) and its update, Sloane and Plouffe (1995). Neil Sloane ...

A regularly spaced array of points in a square array, i.e., points with coordinates (m,n,...), where m, n, ... are integers. Such an array is often called a grid or mesh, and ...

A quadratic form Q(x) is said to be positive semidefinite if it is never <0. However, unlike a positive definite quadratic form, there may exist a x!=0 such that the form is ...

A polynomial that represents integers for all integer values of the variables. An integer polynomial is a special case of such a polynomial. In general, every integer ...

The nearest integer function, also called nint or the round function, is defined such that nint(x) is the integer closest to x. While the notation |_x] is sometimes used to ...

Just as many interesting integer sequences can be defined and their properties studied, it is often of interest to additionally determine which of their elements are prime. ...