Lagrange's theorem for binary squares
From MaRDI portal
Recommendations
Cites work
- Elementary Methods in Number Theory
- Every natural number is the sum of forty-nine palindromes
- Every positive integer is a sum of three palindromes
- scientific article; zbMATH DE number 3916389 (Why is no real title available?)
- scientific article; zbMATH DE number 3664335 (Why is no real title available?)
- scientific article; zbMATH DE number 1995953 (Why is no real title available?)
- scientific article; zbMATH DE number 2024859 (Why is no real title available?)
- scientific article; zbMATH DE number 914352 (Why is no real title available?)
- scientific article; zbMATH DE number 2229022 (Why is no real title available?)
- On the sum of two squares and two powers of k
- Sums of Palindromes: an Approach via Automata
- The Hardy-Littlewood method.
- Waring's Problem
- Waring's Problem
Cited in
(7)- Additive number theory via automata theory
- Say no to case analysis: automating the drudgery of case-based proofs
- Swan's theorem for binary tetranomials
- Sums of Palindromes: an Approach via Automata
- scientific article; zbMATH DE number 3857232 (Why is no real title available?)
- ADDITIVE BASES AND NIVEN NUMBERS
- Lagrange's Theorem for Binary Squares
This page was built for publication: Lagrange's theorem for binary squares
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5005118)