Related papers: Rational numbers in $\times b$-invariant sets

If the denominator of a rational function of several variables is sum of even powers and the numerator is a monomial, then we give a numerical criterion, using the exponents involved in the expression of the rational function, to decide if…

In our previous papers we introduced categorical invariants, which are, roughly speaking, sets of triangulated subcategories in a given triangulated category and their quotients. Here is extended the list of examples, where these sets are…

In this work initial numbers and repunit numbers have been studied. All numbers have been considered in a decimal notation. The problem of simplicity of initial numbers has been studied. Interesting properties of numbers repunit are proved:…

We give a classification and complete algebraic description of groups allowing only finitely many (left multiplication invariant) circular orders. In particular, they are all solvable groups with a specific semi-direct product…

We give a~detailed construction of the complete ordered field of real numbers by means of infinite decimal expansions. We prove that in the canonical encoding of decimals neither addition nor multiplication is {\em computable}, but that…

For a real number $x$ and set of natural numbers $A$, define $x \ast A := \{ x a \bmod 1: a\in A\}\subseteq [0,1).$ We consider relationships between $x$, $A$, and the order-type of $x\ast A$. For example, for every irrational $x$ and…

We present a detailed and elementary construction of the real numbers from the rational numbers a la Bourbaki. The real numbers are defined to be the set of all minimal Cauchy filters in $\mathbb{Q}$ (where the Cauchy condition is defined…

We introduce two families of transcendental numbers which we call finite factorial (FF) and partially finite factorial (PFF) numbers respectively, with the former one being subfamily of the latter one. These numbers arise naturally from…

The analogue of Hilbert's tenth problem over $\mathbb{Q}$ asks for an algorithm to decide the existence of rational points in algebraic varieties over this field. This remains as one of the main open problems in the area of undecidability…

Let $A$ be a non-zero abelian variety over a field $F$ that is not algebraic over a finite field. We prove that the rational rank of the abelian group $A(F)$ is infinite when $F$ is large in the sense of Pop (also called ample). The main…

Given a positive rational number $n/d$ with $d$ odd, its odd greedy expansion starts with the largest odd denominator unit fraction at most $n/d$, adds the largest odd denominator unit fraction so the sum is at most $n/d$, and continues as…

Let $g$ be sufficiently large, $b\in\{0,\ldots,g-1\}$, and $\mathcal{S}_b$ be the set of integers with no digit equal to $b$ in their base $g$ expansion. We prove that every sufficiently large odd integer $N$ can be written as $p_1 + p_2 +…

The well known binary and decimal representations of the integers, and other similar number systems, admit many generalisations. Here, we investigate whether still every integer could have a finite expansion on a given integer base b, when…

Given a natural number $k\ge 2$ and a $k$-automatic set $S$ of natural numbers, we show that the lower density and upper density of $S$ are recursively computable rational numbers and we provide an algorithm for computing these quantities.…

A set $M$ of nonzero integers is said to split a finite abelian group $G$ if there exists a subset $S\subseteq G$ such that $M\cdot S = G\setminus\{0\}$. Such a splitting is called purely singular if every prime divisor of $|G|$ divides…

We define an abelian loop on a set $S$ consisting of 1 and all odd prime numbers with an operation $\bullet$, where for $a,b$ $\in$ $S$, $a$ $ \bullet$ $b$ is the smallest element of $S$ strictly larger than $|a-b|$. We use theorems and…

Let $b \ge 2$ be an integer. We prove that the $b$-adic expansion of every irrational algebraic number cannot have low complexity. Furthermore, we establish that irrational morphic numbers are transcendental, for a wide class of morphisms.…

The greatest power of a prime $p$ dividing the natural number $n$ will be denoted by $n_p$. Let $Ind_G(g)=|G:C_G(g)|$. Suppose that $G$ is a finite group and $p$ is a prime. We prove that if there exists an integer $\alpha>0$ such that…

This work proposes a proof of the simplest cubic primes counting problem. It shows that the subset of primes {p = n^3 + 2 is prime : n => 1} is an infinite subset of primes. Further, the expected order of magnitude of the cubic primes…

We determine all triples $(a,b,n)$ of positive integers such that $a$ and $b$ are relatively prime and $n^k$ divides $a^n + b^n$ (respectively, $a^n - b^n$), when $k$ is the maximum of $a$ and $b$ (in fact, we answer a slightly more general…