The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying 21 –
40 of
200
This paper studies the descriptional complexity of (i) sequences over a finite alphabet ; and (ii) subsets of (the natural numbers). If is a sequence over a finite alphabet , then we define the -automaticity of , to be the smallest possible number of states in any deterministic finite automaton that, for all with , takes expressed in base as input and computes . We give examples of sequences that have high automaticity in all bases ; for example, we show that the characteristic...
A positive integer is said to be a Jordan-Pólya number if it can be written as a product of factorials. We obtain non-trivial lower and upper bounds for the number of Jordan-Pólya numbers not exceeding a given number .
In a stunning new advance towards the Prime k-Tuple Conjecture, Maynard and Tao have shown that if k is sufficiently large in terms of m, then for an admissible k-tuple of linear forms in ℤ[x], the set contains at least m primes for infinitely many n ∈ ℕ. In this note, we deduce that contains at least m consecutive primes for infinitely many n ∈ ℕ. We answer an old question of Erdős and Turán by producing strings of m + 1 consecutive primes whose successive gaps form an increasing (resp....
In this paper the special diophantine equation with integer coefficients is discussed and integer solutions are sought. This equation is solved completely just for four prime divisors of .
Currently displaying 21 –
40 of
200