相关论文: A Function in the Number Theory

For a non-integral real number $c>1$, let $\mathbb{N}_{(c)}:=\{\lfloor n^c\rfloor ~|~ n\in\mathbb{N}\}$. We show that $\mathbb{N}_{(c)}$ contains thin subbases of every order $h\geq 5$ when $1<c<2$, and $h\geq (\lfloor 2c\rfloor+1)(\lfloor…

Let $q$ be a power of a prime $p$, and let $V$ be an $n$-dimensional space over the field GF$(q)$. A $Z_p$-valued function $C$ on the set of $k$-dimensional subspaces of $V$ is called a $k$-uniform $Z_p$-null design of strength $t$ if for…

Euler's totient function, $\varphi(n)$, which counts how many of $0,1,\dots,n-1$ are coprime to $n$, has an explicit asymptotic lower bound of $n/\log \log n$, modulo some constant. In this note, we generalise $\varphi$; given an…

We introduce a non-linear criterion which allows us to determine when a function can be written as a sum of functions belonging to homogeneous fractional spaces: for $\ell \in \mathbb{N}^*$, $s_i\in (0, 1)$ and $p_i \in [1, +\infty)$, $u :…

The generating function of partitions with repeated (resp. distinct) parts such that each odd part is less than twice the smallest part is shown to be the third order mock theta function $\omega(q)$ (resp. $\nu(-q)$). Similar results for…

In this article, with a new approach, which is not discussed in the literature yet, the limit of the Riemann zeta function or Euler-Riemann zeta function is approximately explored by applying Dirichlet's rearrangement theorem for absolutely…

In this paper, a new formula for {\pi}^(2)(N) is formulated, it is a function that counts the number of semi-primes not exceeding a given number N. A semi-prime is a natural number that is the product of precisely two prime numbers, the two…

Fix a positive real number $\theta$. The natural numbers $m$ with largest square-free divisor not exceeding $m^\theta$ form a set $\mathscr{A}$, say. It is shown that whenever $\theta>1/2$ then all large natural numbers $n$ are the sum of…

In this short survey we give a description of the theta functions of algebraic curves, half-integer theta-nulls, and the fundamental theta functions. We describe how to determine such fundamental theta functions and describe the components…

The integer $d=\prod_{i=1}^s p_i^{b_i}$ is called an exponential divisor of $n=\prod_{i=1}^s p_i^{a_i}>1$ if $b_i \mid a_i$ for every $i\in \{1,2,...,s\}$. Let $\tau^{(e)}(n)$ denote the number of exponential divisors of $n$, where…

Let $Z(t)$ be the classical Hardy function in the theory of the Riemann zeta-function. The main result in this paper is that if the Riemann hypothesis is true then for any positive integer $n$ there exists a $t_{n}>0$ such that for…

In this paper, we study various classes of partition functions such as those related to the parity of the number of parts, to differences of partition numbers, and to partitions with a repeated smallest part. We establish identities…

The non-trivial zeros of the Riemann zeta function and the prime numbers can be plotted by a modified von Mangoldt function. The series of non-trivial zeta zeros and prime numbers can be given explicitly by superposition of harmonic waves.…

Let $m$ be a positive integer, and define $$\zeta_m(s)=\sum_{n=1}^\infty\frac{(-e^{2\pi i/m})^{\omega(n)}}{n^s}\ \ \ \ \text{and} \ \ \ \ \zeta^*_m(s)=\sum_{n=1}^\infty\frac{(-e^{2\pi i/m})^{\Omega(n)}}{n^s},$$ for $\Re(s)>1$, where…

For a fixed $\theta\neq 0$, we define the twisted divisor function $$ \tau(n, \theta):=\sum_{d\mid n}d^{i\theta}\ .$$ In this article we consider the error term $\Delta(x)$ in the following asymptotic formula $$ \sum_{n\leq x}^*|\tau(n,…

Let A be a nonempty finite set of relatively prime positive integers, and let p_A(n) denote the number of partitions of n with parts in A. An elementary arithmetic argument is used to obtain an asymptotic formula for p_A(n).

For $x\ge0$ let $\pi(x)$ be the number of primes not exceeding $x$. The asymptotic behaviors of the prime-counting function $\pi(x)$ and the $n$-th prime $p_n$ have been studied intensively in analytic number theory. Surprisingly, we find…

Ron Graham introduced a function, $g(n)$, on the non-negative integers, in the 1986 Issue $3$ Problems column of \textit{Mathematical Magazine}: For each non-negative integer $n$, $g(n)$ is the least integer $s$ so that the integers $n + 1,…

The number of parts in the partitions (resp. distinct partitions) of $n$ with parts from a set were considered. Its generating functions were obtained. Consequently, we derive several recurrence identities for the following functions: the…

Let $N$ be a positive integer and let $S_N$ be the set of polynomials with integer coefficients, degree less than $N$, and minimal positive integral over $[0,1]$. D. Bazzanella initiated the study of $S_N$ because of its relation to the…