Detecting square numbers

DOI10.2989/16073606.2019.1678530zbMATH Open1484.11231OpenAlexW2984049015MaRDI QIDQ4986564FDOQ4986564

Authors: Philip R. Brown 

Publication date: 27 April 2021

Published in: Quaestiones Mathematicae (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2989/16073606.2019.1678530

Recommendations

• Detecting squarefree numbers
• An integer based square root algorithm
• Square-Rooting Algorithms for High-Speed Digital Circuits
• Square curious numbers
• Detecting perfect powers in essentially linear time

zbMATH Keywords

binaryoctalsquare numberhexadecimal

Mathematics Subject Classification ID

Radix representation; digital problems (11A63) Number-theoretic algorithms; complexity (11Y16) Factorization; primality (11A51)

Cites Work

• Title not available (Why is that?)
• Sieve algorithms for perfect power testing
• Detecting perfect powers in essentially linear time
• Perfect power testing
• Detecting perfect powers by factoring into coprimes

Cited In (6)

• Four-digit numbers which are squared sums
• Detecting squarefree numbers
• Title not available (Why is that?)
• Title not available (Why is that?)
• Square curious numbers
• Role of digital root in number theory

This page was built for publication: Detecting square numbers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4986564)