相关论文: A Function in the Number Theory

Let $a > 1$. Then $a^n < n!$ for some positive integer $n$. We show that the smallest such $n$ is one of a pair of possibilities, or is one possibility, which we show how to calculate. There are three interesting numerical sequences which…

This research presents the results of a study on the existence and frequency distribution of the shell primes defined herein as prime numbers that result from the calculation of the "half-shell" of an p-dimensional entity of the form…

Every Euclidean domain $R$ has a minimal Euclidean function, $\phi_R$. A companion paper \cite{Graves} introduced a formula to compute $\phi_{\mathbb{Z}[i]}$. It is the first formula for a minimal Euclidean function for the ring of integers…

We establish formulas for the number of all downsets (or equivalently, of all antichains) of a finite poset P. Then, using these numbers, we determine recursively and explicitly the number of all posets having a fixed set of minimal points…

The least $r$-gap, $g_r(\lambda)$, of a partition $\lambda$ is the smallest part of $\lambda$ appearing less than $r$ times. In this article we introduce two new partition functions involving least $r$-gaps. We consider a bisection of a…

We study the function $\Theta(x,y,z)$ that counts the number of positive integers $n\le x$ which have a divisor $d>z$ with the property that $p\le y$ for every prime $p$ dividing $d$. We also indicate some cryptographic applications of our…

An elementary approach for computing the values at negative integers of the Riemann zeta function is presented. The approach is based on a new method for ordering the integers and a new method for summation of divergent series. We show that…

By considering the prime zeta function, the author intended to demonstrate in that the Riemann zeta function zeta(s) does not vanish for Re(s)>1/2, which would have proven the Riemann hypothesis. However, he later realised that the proof of…

We construct a two-parameter complex function $\eta_{\kappa \nu}:\mathbb{C}\to \mathbb{C}$, $\kappa \in (0, \infty)$, $\nu\in (0,\infty)$ that we call a holomorphic nonlinear embedding and that is given by a double series which is…

The divisor function $\sigma(n)$ denotes the sum of the divisors of the positive integer $n$. For a prime $p$ and $m \in \mathbb{N}$, the $p$-adic valuation of $m$ is the highest power of $p$ which divides $m$. Formulas for…

We will see that key concepts of number theory can be defined for arbitrary operations. We give a generalized distributivity for hyperoperations (usual arithmetic operations and operations going beyond exponentiation) and a generalization…

Let $a(1) >0$, $a(n) \ge 0$ for $n \ge 2$ and $a(n) = O(n^\varepsilon)$ for any $\varepsilon >0$, and put $Z(\sigma + it):= \sum_{n=1}^\infty a(n) n^{-\sigma - it}$ where $\sigma , t \in {\mathbb{R}}$. In the present paper, we show that any…

A simple and elementary derivation of values at integer points for the Riemann's zeta and related functions is reported.

Let p be any prime, and $p^(\nu_p(n!))$ the maximal power of $p$ dividing $n!$. It is proved that there exists a positive integer $n_0$, which depends only on $p$, such that $q^(\nu_q(n!)) < p^(\nu_p(n!))$ for all $n \ge n_0$ and all primes…

We study the minimal gap statistic for fractional parts of sequences of the form $\mathcal A^\alpha = \{\alpha a(n)\}$ where $\mathcal A = \{a(n)\}$ is a sequence of distinct of integers. Assuming that the additive energy of the sequence is…

We intimate deeper connections between the Riemann zeta and gamma functions than often reported and further derive a new formula for expressing the value of $\zeta(2n+1)$ in terms of zeta at other fractional points. This paper also…

In this paper we give effective estimates for some classical arithmetic functions defined over prime numbers. First we find the smallest real number $x_0$ so that some inequality involving Chebyshev's $\vartheta$-function holds for every $x…

We prove that there are infinitely many integers $n$ such that $n$ and $n+1$ have the same number of distinct prime divisors.

A power series being given as the solution of a linear differential equation with appropriate initial conditions, minimization consists in finding a non-trivial linear differential equation of minimal order having this power series as a…

The theorem below gives another way of computing the distribution prime counting function without using recursion and the values of Prime numbers