Integer Square Roots and Perfect Power Detection

Q: Why filter modulo 64 rather than a prime?

Because the reduction is a bitwise AND, making it the cheapest possible filter, and because 64 is a strong filter in its own right — only 12 of its 64 classes contain squares. Prime moduli are used for the subsequent filters, where independence matters more than reduction cost.

Q: How do I compute an integer k-th root?

By the same Newton iteration generalised: x ← ((k−1)x + n/x^(k−1))/k, with an initial estimate from the bit length. Convergence is still quadratic, but each step is more expensive, so a good initial estimate matters more than in the square case.

Q: Is a perfect square always detected by the filters?

Yes — the filters never produce false negatives, only false positives. A genuine square passes every residue test by construction, so the filters can only send non-squares through to the exact check, never reject a real square.

Executive summary

Cheap rejection first, expensive confirmation second

The integer square root ⌊√n⌋ is computed by a Newton iteration carried out entirely in integers, converging quadratically from a good initial estimate. Testing whether n is a perfect square, however, should almost never begin with a square root: a handful of modular residue filters reject well over 99% of non-squares at negligible cost, so the expensive exact computation runs only on genuine candidates.

Learning objectives

Implement an integer Newton iteration with a correct termination condition.
Construct residue filters and quantify their rejection rate.
Detect perfect powers by bounding the possible exponents.
Recognise prime powers, and explain why this matters for factoring.

Section 01Integer square root by Newton's method

AlgorithmInteger square rootin: n ≥ 0 → out: ⌊√n⌋, exactly

If n = 0 return 0. Form an initial estimate x ← 2^⌈b/2⌉, where b is the bit length of n. A shift, not a floating-point square root — doubles lose accuracy above 2⁵³.
Set y ← ⌊(x + ⌊n/x⌋)/2⌋.
If y ≥ x, return x. Termination test: the iteration has stopped decreasing.
Set x ← y and return to step 2.

Never trust a floating-point square root

For n above 2⁵³ a double cannot represent n exactly, so floor(sqrt(n)) may be off by one — and off by one is precisely the error that makes a perfect square look imperfect. Use floating point only to form an initial estimate, and always finish in exact integer arithmetic.

Section 02Residue filters for square detection

Squares occupy only a small fraction of residue classes. Modulo 64 there are just 12 possible values of a square; modulo 63, 65 and 11 the fractions are similarly small. Combining a few such filters rejects the overwhelming majority of non-squares with a single table lookup each.

12 / 64square residues mod 64

> 99%non-squares rejected by four filters

O(1)cost per filter

AlgorithmPerfect square testin: n → out: whether n is a perfect square, and its root

Reject immediately if n < 0.
Look up n mod 64 in a 64-entry bit table; if absent, return false.
Repeat with moduli 63, 65 and 11. Chosen so that 63 · 65 · 11 is coprime to 64, maximising independence.
Compute s ← ⌊√n⌋ exactly.
Return true if and only if s² = n, and return s.

This pattern — cheap probabilistic rejection followed by exact confirmation — recurs throughout the subject. It is the same structure as a compositeness test followed by a primality proof.

Section 03Perfect powers and prime powers

If n = m^k with m ≥ 2, then k ≤ log₂ n. Only prime exponents need testing, since a composite exponent factors through a prime one. That bounds the search to a short list.

AlgorithmPerfect power detectionin: n ≥ 2 → out: (m, k) with n = m^k, or none

For each prime k ≤ log₂ n:
Compute the integer k-th root m by Newton's method for k-th roots.
If m^k = n, return (m, k). Recurse on m if a fully reduced base is required.
Return “not a perfect power”.

Why factoring code tests this first

Several major algorithms — Pollard’s ρ, the elliptic curve method, the quadratic sieve — behave badly or fail outright on perfect powers, and the AKS primality test requires the input not to be one. Perfect power detection is cheap and is therefore run as an unconditional first step, before any serious factoring effort begins.

Prime power detection follows: n is a prime power exactly when it is either prime, or a perfect power m^k whose base m is itself a prime power. The recursion terminates quickly because the exponent shrinks by at least a factor of 2 each time.

ReferenceFrequently asked questions

Why filter modulo 64 rather than a prime?

Because the reduction is a bitwise AND, making it the cheapest possible filter, and because 64 is a strong filter in its own right — only 12 of its 64 classes contain squares. Prime moduli are used for the subsequent filters, where independence matters more than reduction cost.

How do I compute an integer k-th root?

By the same Newton iteration generalised: x ← ((k−1)x + n/x^(k−1))/k, with an initial estimate from the bit length. Convergence is still quadratic, but each step is more expensive, so a good initial estimate matters more than in the square case.

Is a perfect square always detected by the filters?

Yes — the filters never produce false negatives, only false positives. A genuine square passes every residue test by construction, so the filters can only send non-squares through to the exact check, never reject a real square.

NavigateContinue in this stream

