Live briefing
Everything about Integer square root
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, Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: Integer square rootA 5-minute orientation
- Skim a recent paper: Sums of square roots that are close to an integerInfluential work since 2022
- Pick up a classic book: Painless Algebra (Painless)The most-reprinted book on the subject
- Read the landmark paper: Energy of a graph is never the square root of an odd integerCited 30 times
- Go sideways: Square root algorithmsA closely related topic
- Go sideways: Karatsuba algorithmA closely related topic
📖 Definitions
No dictionary entry for this exact phrase.
🏆 Landmark papers (most cited)
Energy of a graph is never the square root of an odd integer
Integer factoring and modular square roots
AT2-optimal VLSI integer division and integer square rooting
On a fast integer square root algorithm
Pseudo-Normalization via Integer Fast Inverse Square Root and Its Application to Fast Computation without Division
A Configurable IP Core for Calculating the Integer Square Root for Serial and Parallel Implementations in FPGA
An Infinite Product for the Square Root of an Integer
The integer square root of N via a binary search
🆕 Influential since 2022
📚 Books worth reading
Painless Algebra (Painless)Lynette Long, Lynette Long Ph.D. · 1998
Discrete and combinatorial mathematicsRalph P. Grimaldi · 1985
Barlow's tables of squares, cubes, square roots, cube roots, reciprocals of all integer numbers up to 10,000Peter Barlow · 1856- 📕Barlow's tables of squares, cubes, square roots, cube roots, and reciprocals of all integers up to 12,500Peter Barlow · 1944
- 📕Barlow's tables of squares, cubes, square roots, cube roots, and reciprocals of all integers up to 12,500Peter Barlow · 1944
Discrete mathematicsNorman Biggs · 1985
Saxon Math 8/7Stephen Hake · 2003
Barlow's Tables of Squares, Cubes, Square Roots, Cube Roots, Reciprocals of All Integer Numbers Up to 10,000Peter Barlow · 2018
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- Square root algorithms Square root algorithms compute the non-negative square root S of a positive real number S. Since all square roots of natural numbers, other than of perfect…
- Karatsuba algorithm The Karatsuba algorithm is a fast multiplication algorithm for integers. It was discovered by Anatoly Karatsuba in 1960 and published in 1962. It is a…
- Multiplication algorithm A multiplication algorithm is an algorithm (or method) to multiply two numbers. Depending on the size of the numbers, different algorithms are more efficient…
- Division algorithm A division algorithm is an algorithm which, given two integers N and D (respectively the numerator and the denominator), computes their quotient and/or…
- Exponentiation by squaring In mathematics and computer programming, exponentiating by squaring is a general method for fast computation of large positive integer powers of a number…
- Fast inverse square root Fast inverse square root, sometimes referred to as Fast InvSqrt() or by the hexadecimal constant 0x5F3759DF, is an algorithm that estimates 1/x, the reciprocal…
- Periodic continued fraction In mathematics, an infinite periodic continued fraction is a simple continued fraction that can be placed in the form x = a 0 + 1 a 1 + 1 a 2 + 1 ⋱ a k…
- Split-radix FFT algorithm The split-radix FFT is a fast Fourier transform (FFT) algorithm for computing the discrete Fourier transform (DFT), and was first described in an initially…