Results 21 to 30 of about 594 (43)
Note on sums involving the Euler function
In this note, we provide refined estimates of the following sums involving the Euler totient function: $$\sum_{n\le x} \phi\left(\left[\frac{x}{n}\right]\right) \qquad \text{and} \qquad \sum_{n\le x} \frac{\phi([x/n])}{[x/n]}$$ where $[x]$ denotes the ...
Chern, Shane
core +1 more source
On characterizing potential friends of 20
Does 20 have a friend? Or is it a solitary number? A folklore conjecture asserts that 20 has no friends, i.e., it is a solitary number. In this article, we prove that a friend N of 20 is of the form N = 2 · 52a ·m2, with (3;m) = (7;m) = 1 and it has at ...
Chatterjee Tapas +2 more
doaj +1 more source
On the proximity of large primes
By a sphere-packing argument, we show that there are infinitely many pairs of primes that are close to each other for some metrics on the integers. In particular, for any numeration basis $q$, we show that there are infinitely many pairs of primes the ...
Luca, Florian +2 more
core +2 more sources
An identity for a class of arithmetical functions of several variables
International Journal of Mathematics and Mathematical Sciences, Volume 16, Issue 2, Page 355-358, 1993.
Pentti Haukkanen
wiley +1 more source
Binomial convolution sum of divisor functions associated with Dirichlet character modulo 8
In this article, we compute binomial convolution sums of divisor functions associated with the Dirichlet character modulo 8, which is the remaining primitive Dirichlet character modulo powers of 2 yet to be considered.
Jin Seokho, Park Ho
doaj +1 more source
Dirichlet summations and products over primes
International Journal of Mathematics and Mathematical Sciences, Volume 16, Issue 2, Page 359-372, 1993.
Geoffrey B. Campbell
wiley +1 more source
Arithmetic functions associated with infinitary divisors of an integer
International Journal of Mathematics and Mathematical Sciences, Volume 16, Issue 2, Page 373-383, 1993.
Graeme L. Cohen, Peter Hagis
wiley +1 more source
A note on Deaconescu’s conjecture
Hasanalizade [5] studied Deaconescu’s conjecture for positive composite integer n. A positive composite integer n ≥ 4 is said to be a Deaconescu number if S2(n) | ϕ(n) − 1.
Mandal Sagar
doaj +1 more source
Extreme values of the Dedekind $\Psi$ function
Let $\Psi(n):=n\prod_{p | n}(1+\frac{1}{p})$ denote the Dedekind $\Psi$ function. Define, for $n\ge 3,$ the ratio $R(n):=\frac{\Psi(n)}{n\log\log n}.$ We prove unconditionally that $R(n)< e^\gamma$ for $n\ge 31.$ Let $N_n=2...p_n$ be the primorial of ...
Planat, Michel, Solé, Patrick
core +1 more source
Realizability of integer sequences as differences of fixed point count sequences
A sequence of non-negative integers is exactly realizable as the fixed point counts sequence of a dynamical system if and only if it gives rise to a sequence of non-negative orbit counts.
Neumaerker, Natascha
core +1 more source

