scholarly journals Binomial formulas via divisors of numbers

2021 ◽  
Vol 27 (4) ◽  
pp. 122-128
Author(s):  
Karol Gryszka ◽  
Keyword(s):  

The purpose of this note is to prove several binomial-like formulas whose exponents are values of the function ω(n) counting distinct prime factors of n.

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

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.


2001 ◽  
Vol 38 (1-4) ◽  
pp. 45-50 ◽  
Author(s):  
A. Balog

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.


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

1955 ◽  
Vol 7 ◽  
pp. 347-357 ◽  
Author(s):  
D. H. Lehmer

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.


2017 ◽  
Vol 39 (4) ◽  
pp. 889-897 ◽  
Author(s):  
ZOLTÁN BUCZOLICH

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$.


PLoS ONE ◽  
2021 ◽  
Vol 16 (3) ◽  
pp. e0246698
Author(s):  
Joseph D. O’Brien ◽  
James P. Gleeson ◽  
David J. P. O’Sullivan

In all competitions where results are based upon an individual’s performance the question of whether the outcome is a consequence of skill or luck arises. We explore this question through an analysis of a large dataset of approximately one million contestants playing Fantasy Premier League, an online fantasy sport where managers choose players from the English football (soccer) league. We show that managers’ ranks over multiple seasons are correlated and we analyse the actions taken by managers to increase their likelihood of success. The prime factors in determining a manager’s success are found to be long-term planning and consistently good decision-making in the face of the noisy contests upon which this game is based. Similarities between managers’ decisions over time that result in the emergence of ‘template’ teams, suggesting a form of herding dynamics taking place within the game, are also observed. Taken together, these findings indicate common strategic considerations and consensus among successful managers on crucial decision points over an extended temporal period.


Sign in / Sign up

Export Citation Format

Share Document