Related papers: A Dedekind Psi Function Inequality

A study of the Dedekind psi function concludes that its extreme values are supported on the subset of primorial integers N_k = 2*3***p_k, where p_k is the kth prime. In particular, the inequality psi(N_k) > cloglogN_k, c > 0 constant, holds…

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…

Let $\mathcal{P}$ be the set of all primes and $\psi(n)=n\prod_{n\in \mathcal{P},p|n}(1+1/p)$ be the Dedekind psi function. We show that the Riemann hypothesis is satisfied if and only if $f(n)=\psi(n)/n-e^{\gamma} \log \log n <0$ for all…

Given a number field $K$ of degree $n_K$ and with absolute discriminant $d_K$, we obtain an explicit bound for the number $N_K(T)$ of non-trivial zeros (counted with multiplicity), with height at most $T$, of the Dedekind zeta function…

Let $ x\geq 1 $ be a large number, let $ [x]=x-\{x\} $ be the largest integer function, and let $ \varphi(n)$ be the Euler totient function. The result $ \sum_{n\leq x}\varphi([x/n])=(6/\pi^2)x\log x+O\left ( x(\log x)^{2/3}(\log\log…

Let $\psi$ denote the Dedekind totient function defined by $ \psi(n)=\sum_{d|n}d\mu^2\l({n}/{d}\r) $ with $\mu$ being the M\"{o}bius function. We shall consider the $k$-th Riesz mean of the arithmetical function $n/\psi(n)$ for any…

Let $k \ge 2$ be an integer and consider the $k$-generalized Pell sequence $\{P_n^{(k)}\}_{n \ge 2-k}$, defined by the initial values $0, \ldots, 0, 0, 1$ (a total of $k$ terms), and the recurrence $P_n^{(k)} = 2P_{n-1}^{(k)} +…

For a positive integer $k$, let \[ \sigma_k(n)=\sum_{d\mid n} d^k \] be the divisor function of order $k$, and let $\nu_p(m)$ denote the $p$-adic valuation of an integer $m$. Motivated by recent work on the $p$-adic valuation of…

Recall that an integer is $t-$free iff it is not divisible by $p^t$ for some prime $p.$ We give a method to check Robin inequality $\sigma(n) < e^\gamma n\log\log n,$ for $t-$free integers $n$ and apply it for $t=6,7.$ We introduce…

The Dickman function F(alpha) gives the asymptotic probability that a large integer N has no prime divisor exceeding N^alpha. It is given by a finite sum of generalized polylogarithms defined by the exquisite recursion L_k(alpha)=-…

For n=1,2,3,... let p_n be the n-th prime. We mainly show that p_n>n+sum_{k=1}^n p_k/k for all n>124, and sum_{k=1}^n kp_k<n^2p_n/3 for all n>30.

Let $p_{k}$ denote the $k$-th prime and $d(p_{k}) = p_{k} - p_{k - 1}$, the difference between consecutive primes. We denote by $N_{\epsilon}(x)$ the number of primes $\leq x$ which satisfy the inequality $d(p_{k}) \leq (\log p_{k})^{2 +…

We consider the Diophantine inequality \[ \left| p_1^{c} + p_2^{c} + p_3^c- N \right| < (\log N)^{-E} , \] where $1 < c < \frac{15}{14}$, $N$ is a sufficiently large real number and $E>0$ is an arbitrarily large constant. We prove that the…

For any $\sigma$ with $0\leq \sigma\leq 1$ and any $T>10$ sufficiently large, let $N_{\zeta}(\sigma,K,T)$ be the number of zeros $\rho=\beta+i\gamma$ of $\zeta_{K}(s)$ with $|\gamma|\leq T$ and $\beta\geq \sigma$ and the zero being counted…

Acquaah and Konyagin showed that if $N$ is an odd perfect number where $N= p_1^{a_1}p_2^{a_2} \cdots p_k^{a_k}$ where $p_1 < p_2 \cdots < p_k$ then one must have $p_k < 3^{1/3}N^{1/3}$. Using methods similar to theirs, we show that…

We study generalizations of some results of Jean-Louis Nicolas regarding the relation between small values of Euler's function $\varphi(n)$ and the Riemann Hypothesis. Among other things, we prove that for $1\leq q\leq 10$ and for $q=12,…

By employing the assessment of the asymptotic size of various sums of G\'{a}l studied by La Bret\`eche and Tenenbaum, we provide an improvement on the recent result of A. Bondarenko, P. Darbar, M. V. Hagen, W. Heap, and K. Seip regarding…

Let $I(n) = \frac{\psi(\phi(n))}{\phi(\psi(n))}$ and $K(n) = \frac{\psi(\phi(n))}{\phi(\phi(n))}$, where $\phi(n)$ is Euler's function and $\psi(n)$ is Dedekind's arithmetic function. We obtain the maximal order of $I(n)$, as well as the…

Let $\varphi(n)$ denote the Euler totient function. In this paper, we first establish a new upper bound for $n/\varphi(n)$ involving $K(n)$, the function that counts the number of primorials not exceeding $n$. In particular, this leads to…

Let $k \ge 2$ be a fixed integer. We define the multiplicative function $D_k(n) = d_k(n)/d_k^*(n)$, such that $d_k(n)$ is the Piltz divisor function and $d_k^*(n) = k^{\omega(n)}$ is its unitary analogue, where $\omega(n)$ is the number of…