Detecting square numbers

DOI10.2989/16073606.2019.1678530MaRDI QIDQ4986564zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

binaryhexadecimaloctalsquare number

Mathematics Subject Classification ID

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

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

Cites work

• Detecting perfect powers by factoring into coprimes
• Detecting perfect powers in essentially linear time
• scientific article; zbMATH DE number 3303655 (Why is no real title available?)
• Perfect power testing
• Sieve algorithms for perfect power testing

Cited in

(6)

• Detecting squarefree numbers
• scientific article; zbMATH DE number 3884116 (Why is no real title available?)
• scientific article; zbMATH DE number 3877262 (Why is no real title available?)
• Square curious numbers
• Role of digital root in number theory
• Four-digit numbers which are squared sums

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)