Greatest integer less than or equal to square root
In number theory, the integer square root (isqrt) of a non-negative integer n is the non-negative integer m which is the greatest integer less than or equal to the square root of n,
For example,
and 23 Related for: Integer square root information
integersquareroot (isqrt) of a non-negative integer n is the non-negative integer m which is the greatest integer less than or equal to the square root...
real number system, square numbers are non-negative. A non-negative integer is a square number when its squareroot is again an integer. For example, 9 =...
In some applications, an integersquareroot is required, which is the squareroot rounded or truncated to the nearest integer (a modified procedure may...
the squareroot of numbers having many digits. It was known to the ancient Greeks that square roots of positive integers that are not perfect squares are...
A002193 in the On-Line Encyclopedia of Integer Sequences consists of the digits in the decimal expansion of the squareroot of 2, here truncated to 65 decimal...
Fast inverse squareroot, sometimes referred to as Fast InvSqrt() or by the hexadecimal constant 0x5F3759DF, is an algorithm that estimates 1 x {\textstyle...
On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Nahin, Paul J. (1998). An Imaginary Tale: The story of i [the squareroot of minus one]. Chichester:...
decomposition of a positive integer into a product of integers. Every positive integer greater than 1 is either the product of two or more integer factors, in which...
theory, an algebraic integer is a complex number that is integral over the integers. That is, an algebraic integer is a complex root of some monic polynomial...
nth root of x". The definition then of an nth root of a number x is a number r (the root) which, when raised to the power of the positive integer n, yields x:...
optimal trial division algorithm uses all prime numbers not exceeding its squareroot, whereas the sieve of Eratosthenes produces each composite from its prime...
polynomials. The Gaussian integers are complex numbers of the form α = u + vi, where u and v are ordinary integers and i is the squareroot of negative one. By...
these homomorphisms will map each "squareroot" (typically not represented as a rational number) into its integer representative. Now the product of the...
algorithms for integer factorization. These algorithms run faster than the naïve algorithm, some of them proportional to the squareroot of the size of...
mathematics, a root of unity, occasionally called a de Moivre number, is any complex number that yields 1 when raised to some positive integer power n. Roots...
An algebraic number is a number that is a root of a non-zero polynomial in one variable with integer (or, equivalently, rational) coefficients. For example...
is a modern algorithm for finding all prime numbers up to a specified integer. Compared with the ancient sieve of Eratosthenes, which marks off multiples...
exponentiation is the remainder when an integer b (the base) is raised to the power e (the exponent), and divided by a positive integer m (the modulus); that is, c...
the squareroot of a nonnegative integer is either again an integer or an irrational number, in contrast an integer matrix can have a squareroot whose...
cube root of unity. The Eisenstein integers form a triangular lattice in the complex plane, in contrast with the Gaussian integers, which form a square lattice...
of two or more integers, which are not all zero, is the largest positive integer that divides each of the integers. For two integers x, y, the greatest...
the greatest common divisor (gcd) of integers a and b, also the coefficients of Bézout's identity, which are integers x and y such that a x + b y = gcd (...
Global Information
