A note on values of Beatty sequences that are free of large prime factors

2020 ◽  
Vol 160 (1) ◽  
pp. 53-63
Author(s):  
Yıldırım Akbal
Keyword(s):  
Beatty Sequences ◽  
Prime Factors

On the prime factors of the iterates of the Ramanujan τ–function

2020 ◽  
Vol 63 (4) ◽  
pp. 1031-1047
Author(s):  
Florian Luca ◽  
Sibusiso Mabaso ◽  
Pantelimon Stănică
Keyword(s):  
Positive Integer ◽  
Prime Factors

AbstractIn this paper, for a positive integer n ≥ 1, we look at the size and prime factors of the iterates of the Ramanujan τ function applied to n.

On triplets with descending largest prime factors

2001 ◽  
Vol 38 (1-4) ◽  
pp. 45-50 ◽  
Author(s):  
A. Balog
Keyword(s):  
Prime Factor ◽  
Prime Factors ◽  
Consecutive Integers

For an integer n≯1 letP(n) be the largest prime factor of n. We prove that there are infinitely many triplets of consecutive integers with descending largest prime factors, that is P(n - 1) ≯P(n)≯P(n+1) occurs for infinitely many integers n.

scholarly journals On integers free of large prime factors

1986 ◽  
Vol 296 (1) ◽  
pp. 265-265 ◽  
Author(s):  
Adolf Hildebrand ◽  
G{érald Tenenbaum
Keyword(s):  
Prime Factors

The Distribution Of Totatives

1955 ◽  
Vol 7 ◽  
pp. 347-357 ◽  
Author(s):  
D. H. Lehmer
Keyword(s):  
Positive Integer ◽  
Prime Factors ◽  
Image Position

This paper is concerned with the numbers which are relatively prime to a given positive integerwhere the p's are the distinct prime factors of n. Since these numbers recur periodically with period n, it suffices to study the ϕ(n) numbers ≤n and relatively prime to n.

scholarly journals Ergodic averages with prime divisor weights in

2017 ◽  
Vol 39 (4) ◽  
pp. 889-897 ◽  
Author(s):  
ZOLTÁN BUCZOLICH
Keyword(s):  
Dynamical System ◽  
Ergodic Theorem ◽  
Prime Divisor ◽  
Ergodic Averages ◽  
Weighting Functions ◽  
Pointwise Ergodic Theorem ◽  
Prime Factors ◽  
Ergodic Dynamical System ◽  
Image Position

We show that $\unicode[STIX]{x1D714}(n)$ and $\unicode[STIX]{x1D6FA}(n)$, the number of distinct prime factors of $n$ and the number of distinct prime factors of $n$ counted according to multiplicity, are good weighting functions for the pointwise ergodic theorem in $L^{1}$. That is, if $g$ denotes one of these functions and $S_{g,K}=\sum _{n\leq K}g(n)$, then for every ergodic dynamical system $(X,{\mathcal{A}},\unicode[STIX]{x1D707},\unicode[STIX]{x1D70F})$ and every $f\in L^{1}(X)$, $$\begin{eqnarray}\lim _{K\rightarrow \infty }\frac{1}{S_{g,K}}\mathop{\sum }_{n=1}^{K}g(n)f(\unicode[STIX]{x1D70F}^{n}x)=\int _{X}f\,d\unicode[STIX]{x1D707}\quad \text{for }\unicode[STIX]{x1D707}\text{ almost every }x\in X.\end{eqnarray}$$ This answers a question raised by Cuny and Weber, who showed this result for $L^{p}$, $p>1$.

scholarly journals Beatty sequences and Langford sequences

1993 ◽  
Vol 111 (1-3) ◽  
pp. 165-178 ◽  
Author(s):  
Roger B. Eggleton ◽  
Aviezri S. Fraenkel ◽  
R.Jaime Simpson
Keyword(s):  
Beatty Sequences

scholarly journals Characterization of two-distance sequences

1992 ◽  
Vol 53 (2) ◽  
pp. 198-218 ◽  
Author(s):  
W. F. Lunnon ◽  
P. A. B. Pleasants
Keyword(s):  
Formal Languages ◽  
Minimal Word ◽  
Beatty Sequences ◽  
Straight Lines ◽  
Symbol Sequences ◽  
Number Of Authors

AbstractThree differently defined classes of two-symbol sequences, which we call the two-distance sequences, the linear sequences and the characteristic sequences, have been discussed by a number of authors and some equivalences between them are known. We present a self-contained proof that the three classes are the same (when ambiguous cases of linear sequences are suitably in terpreted). Associated with each sequence is a real invariant (having a different appropriate definition for each of the three classes). We give results on the relation between sequences with the same invariant and on the symmetry of the sequences. The sequences are closely related to Beatty sequences and occur as digitized straight lines and quasicrystals. They also provide examples of minimal word proliferation in formal languages.

Sign in / Sign up

Export Citation Format

Share Document