English
Related papers

Related papers: On certain large additive functions

200 papers

A study of certain Hamiltonian systems has lead Y. Long to conjecture the existence of infinitely many primes of the form $p=2[\alpha n]+1$, where $1<\alpha<2$ is a fixed irrational number. An argument of P. Ribenboim coupled with classical…

Number Theory · Mathematics 2007-08-09 William D. Banks , Igor E. Shparlinski

Some calculations in supersymmetric theories, made with the higher derivative regularization, show that the beta-function is given by integrals of total derivatives. This is qualitatively explained for the N=1 supersymmetric electrodynamics…

High Energy Physics - Theory · Physics 2015-05-27 K. V. Stepanyantz

Define {\em the Liouville function for $A$}, a subset of the primes $P$, by $\lambda_{A}(n) =(-1)^{\Omega_A(n)}$ where $\Omega_A(n)$ is the number of prime factors of $n$ coming from $A$ counting multiplicity. For the traditional Liouville…

Number Theory · Mathematics 2008-09-11 Peter Borwein , Stephen K. K. Choi , Michael Coons

Let A=(a_(ij)) be the generic n by n circulant matrix given by a_(ij)=x_(i+j), with subscripts on x interpreted mod n. Define d(n) (resp. p(n)) to be the number of terms in the determinant (resp. permanent) of A. The function p(n) is…

Combinatorics · Mathematics 2007-05-23 Hugh Thomas

We present a function that tests for primality, factorizes composites and builds a closed form expression of $\pi(n^2)$ in terms of $\sum_{3 \leq p \leq n} \frac{1}{p}$ and a weaker version of $\omega(n)$.

General Mathematics · Mathematics 2017-01-23 Madieyna Diouf

Write $\mathrm{ord}_p(\cdot)$ for the multiplicative order in $\mathbb{F}_p^{\times}$. Recently, Matthew Just and the second author investigated the problem of classifying pairs $\alpha, \beta \in \mathbb{Q}^{\times}\setminus\{\pm 1\}$ for…

Number Theory · Mathematics 2021-09-01 Sergei Konyagin , Paul Pollack

It is well known that $\sum_{p\le n} 1/p =\ln(\ln(n)) + O(1)$ where $p$ goes over the primes. We give several known proofs of this. We first present a a proof that $\ge \ln(\ln(n)) + O(1)$. This is based on Euler's proof that $\sum_p 1/p$…

History and Overview · Mathematics 2015-11-17 William Gasarch , Larry Washington

In the article, a notion "logarithmically absolutely monotonic function" is introduced, an inclusion that a logarithmically absolutely monotonic function is also absolutely monotonic is revealed, the logarithmically complete monotonicity…

Classical Analysis and ODEs · Mathematics 2010-08-20 Feng Qi , Bai-Ni Guo

Let $P(m)$ denote the largest prime factor of an integer $m\geq 2$, and put $P(0)=P(1)=1$. For an integer $k\geq 2$, let $(F_{n}^{(k)})_{n\geq 2-k}$ be the $k-$generalized Fibonacci sequence which starts with $0,...,0,1$ ($k$ terms) and…

Number Theory · Mathematics 2012-10-16 Jhon J. Bravo , Florian Luca

Let P(k) be the largest prime factor of the positive integer k. In this paper, we prove that the series $\sum_{n\ge 1}\frac{(\log n)^a}{P(2^n-1)}$ is convergent for each constant a<1/2, which gives a more precise form of a result of C. L.…

Number Theory · Mathematics 2009-06-18 Kevin Ford , Florian Luca , Igor E. Shparlinski

We calculate some infinite sums containing the digamma function in closed-form. These sums are related either to the incomplete beta function or to the Bessel functions. The calculations yield interesting new results as by-products, such as…

Classical Analysis and ODEs · Mathematics 2023-04-28 Juan L. González-Santander , Fernando Sánchez Lasheras

We study the concentration of the distribution of an additive function, when the sequence of prime values of $f$ decays fast and has good spacing properties. In particular, we prove a conjecture by Erdos and Katai on the concentration of…

Number Theory · Mathematics 2017-06-12 Dimitris Koukoulopoulos

We prove that if two additive functions (from a certain class) take large values with roughly the same probability then they must be identical. The Kac-Kubilius model suggests that the distribution of values of a given additive function can…

Number Theory · Mathematics 2011-09-02 Maksym Radziwill

The paper considers the problem of finding the largest possible set P(n), a subset of the set N of the natural numbers, with the property that a number is in P(n) if and only if it is a sum of n distinct naturals all in P(n) or none in…

Discrete Mathematics · Computer Science 2008-09-18 Bidu Prakash Das , Soubhik Chakraborty

Let $n$ be a positive integer and $\alpha_n$ be the arithmetic function which assigns the multiplicative order of $a^n$ modulo $n$ to every integer $a$ coprime to $n$ and vanishes elsewhere. Similarly, let $\beta_n$ assign the projective…

Number Theory · Mathematics 2016-03-24 Jonathan Chappelon

In this article, we consider the weighted partition function $p_f(n)$ given by the generating series $\sum_{n=1}^{\infty} p_f(n)z^n = \prod_{n\in\mathbb{N}^{*}}(1-z^n)^{-f(n)}$, where we restrict the class of weight functions to strongly…

Number Theory · Mathematics 2024-12-31 Madhuparna Das

We introduce functions for relative maximization in a general context: the beta and alpha applications. After a systematic study concerning regularities, we investigate how to approximate certain values of these functions using periodic…

Dynamical Systems · Mathematics 2007-05-23 Eduardo Garibaldi , Artur O. Lopes

We consider several families of binomial sum identities whose definition involves the absolute value function. In particular, we consider centered double sums of the form \[S_{\alpha,\beta}(n) :=…

Combinatorics · Mathematics 2016-05-26 Richard P. Brent , Hideyuki Ohtsuka , Judy-anne H. Osborn , Helmut Prodinger

We present the first fixed-length elementary closed-form expressions for the prime-counting function, $\pi(n)$, and the $n$-th prime number, $p(n)$. These expressions are arithmetic terms, requiring only a finite and fixed number of…

Number Theory · Mathematics 2025-08-05 Mihai Prunescu , Joseph M. Shunia

For a positive integer $n$ let $\mathfrak{P}_n=\prod_{s_p(n)\ge p} p,$ where $p$ runs over all primes and $s_p(n)$ is the sum of the base $p$ digits of $n$. For all $n$ we prove that $\mathfrak{P}_n$ is divisible by all "small" primes with…

Number Theory · Mathematics 2018-04-25 Olivier Bordellès , Florian Luca , Pieter Moree , Igor E. Shparlinski