Répartition jointe dans les classes de résidus de la somme des chiffres pour deux représentations d’Ostrowski

2021 ◽  
pp. 1-22
Author(s):  
Myriam Amri ◽  
Lukas Spiegelhofer ◽  
Jörg Thuswaldner
Keyword(s):  
Error Term ◽  
Continued Fraction ◽  
Nous Obtenons ◽  
Estimation Formula ◽  
Sum Of Digits ◽  
De Formula ◽  
Positive Integers

Résumé. Pour deux entiers [Formula: see text], nous posons [Formula: see text] et [Formula: see text] (où [Formula: see text]) et nous notons respectivement [Formula: see text] et [Formula: see text] les fonctions sommes des chiffres dans les [Formula: see text] et [Formula: see text]-représentations d’Ostrowski de [Formula: see text]. Soient [Formula: see text] des entiers positifs tels que [Formula: see text] et [Formula: see text], nous obtenons une estimation en [Formula: see text] avec un terme d’erreur [Formula: see text] pour le cardinal de l’ensemble suivant [Formula: see text] pour tous les entiers [Formula: see text] et [Formula: see text] Notre résultat peut être comparé à celui de Bésineau et Kim qui ont traité le cas des [Formula: see text]-représentations dans différentes bases (qui sont premières entre elles). For two distinct integers [Formula: see text], we set [Formula: see text] and [Formula: see text] (where [Formula: see text] is the continued fraction [Formula: see text]) and we let [Formula: see text] and [Formula: see text] denote respectively, the sum of digits functions in the Ostrowski [Formula: see text] and [Formula: see text]-representations of [Formula: see text]. Let [Formula: see text] be positive integers satisfying [Formula: see text] and [Formula: see text], we obtain an estimation [Formula: see text] with an error term [Formula: see text] for the cardinality of the following set [Formula: see text] for all integers [Formula: see text] and [Formula: see text] Our result should be compared to that of Bésineau and Kim who addressed the case of the [Formula: see text]-representations in different bases (that are coprime).

XLIX.—Generalizations of a Problem of Pillai

1949 ◽  
Vol 62 (4) ◽  
pp. 460-469
Author(s):  
L. Mirsky
Keyword(s):  
Asymptotic Formula ◽  
Error Term ◽  
Main Concern ◽  
Positive Integers ◽  
Infinite Set

I. Throughout this paper k1, …, k3 will denote s ≥ I fixed distinct positive integers. Some years ago Pillai (1936) found an asymptotic formula, with error term O(x/log x), for the number of positive integers n ≤ x such that n + k1, …, n + k3 are all square-free. I recently considered (Mirsky, 1947) the corresponding problem for r-free integers (i.e. integers not divisible by the rth power of any prime), and was able, in particular, to reduce the error term in Pillai's formula.Our present object is to discuss various generalizations and extensions of Pillai's problem. In all investigations below we shall be concerned with a set A of integers. This is any given, finite or infinite, set of integers greater than 1 and subject to certain additional restrictions which will be stated later. The elements of A will be called a-numbers, and the letter a will be reserved for them. A number which is not divisible by any a-number will be called A-free, and our main concern will be with the study of A-free numbers. Their additive properties have recently been investigated elsewhere (Mirsky, 1948), and some estimates obtained in that investigation will be quoted in the present paper.

scholarly journals Solution of certain Pell equations

2018 ◽  
Vol 11 (04) ◽  
pp. 1850056 ◽  
Author(s):  
Zahid Raza ◽  
Hafsa Masood Malik
Keyword(s):  
Positive Integer ◽  
Fundamental Solution ◽  
Positive Solutions ◽  
Continued Fraction ◽  
Pell Equation ◽  
Lucas Sequences ◽  
Pell Equations ◽  
Integer Solutions ◽  
Positive Integers

