Back to Search
Start Over
Additive Number Theory via Approximation by Regular Languages.
- Source :
- International Journal of Foundations of Computer Science; Sep2020, Vol. 31 Issue 6, p667-687, 21p
- Publication Year :
- 2020
-
Abstract
- We prove some new theorems in additive number theory, using novel techniques from automata theory and formal languages. As an example of our method, we prove that every natural number > 2 5 is the sum of at most three natural numbers whose base- 2 representation has an equal number of 0 's and 1 's. [ABSTRACT FROM AUTHOR]
Details
- Language :
- English
- ISSN :
- 01290541
- Volume :
- 31
- Issue :
- 6
- Database :
- Complementary Index
- Journal :
- International Journal of Foundations of Computer Science
- Publication Type :
- Academic Journal
- Accession number :
- 146967878
- Full Text :
- https://doi.org/10.1142/S0129054120410014