相关论文: A Function in the Number Theory

The prime-counting function $\pi(x)$ which computes the number of primes smaller or equal to a given real number has a long-standing interest in number theory. The present manuscript proposes a method to compute $\pi(x)$ with time…

Let T be a complete, first-order theory in a finite or countable language having infinite models. Let I(T,kappa) be the number of isomorphism types of models of T of cardinality \kappa. We denote by \mu (respectively \hat\mu) the number of…

In this paper we consider the {\it Density Functional Theory} (DFT) framework, where a functional of the form $$F_\eps(\rho)=\eps T(\rho)+bC(\rho)-U(\rho)$$ has to be minimized in the class of non-negative measures $\rho$ which have a…

Andrews' $(k, i)$-singular overpartition function $\overline{C}_{k, i}(n)$ counts the number of overpartitions of $n$ in which no part is divisible by $k$ and only parts $\equiv \pm i\pmod{k}$ may be overlined. In recent times, divisibility…

Using elementary methods we find surprising connections between the values of the Riemann Zeta Function over integers and the fractional parts of rational powers, and a connection between the Riemann Zeta Function and the Prime Zeta…

Let $d$ and $n$ be positive integers such that $d|n$. Let $[n]=\{1,2,\ldots,n\}$ and $T$ be an endofunction on $[n]$. A subset $W$ of $[n]$ of cardinality $n/d$ is said to be $d$-splitting if $W \cup TW \cup \cdots \cup T^{d-1}W =[n]$. Let…

Let $\{p_n\}_{n\ge 1}$ be the sequence of primes and $\vartheta(x) = \sum_{p \leq x} \log p$, where $p$ runs over the primes not exceeding $x$, be the Chebyshev $\vartheta$-function. In this note we derive lower and upper bounds for…

Let $p(n)$ denote the smallest prime divisor of the integer $n$. Define the function $g(k)$ to be the smallest integer $>k+1$ such that $p(\binom{g(k)}{k})>k$. So we have $g(2)=6$ and $g(3)=g(4)=7$. In this paper we present the following…

We shall give an explicit upper bound for the smallest prime factor of multiperfect numbers of the form $N=p_1^{\alpha_1}\cdots p_s^{\alpha_s} q_1^{\beta_1}\cdots q_t^{\beta_t}$ with $\beta_1, \ldots, \beta_t$ bounded by a given constant.…

If $a$ and $d$ are relatively prime, we refer to the set of integers congruent to $a$ mod $d$ as an `eligible' arithmetic progression. A theorem of Dirichlet says that every eligible arithmetic progression contains infinitely many primes;…

We describe a numerical algorithm for evaluating the numbers of roots minus the number of poles contained in a region based on the argument principle with the function of interest being written as a Mellin transformation of a usually…

Let $N$ be a positive integer. We say a non-constant rational function $U(x)\in{\mathbb C}(x)$ is $N$-\emph{unital} if all the zeros and poles of both $U(x)$ and $1-U(x)$ are either 0 or $N$-th roots of unity. These functions are called…

It is known that all modular forms on $SL_2(Z)$ can be expressed as a rational function in $\eta(z)$, $\eta(2z)$ and $\eta(4z)$. By using a theorem by Gordon, Hughes, and Newman, and calculating the order of vanishing, we can compute the…

For every integer $n\ge 1$ let $a_n$ be the smallest positive integer such that $n+a_n$ is prime. We investigate the behavior of the sequence $(a_n)_{n\ge 1}$, and prove asymptotic results for the sums $\sum_{n\le x} a_n$, $\sum_{n\le x}…

Euler's theorem asserts that $A(n)=B(n)$ where $A(n)$ is the number of partitions of $n$ into distinct parts and $B(n)$ is the number of partitions of $n$ into odd parts. In this paper, it is proved that for $n>0$, \begin{align*}…

The generalized number-theoretic transformation (NPT) is formulated on the basis of the exponential function theorem, which allows us to replace operations modulo the expression as a whole by modulo operations on the exponent of this…

Although the study of functional calculus has already established necessary and sufficient conditions for operators to be fractionalized, this paper aims to use our well-conceived notion of integer powers of operators to construct…

Let $\sigma(n)$ be the sum of the positive divisors of $n$, and let $A(t)$ be the natural density of the set of positive integers $n$ satisfying $\sigma(n)/n \ge t$. We give an improved asymptotic result for $\log A(t)$ as $t$ grows…

In this paper a small survey is presented on eighteen new functions and four new sequences, such as: Inferior/Superior f-Part, Fractional f-Part, Complementary function with respect with another function, S-Multiplicative, Primitive…

Let $d_{\alpha, \beta}(n)=\sum\limits_{\substack{n=kl \alpha l<k\leq\beta l}}1$ be the number of ways of factoring n into two almost equal integers. For rational numbers $0<\alpha <\beta $, we consider the following Zeta function…