Curated next steps from this page. The site also surfaces algorithmically related reading below.

ProvenanceSources and further reading

This page is an original KEVOS explanatory article. It presents the underlying mathematics — definitions, algorithms, complexity results and selection criteria — in KEVOS editorial voice. No text is reproduced from any copyrighted source. Where numerical tables are relevant, KEVOS links to live authoritative databases rather than republishing static values.

Handbook application: from concept to controlled practice

Purpose. This expanded section turns the original page into a practical handbook. It preserves the supplied material and adds a repeatable way to apply, check and review Integer Square Roots and Perfect Power Detection. It does not replace a contract, legislation, a controlled standard, competent engineering judgement or specialist advice.

The operating aim is to turn a compact mathematical statement into a usable chain of definitions, claims, examples and checks. Read the original explanation first, then use the workflow and checks below to convert knowledge into evidence.

Treat Integer Square Roots and Perfect Power Detection as a network of definitions and implications, not as a list of formulas. The working vocabulary on this page—square, perfect, integer, detection, powers—should be made explicit before any proof or computation begins. Record the ambient set or structure, the permitted operations and the equality or equivalence relation in use. A compact theorem often changes meaning when the base field, finiteness condition, commutativity assumption or direction of an action changes.

For a proof, write the hypotheses as a checklist and mark the line at which each one is used. For a computation, state the representation of the input, the arithmetic model, the termination condition and the output invariant. For a classification problem, distinguish existence from uniqueness and distinguish an object from its representation. These separations prevent a correct local calculation from being mistaken for the general result.

A useful worked example should be small enough to inspect completely but rich enough to exercise the main mechanism. Compute the result in two ways where practical: symbolically and by substitution, structurally and numerically, or directly and through a normal form. Then include one near-miss example in which a hypothesis fails. The contrast explains why the theorem is shaped as it is and gives the reader a diagnostic pattern for later problems.

Verification is part of the mathematics. Check domains and codomains, substitute proposed solutions, test identity and zero cases, compare dimensions or cardinalities, and confirm that maps respect the required operations. In numerical work, report precision, conditioning and a residual rather than digits alone. In algorithmic work, separate mathematical correctness from implementation complexity and resource limits.

Step-by-step operating method

Fix the setting. State the objects, ambient structure, notation and assumptions before manipulating symbols.
Separate claims. Distinguish definitions, hypotheses, conclusions, equivalent conditions and consequences.
Choose a method. Select proof, construction, calculation or algorithm according to the question actually asked.
Work a small case. Use the smallest non-trivial example to expose the mechanism and test edge behaviour.
Verify independently. Substitute back, check invariants, test boundary cases or use an alternative derivation.

Worked-example protocol

Illustrative method—not a source theorem. Start with a small admissible input and list the definitions it must satisfy. Carry out each transformation on a separate line, citing the property that permits it. Preserve exact values until approximation is necessary. At the end, verify the output against the original definition and one invariant such as dimension, degree, determinant, order, norm or residual. Then alter one hypothesis and observe which step ceases to be valid. This protocol creates a reusable example without inventing a theorem-specific numerical answer.

Stage	Record	Quality check
Input	Objects, domain, notation, assumptions	Every symbol is defined
Method	Permitted operation or cited result at each step	All hypotheses hold
Output	Exact result and representation	Correct type, domain and form
Verification	Substitution, invariant or alternative derivation	Independent agreement
Boundary test	Zero, identity, degenerate or failed hypothesis	Scope is understood

Common failure modes and recovery actions

1. Watch for

Using a theorem without checking every hypothesis.

Recovery: Return to the governing definition or requirement and restate the decision in one sentence.

2. Watch for

Treating a suggestive example as a proof of the general case.

Recovery: Separate evidence from assumption, assign an owner and set a date for validation.

3. Watch for

Changing notation or conventions part-way through an argument.

Recovery: Run a small counterexample, boundary test, pilot or independent check before proceeding.

4. Watch for

Hiding a division-by-zero, convergence, finiteness or commutativity assumption.

Recovery: Record the consequence, decision and rationale, then update the controlled baseline.

5. Watch for

Reporting a computed result without a residual, substitution or structural check.

Recovery: Escalate when the issue affects safety, compliance, acceptance, material value or an agreed tolerance.

Review checklist

Can every symbol be traced to a definition or prior result?
Which hypothesis does each major step use?
Does the method cover zero, identity, degenerate and boundary cases?
Can the conclusion be checked by a second representation or calculation?
Are mandatory requirements distinguished from recommendations and illustrative values?
Are sources, assumptions, units, dates and versions recorded closely enough to reproduce the decision?
Have safety, legal, ethical, stakeholder and operational consequences been considered at the appropriate level?
Is there a named owner and a trigger for review, escalation, change or retirement?

Questions for deeper application

What is the most important distinction a practitioner must preserve when applying Integer Square Roots and Perfect Power Detection?