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.

Previous Page 3

Displaying 41 – 57 of 57

Showing per page

Multigeometric sequences and Cantorvals

Artur Bartoszewicz, Małgorzata Filipczak, Emilia Szymonik (2014)

Open Mathematics

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...

Multiplicative functions and k -automatic sequences

Soroosh Yazdani (2001)

Journal de théorie des nombres de Bordeaux

A sequence is called k -automatic if the n ’th term in the sequence can be generated by a finite state machine, reading n in base k as input. We show that for many multiplicative functions, the sequence ( f ( n ) mod v ) n 1 is not k -automatic. Among these multiplicative functions are γ m ( n ) , σ m ( n ) , μ ( n ) et φ ( n ) .

Multiplicative relations on binary recurrences

Florian Luca, Volker Ziegler (2013)

Acta Arithmetica

Given a binary recurrence u n n 0 , we consider the Diophantine equation u n 1 x 1 u n L x L = 1 with nonnegative integer unknowns n 1 , . . . , n L , where n i n j for 1 ≤ i < j ≤ L, m a x | x i | : 1 i L K , 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.

Multiplicatively dependent triples of Tribonacci numbers

Carlos Alexis Ruiz Gómez, Florian Luca (2015)

Acta Arithmetica

We consider the Tribonacci sequence T : = T n n 0 given by T₀ = 0, T₁ = T₂ = 1 and T n + 3 = T n + 2 + T n + 1 + T n for all n ≥ 0, and we find all triples of Tribonacci numbers which are multiplicatively dependent.

Currently displaying 41 – 57 of 57

Previous Page 3