Let [Formula: see text] be any positive integers such that [Formula: see text] and [Formula: see text] is a square free positive integer of the form [Formula: see text] where [Formula: see text] and [Formula: see text] The main focus of this paper is to find the fundamental solution of the equation [Formula: see text] with the help of the continued fraction of [Formula: see text] We also obtain all the positive solutions of the equations [Formula: see text] and [Formula: see text] by means of the Fibonacci and Lucas sequences.Furthermore, in this work, we derive some algebraic relations on the Pell form [Formula: see text] including cycle, proper cycle, reduction and proper automorphism of it. We also determine the integer solutions of the Pell equation [Formula: see text] in terms of [Formula: see text] We extend all the results of the papers [3, 10, 27, 37].

scholarly journals Output Sum of Transducers: Limiting Distribution and Periodic Fluctuation

10.37236/5026 ◽  
2015 ◽  
Vol 22 (2) ◽  
Author(s):  
Clemens Heuberger ◽  
Sara Kropf ◽  
Helmut Prodinger
Keyword(s):  
Periodic Function ◽  
Error Term ◽  
Fourier Coefficients ◽  
Higher Dimensions ◽  
Expected Value ◽  
Hölder Continuous ◽  
Periodic Fluctuation ◽  
Sum Of Digits ◽  
Sum Of Digits Function ◽  
Random Integer

As a generalization of the sum of digits function and other digital sequences, sequences defined as the sum of the output of a transducer are asymptotically analyzed. The input of the transducer is a random integer in $[0, N)$. Analogues in higher dimensions are also considered. Sequences defined by a certain class of recursions can be written in this framework.Depending on properties of the transducer, the main term, the periodic fluctuation and an error term of the expected value and the variance of this sequence are established. The periodic fluctuation of the expected value is Hölder continuous and, in many cases, nowhere differentiable. A general formula for the Fourier coefficients of this periodic function is derived. Furthermore, it turns out that the sequence is asymptotically normally distributed for many transducers. As an example, the abelian complexity function of the paperfolding sequence is analyzed. This sequence has recently been studied by Madill and Rampersad.

scholarly journals Integers free of small prime factors in arithmetic progressions

2000 ◽  
Vol 157 ◽  
pp. 103-127 ◽  
Author(s):  
Ti Zuo Xuan
Keyword(s):  
Prime Number ◽  
Short Range ◽  
Error Term ◽  
Real Zero ◽  
Prime Number Theorem ◽  
Arithmetic Progressions ◽  
Real Character ◽  
Dickman Function ◽  
Prime Factors ◽  
Positive Integers

