Results 231 to 240 of about 597,490 (278)

Additive Number Theory via Automata Theory

Theory of Computing Systems, 2019
In the paper under review, the authors study several problems in additive number theory by using automata theory. In particular they use a result due to \textit{V. Bruyère} et al. [Bull. Belg. Math. Soc. - Simon Stevin 1, No. 2, 191--238 (1994; Zbl 0804.11024)] and its implementation in Mousavi's software ``Walnut''.
Aayush Rajasekaran   +2 more
openaire   +2 more sources

Additive Prime Number Theory

The Mathematical Gazette, 1958
The scope of the additive prime number theory is evident from its name. In this part of the theory of numbers we are concerned with the representation of integers as sums of primes; and here the central problem consists in the proof (or possibly refutation) of a celebrated conjecture made by Goldbach in 1742 to the effect that every even integer ≥4 can
openaire   +2 more sources

On a Problem of Additive Number Theory†

Journal of the London Mathematical Society, 1956
Let \(\{a_i\}\) be a non decreasing infinite sequence of non negative integers, \(f(n)\) the number of solutions of \(a_i+a_j = n\) and \(r(n)\) the number of solution of \(a_i+a_j \leq n\). \textit{P. Erdős} and \textit{P. Turán} [J. Lond. Math. Soc. 16, 212--215 (1941; Zbl 0061.07301)] conjectured that \(r(n)-cn = O(1)\) cannot hold.
Erdős, Pál, Fuchs, W. H. J.
openaire   +2 more sources

Additive Number Theory

1981
One of the most infamous problems is Goldbach’s conjecture that every even number greater than 4 is expressible as the sum of two odd primes. Richstein has verified it up to 4 · 1014, and on 2003-10-03 I learnt that Oliviera e Silva has extended this to 6 · 1016.
openaire   +1 more source

Probabilistic number theory in additive arithmetic semigroups II

Mathematische Zeitschrift, 2000
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources

Home - About - Disclaimer - Privacy