English
Related papers

Related papers: Primes in floor function sets

200 papers

Let $f$ be an arithmetic function satisfying some simple conditions. The aim of this paper is to establish an asymptotical formula for the quantity \[ S_f(x):=\sum_{n\leq x}\frac{f([x/n])}{[x/n]} \] as $x\rightarrow\infty$, where $[t]$ is…

Number Theory · Mathematics 2023-03-02 Jing Ma , Ronghui Wu

Given positive integers $a_1,\ldots,a_k$, we prove that the set of primes $p$ such that $p \not\equiv 1 \bmod{a_i}$ for $i=1,\ldots,k$ admits asymptotic density relative to the set of all primes which is at least $\prod_{i=1}^k…

Number Theory · Mathematics 2020-12-15 Paolo Leonetti , Carlo Sanna

We study the distribution of palindromic numbers (with respect to a fixed base $g\ge 2$) over certain congruence classes, and we derive a nontrivial upper bound for the number of prime palindromes $n\le x$ as $x\to\infty$. Our results show…

Number Theory · Mathematics 2007-05-23 William D. Banks , Derrick N. Hart , Mayumi Sakata

In this paper we obtain asymptotic expansion for the geometric mean of the values of positive strongly multiplicative function $f$ satisfying $f(p)=\alpha(d)\,p^d+O(p^{d-\delta})$ for any prime $p$ with $d$ real and $\alpha(d),\delta>0$.

Number Theory · Mathematics 2023-06-22 Mehdi Hassani , Mohammadreza Esfandiari

In this paper we discuss a method to express the Prime counting function as a "sum" over Non-trivial zeros of Riemann Zeta function, using techniques from Analytic Number Theory, also we apply our results to the sum over primes of any…

General Mathematics · Mathematics 2007-05-23 Jose Javier Garcia Moreta

Applying the enumeration of sparse set partitions, we show that the number of set systems H such that the emptyset is not in H, the total cardinality of edges in H is n, and the vertex set of H is {1, 2, ..., m}, equals (1/log(2)+o(1))^nb_n…

Combinatorics · Mathematics 2007-05-23 Martin Klazar

Let $ x\geq 1 $ be a large number, let $ [x]=x-\{x\} $ be the largest integer function, and let $ \sigma(n)$ be the sum of divisors function. This note presents the first proof of the asymptotic formula for the average order $ \sum_{p\leq…

General Mathematics · Mathematics 2021-07-05 N. A. Carella

In this paper we show that certain sets are dense in $\mathbb{R}$. We give some applications. For example, we show an analytical proof that $q^{\frac{1}{n}}$, $q$ is a prime number and $e$; are irrational numbers. As another application we…

Classical Analysis and ODEs · Mathematics 2016-03-21 Manas R. Sahoo

Prime numbers are one of the most intriguing figures in mathematics. Despite centuries of research, many questions remain still unsolved. In recent years, computer simulations are playing a fundamental role in the study of an immense…

History and Overview · Mathematics 2020-02-04 Alberto Fraile , Roberto Martinez , Daniel Fernandez

Let $p>5$ be a fixed prime. We obtain an asymptotic formula related to small solutions of quadratic congruences of the form $x_1^2+x_2^2\equiv x_3^2\bmod{p^n}$ where $\max\{|x_1|,|x_2|,|x_3|\}\le p^{\nu n}$ with $\nu>1/2$.

Number Theory · Mathematics 2022-01-19 Stephan Baier , Anup Haldar

In this note we describe a method for finding prime numbers as fixed points of particularly simple sequences. Some basic calculations show that success rates for identifying primes this way are over 99.9%. In particular, it seems that the…

Number Theory · Mathematics 2019-07-24 Enrique Navarrete , Daniel Orellana

Let $f(n)$ and $g(n)$ be the number of unordered and ordered factorizations of $n$ into integers larger than one. Let $F(n)$ and $G(n)$ have the additional restriction that the factors are coprime. We establish the asymptotic bounds for the…

Number Theory · Mathematics 2021-02-02 Matthew Just , Noah Lebowitz-Lockard

Let $F_1,\ldots,F_R$ be homogeneous polynomials of degree $d\ge 2$ with integer coefficients in $n$ variables, and let $\mathbf{F}=(F_1,\ldots,F_R)$. Suppose that $F_1,\ldots,F_R$ is a non-singular system and $n\ge 4^{d+2}d^2R^5$. We prove…

Number Theory · Mathematics 2021-05-28 Jianya Liu , Lilu Zhao

We are interested in classifying those sets of primes $\mathcal{P}$ such that when we sieve out the integers up to $x$ by the primes in $\mathcal{P}^c$ we are left with roughly the expected number of unsieved integers. In particular, we…

Number Theory · Mathematics 2015-11-03 Andrew Granville , Dimitris Koukoulopoulos , Kaisa Matomäki

We study the number of prime polynomials of degree $n$ over $\mathbb{F}_q$ in which the $i^{th}$ coefficient is either preassigned to be $a_i \in \mathbb{F}_q$ or outside a small set $S_i \subset \mathbb{F}_q$. This serves as a function…

Number Theory · Mathematics 2017-12-13 Eyal Moses

Let $F \in \mathbb{Z}[x_1, \ldots, x_n]$ be a homogeneous form of degree $d \geq 2$, and let $V_F^*$ denote the singular locus of the affine variety $V(F) = \{ \mathbf{z} \in {\mathbb{C}}^n: F(\mathbf{z}) = 0 \}$. In this paper, we prove…

Number Theory · Mathematics 2021-05-27 Shuntaro Yamagishi

We prove an asymptotic formula for the number of integers $\leq x$ which can be written as the product of $k ~(\geq 2)$ distinct primes $p_1\cdots p_k$ with each prime factor in an arithmetic progression $p_j\equiv a_j \bmod q$, $(a_j,…

Number Theory · Mathematics 2018-02-21 Xianchang Meng

We prove a prime geodesic theorem for compact quotients of affine buildings and apply it to get class number asymptotics for global fields of positive characteristic.

Number Theory · Mathematics 2016-09-14 Anton Deitmar , Rupert McCallum

A new set of formulas for primes is presented. These formulas are more efficient and grow much slower than the two known formulas of Mills and Wright. 3 new formulas are explained.

Number Theory · Mathematics 2022-04-08 Simon Plouffe

Motivated by recent results, we study sums of the form $S_f(x) = \sum_{n\leq x} f\left(\left\lfloor\frac{x}{n}\right\rfloor \right)$, where $f$ is an arithmetic function and $\left\lfloor\cdot\right\rfloor$ denotes the greatest integer…

Number Theory · Mathematics 2021-06-29 Joshua Stucky
‹ Prev 1 8 9 10 Next ›