For real x ≥ y ≥ 2 and positive integers a, q, let Φ(x, y; a, q) denote the number of positive integers ≤ x, free of prime factors ≤ y and satisfying n ≡ a (mod q). By the fundamental lemma of sieve, it follows that for (a,q) = 1, Φ(x,y;a,q) = φ(q)-1, Φ(x, y){1 + O(exp(-u(log u- log2 3u- 2))) + (u = log x log y) holds uniformly in a wider ranges of x, y and q.Let χ be any character to the modulus q, and L(s, χ) be the corresponding L-function. Let be a (‘exceptional’) real character to the modulus q for which L(s, ) have a (‘exceptional’) real zero satisfying > 1 - c0/log q. In the paper, we prove that in a slightly short range of q the above first error term can be replaced by where ρ(u) is Dickman function, and ρ′(u) = dρ(u)/du.The result is an analogue of the prime number theorem for arithmetic progressions. From the result can deduce that the above first error term can be omitted, if suppose that 1 < q < (log q)A.

RELATION BETWEEN A CLASS OF QUASIPERIODIC LATTICES GENERATED BY THE SUBSTITUTION METHOD AND THE GENERALIZED CONTINUED FRACTION EXPANSION

1996 ◽  
Vol 10 (17) ◽  
pp. 2081-2101
Author(s):  
TOSHIO YOSHIKAWA ◽  
KAZUMOTO IGUCHI
Keyword(s):  
Continued Fraction ◽  
Positive Real Number ◽  
Real Numbers ◽  
Continued Fraction Expansion ◽  
Positive Real ◽  
Periodic Sequences ◽  
One Dimensional ◽  
Finite Period ◽  
The One ◽  
Positive Integers

The continued fraction expansion for a positive real number is generalized to that for a set of positive real numbers. For arbitrary integer n≥2, this generalized continued fraction expansion generates (n−1) sequences of positive integers {ak}, {bk}, … , {yk} from a given set of (n−1) positive real numbers α, β, …ψ. The sequences {ak}, {bk}, … ,{yk} determine a sequence of substitutions Sk: A → Aak Bbk…Yyk Z, B → A, C → B,…,Z → Y, which constructs a one-dimensional quasiperiodic lattice with n elements A, B, … , Z. If {ak}, {bk}, … , {yk} are infinite periodic sequences with an identical period, then the ratio between the numbers of n elements A, B, … , Z in the lattice becomes a : β : … : ψ : 1. Thereby the correspondence is established between all the sets of (n−1) positive real numbers represented by a periodic generalized continued fraction expansion and all the one-dimensional quasiperiodic lattices with n elements generated by a sequence of substitutions with a finite period.

scholarly journals Indecomposable permutations with a given number of cycles

2009 ◽  
Vol DMTCS Proceedings vol. AK,... (Proceedings) ◽  
Author(s):  
Robert Cori ◽  
Claire Mathieu
Keyword(s):  
Fixed Point ◽  
Error Term ◽  
Nous Obtenons ◽  
Threshold Phenomenon ◽  
Arbitrary Genus ◽  
International Audience ◽  
Asymptotic Probability ◽  
Number Of Cycles ◽  
Pour Cent ◽  
Orientable Surfaces

International audience A permutation $a_1a_2 \ldots a_n$ is $\textit{indecomposable}$ if there does not exist $p \lt n$ such that $a_1a_2 \ldots a_p$ is a permutation of $\{ 1,2, \ldots ,p\}$. We compute the asymptotic probability that a permutation of $\mathbb{S}_n$ with $m$ cycles is indecomposable as $n$ goes to infinity with $m/n$ fixed. The error term is $O(\frac{\log(n-m)}{ n-m})$. The asymptotic probability is monotone in $m/n$, and there is no threshold phenomenon: it degrades gracefully from $1$ to $0$. When $n=2m$, a slight majority ($51.1 \ldots$ percent) of the permutations are indecomposable. We also consider indecomposable fixed point free involutions which are in bijection with maps of arbitrary genus on orientable surfaces, for these involutions with $m$ left-to-right maxima we obtain a lower bound for the probability of being indecomposable. Une permutation $a_1a_2 \ldots a_n$ est $\textit{indécomposable}$, s’il n’existe pas de $p \lt n$ tel que $a_1a_2 \ldots a_p$ est une permutation de $\{ 1,2, \ldots ,p\}$. Nous calculons la probabilité pour qu’une permutation de $\mathbb{S}_n$ ayant $m$ cycles soit indécomposable et plus particulièrement son comportement asymptotique lorsque $n$ tend vers l’infini et que $m=n$ est fixé. Cette valeur décroît régulièrement de $1$ à $0$ lorsque $m=n$ croît, et il n’y a pas de phénomène de seuil. Lorsque $n=2m$, une faible majorité ($51.1 \ldots$ pour cent) des permutations sont indécomposables. Nous considérons aussi les involutions sans point fixe indécomposables qui sont en bijection avec les cartes de genre quelconque plongées dans une surface orientable, pour ces involutions ayant $m$ maxima partiels (ou records) nous obtenons une borne inférieure pour leur probabilité d’êtres indécomposables.

scholarly journals GENERALIZED CONTINUED FRACTION EXPANSIONS WITH CONSTANT PARTIAL DENOMINATORS

2018 ◽  
Vol 107 (02) ◽  
pp. 272-288
Author(s):  
TOPI TÖRMÄ
Keyword(s):  
Positive Integer ◽  
Real Number ◽  
Continued Fraction ◽  
Positive Real Number ◽  
Rational Numbers ◽  
Positive Real ◽  
Image Position ◽  
Fixed Positive Integer ◽  
Continued Fraction Expansions ◽  
Positive Integers

We study generalized continued fraction expansions of the form $$\begin{eqnarray}\frac{a_{1}}{N}\frac{}{+}\frac{a_{2}}{N}\frac{}{+}\frac{a_{3}}{N}\frac{}{+}\frac{}{\cdots },\end{eqnarray}$$ where $N$ is a fixed positive integer and the partial numerators $a_{i}$ are positive integers for all $i$ . We call these expansions $\operatorname{dn}_{N}$ expansions and show that every positive real number has infinitely many $\operatorname{dn}_{N}$ expansions for each $N$ . In particular, we study the $\operatorname{dn}_{N}$ expansions of rational numbers and quadratic irrationals. Finally, we show that every positive real number has, for each $N$ , a $\operatorname{dn}_{N}$ expansion with bounded partial numerators.

scholarly journals A simple proof of Euler's continued fraction of e1/M

2016 ◽  
Vol 100 (548) ◽  
pp. 279-287
Author(s):  
Joseph Tonien
Keyword(s):  
Simple Proof ◽  
Continued Fraction ◽  
Infinite Continued Fraction ◽  
Image Position ◽  
Positive Integers

A continued fraction is an expression of the formand we will denote it by the notation [f0, (g0, f1), (g1, f2), (g2, f3), … ]. If the numerators gi are all equal to 1 then we will use a shorter notation [f0, f1, f2, f3, … ]. A simple continued fraction is a continued fraction with all the gi coefficients equal to 1 and with all the fi coefficients positive integers except perhaps f0.The finite continued fraction [f0, (g0, f1), (g1, f2),…, (gk–1, fk)] is called the k th convergent of the infinite continued fraction [f0, (g0, f1), (g1, f2),…]. We defineif this limit exists and in this case we say that the infinite continued fraction converges.

On Ramanujan's Arithmetical Function Σr, s(n)

1929 ◽  
Vol 25 (3) ◽  
pp. 255-264 ◽  
Author(s):  
J. R. Wilton
Keyword(s):  
Error Term ◽  
Arithmetical Function ◽  
Arithmetical Functions ◽  
Image Position ◽  
The Right ◽  
Positive Integers

Let σs(n) denote the sum of the sth powers of the divisors of n,and let , where ζ(s) is the Riemann ζfunction. Ramanujan, in his paper “On certain arithmetical functions*”, proves that, ifandthen , whenever r and s are odd positive integers. He conjectures that the error term on the right of (1·1) is of the formfor every ε > 0, and that it is not of the form . He further conjectures thatfor all positive values of r and s; and this conjecture has recently been proved to be correct.

scholarly journals Extensions of some formulae of A. Selberg

1985 ◽  
Vol 8 (2) ◽  
pp. 283-302 ◽  
Author(s):  
Claudia A. Spiro
Keyword(s):  
Arithmetic Progression ◽  
Arbitrary Number ◽  
Error Term ◽  
Fixed Number ◽  
Prime Divisors ◽  
Positive Integers ◽  
Number Of Prime Divisors

This paper is concerned with estimating the number of positive integers up to some bound (which tends to infinity), such that they have a fixed number of prime divisors, and lie in a given arithmetic progression. We obtain estimates which are uniform in the number of prime divisors, and at the same time, in the modulus of the arithmetic progression. These estimates take the form of a fixed but arbitrary number of main terms, followed by an error term.

Sign in / Sign up

Export Citation Format

Share Document