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.

Displaying 181 – 200 of 387

Showing per page

Integers in number systems with positive and negative quadratic Pisot base

Z. Masáková, T. Vávra (2014)

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

We consider numeration systems with base β and − β, for quadratic Pisot numbers β and focus on comparing the combinatorial structure of the sets Zβ and Z− β of numbers with integer expansion in base β, resp. − β. Our main result is the comparison of languages of infinite words uβ and u− β coding the ordering of distances between consecutive β- and (− β)-integers. It turns out that for a class of roots β of x2 − mx − m, the languages coincide, while for other quadratic Pisot numbers the language...

Integers with a maximal number of Fibonacci representations

Petra Kocábová, Zuzana Masáková, Edita Pelantová (2005)

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

We study the properties of the function R ( n ) which determines the number of representations of an integer n as a sum of distinct Fibonacci numbers F k . We determine the maximum and mean values of R ( n ) for F k n < F k + 1 .

Integers with a maximal number of Fibonacci representations

Petra Kocábová, Zuzana Masáková, Edita Pelantová (2010)

RAIRO - Theoretical Informatics and Applications

We study the properties of the function R(n) which determines the number of representations of an integer n as a sum of distinct Fibonacci numbers Fk. We determine the maximum and mean values of R(n) for Fk ≤ n < Fk+1.

Currently displaying 181 – 200 of 387