Back to search

Institutional Repository of Vilnius University

Divisibility of truncated periodic sequences /

Abstract

dc:description

A finite set of primes S is called unavoidable with respect to integer b > 1 if and only if for every ξ > 0 the sequence of integers ⌊ξ b^k⌋ contains infinitely many elements divisible by primes from S. It is known that unavoidable sets of primes exist when b = 2, 3, 4, 6 and it does not exist for an integer b > 1 such that b − 1 is square free. If there is no unavoidable set of primes for b, for every finite set of primes S we call its falsifier a real ξ_S > 1 such that the sequence ⌊ξ_S b^k⌋ has only finitely many elements divisible by primes from S. In this paper I classify all b > 1 whose all falsifiers have two ultimately repeating digits. In particular, I show that if b > 3 is prime, then there is no unavoidable set of primes for b. Based on this thesis, I co-authored an article which was published in the International Journal of Number Theory.

Degree

thesis:*
Grantor dc:publisher
Institutional Repository of Vilnius University
Year dc:date
2022

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Jonuška, Lukas,

Subjects

dc:subject × 1

Rights

dc:rights
Statement dc:rights
  • info:eu-repo/semantics/openAccess
Language dc:language
eng

Identifiers

dc:identifier.*

Chain of custody

source
Harvested from
Vilnius University
Base URL
epublications.vu.lt/oai
Last updated
2026-11-19
Source record
OAI-PMH GetRecord
citation

Jonuška, Lukas,. Divisibility of truncated periodic sequences /. Institutional Repository of Vilnius University, 2022. https://repository.vu.lt/VU:ELABAETD146235740&prefLang=en_US