The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
For a sequence x ∈ l 10, one can consider the achievement set E(x) of all subsums of series Σn=1∞ x(n). It is known that E(x) has one of the following structures: a finite union of closed intervals, a set homeomorphic to the Cantor set, a set homeomorphic to the set T of subsums of Σn=1∞ x(n) where c(2n − 1) = 3/4n and c(2n) = 2/4n (Cantorval). Based on ideas of Jones and Velleman [Jones R., Achievement sets of sequences, Amer. Math. Monthly, 2011, 118(6), 508–521] and Guthrie and Nymann [Guthrie...
A sequence is called -automatic if the ’th term in the sequence can be generated by a finite state machine, reading in base as input. We show that for many multiplicative functions, the sequence is not -automatic. Among these multiplicative functions are et .
Given a binary recurrence , we consider the Diophantine equation
with nonnegative integer unknowns , where for 1 ≤ i < j ≤ L, , and K is a fixed parameter. We show that the above equation has only finitely many solutions and the largest one can be explicitly bounded. We demonstrate the strength of our method by completely solving a particular Diophantine equation of the above form.
We consider the Tribonacci sequence given by T₀ = 0, T₁ = T₂ = 1 and for all n ≥ 0, and we find all triples of Tribonacci numbers which are multiplicatively dependent.
Currently displaying 41 –
57 of
57