Density Modulo 1 of a Sequence Associated with a Multiplicative Function Evaluated at Polynomial Arguments

2018 ◽  
pp. 153-161
Author(s):  
Jean-Marc Deshouillers ◽  
Mohammad Nasiri-Zare
Keyword(s):  
Multiplicative Function

scholarly journals HELSON'S PROBLEM FOR SUMS OF A RANDOM MULTIPLICATIVE FUNCTION

Mathematika ◽  
2015 ◽  
Vol 62 (1) ◽  
pp. 101-110 ◽  
Author(s):  
Andriy Bondarenko ◽  
Kristian Seip
Keyword(s):  
Multiplicative Function

Generating Functions for a Class of Arithmetic Functions

1966 ◽  
Vol 9 (4) ◽  
pp. 427-431 ◽  
Author(s):  
A. A. Gioia ◽  
M.V. Subbarao
Keyword(s):  
Generating Functions ◽  
Multiplicative Function ◽  
Arithmetic Function ◽  
Arithmetic Functions ◽  
Prime Divisors ◽  
Image Position

In this note the arithmetic functions L(n) and w(n) denote respectively the number and product of the distinct prime divisors of the integer n ≥ 1, and L(l) = 0, w(l) = 1. An arithmetic function f is called multiplicative if f(1) = 1 and f(mn) = f(m)f(n) whenever (m, n) = 1. It is known ([1], [3], [4]) that every multiplicative function f satisfies the identity1.1

scholarly journals Some characterizations of totients

1996 ◽  
Vol 19 (2) ◽  
pp. 209-217 ◽  
Author(s):  
Pentti Haukkanen
Keyword(s):  
Multiplicative Function ◽  
Arithmetical Function ◽  
Multiplicative Functions ◽  
Dirichlet Convolution

An arithmetical function is said to be a totient if it is the Dirichlet convolution between a completely multiplicative function and the inverse of a completely multiplicative function. Euler's phi-function is a famous example of a totient. All completely multiplicative functions are also totients. There is a large number of characterizations of completely multiplicative functions in the literature, while characterizations of totients have not been widely studied in the literature. In this paper we present several arithmetical identities serving as characterizations of totients. We also introduce a new concrete example of a totient.

scholarly journals Correlations of multiplicative functions and applications

2017 ◽  
Vol 153 (8) ◽  
pp. 1622-1657 ◽  
Author(s):  
Oleksiy Klurman
Keyword(s):  
Asymptotic Formula ◽  
Multiplicative Function ◽  
Divided Difference ◽  
Circle Method ◽  
Partial Sums ◽  
Multiplicative Functions ◽  
Image Position ◽  
Bounded Partial Sums

We give an asymptotic formula for correlations $$\begin{eqnarray}\mathop{\sum }_{n\leqslant x}f_{1}(P_{1}(n))f_{2}(P_{2}(n))\cdots f_{m}(P_{m}(n)),\end{eqnarray}$$ where $f,\ldots ,f_{m}$ are bounded ‘pretentious’ multiplicative functions, under certain natural hypotheses. We then deduce several desirable consequences. First, we characterize all multiplicative functions $f:\mathbb{N}\rightarrow \{-1,+1\}$ with bounded partial sums. This answers a question of Erdős from $1957$ in the form conjectured by Tao. Second, we show that if the average of the first divided difference of the multiplicative function is zero, then either $f(n)=n^{s}$ for $\operatorname{Re}(s)<1$ or $|f(n)|$ is small on average. This settles an old conjecture of Kátai. Third, we apply our theorem to count the number of representations of $n=a+b$, where $a,b$ belong to some multiplicative subsets of $\mathbb{N}$. This gives a new ‘circle method-free’ proof of a result of Brüdern.

INDIVIDUAL SURGEON VARIABILITY IS A MULTIPLICATIVE FUNCTION OF SURGICAL TIME

1999 ◽  
Vol 88 (Supplement) ◽  
pp. 48S ◽  
Author(s):  
D.P. Strum ◽  
L.G. Vargas ◽  
A.R. Sampson ◽  
J.H. May
Keyword(s):  
Multiplicative Function ◽  
Surgical Time ◽  
Individual Surgeon

scholarly journals On Primes of the Form 2x-q (where q is a prime less than or equal to x) and the Product of the Distinct Prime Divisors of an Integer (Revised): A Function Approach to Proving the Goldbach Conjecture by Mathematical Induction

2021 ◽  
Author(s):  
Chukwunyere Kamalu
Keyword(s):  
Upper Bound ◽  
Multiplicative Function ◽  
Mathematical Induction ◽  
Function Approach ◽  
Geometric Series ◽  
Prime Divisors ◽  
Goldbach’S Conjecture ◽  
Goldbach's Conjecture

This paper is really an attempt to solve the age-old problem of the Goldbach Conjecture, by restating it in terms of primes of the form 2x-q (where q is a prime less than or equal to x). Restating the problem merely requires us to ask the question: Does a prime of form 2x-q lie in the interval [x, 2x]? We begin by introducing the product, m, of numbers of the form 2x-q. Using the geometric series, an upper bound is estimated for the function m. Next, we prove a theorem that states every even number, 2x, that violates Goldbach’s Conjecture must satisfy an inequality involving a simple multiplicative function defined as the product, ρ(m), of the distinct prime divisors of m. A proof of the Goldbach Conjecture is then evident by contradiction as a corollary to the proof of the inequality.

Sign in / Sign up

Export Citation Format

Share Document