Related papers: On Nov\'ak numbers

Let $\Omega\subset\mathbb{C}^m$ be a bounded pseudoconvex domain with smooth boundary. For each $k\in\mathbb{N}$, we give a sufficient condition to estimate the $\bar\partial$-Neumann operator in the Sobolev space $W^k(\Omega)$. The key…

Folkman's Theorem asserts that for each $k \in \mathbb{N}$, there exists a natural number $n = F(k)$ such that whenever the elements of $[n]$ are two-coloured, there exists a set $A \subset [n]$ of size $k$ with the property that all the…

We present lower bounds on the sum and product of the distinct prime factors of an odd perfect number, which provide a lower bound on the size of the odd perfect number as a function of the number of its distinct prime factors.

Let $A$ be a subset of integers and let $2\cdot A+k\cdot A=\{2a_1+ka_2 : a_1,a_2\in A\}$. Y. O. Hamidoune and J. Ru\' e proved that if $k$ is an odd prime and $A$ a finite set of integers such that $|A|>8k^k$, then $|2\cdot A+k\cdot A|\ge…

Given a multiplicative function f satisfying |f(n)| <= 1 for all n, the authors study the problem of obtaining explicit upper bounds on the mean-value 1/x |sum_{n <= x} f(n)|.

This paper expands and improves on the general Sieve method. This expaned and improved Sieve is applied to Goldbach's problem. A new estimate of the exception set in Goldbach's number E(X), an improved lower bound D_{1,2}(N) and upper bound…

We prove that for each odd number k, the sequence (k2^n+1)_{n\ge 1} contains only a finite number of Carmichael numbers. We also prove that k=27 is the smallest value for which such a sequence contains some Carmichael number.

For $k\ge1$, let $R_k(x)$ denote the reciprocal sum up to $x$ of numbers with $k$ prime factors, counted with multiplicity. In prior work, the authors obtained estimates for $R_k(x)$, extending Mertens' second theorem, as well as a…

Let $\mathcal{P}=\{p_1,p_2,...\}$ be the set of all odd primes arranged in increasing order. A Goldbach partition of the even integer $2k>4$ is a way of writing it as a sum of two primes from $\mathcal{P}$ without regard to order. Let…

Formula for the nth prime using elementary arithmetical functions based in a previous formula changing the characteristic function of prime numbers.

We give a new lower bound for the essential minimum of subvarieties of abelian varieties with small codimension, under a conjecture about ordinary primes in abelian varieties. This lower bound is already known in the toric case since the…

We show that for every $r \geq 1$, and all $r$ distinct (sufficiently large) primes $p_1,..., p_r > p_0(r)$, there exist infinitely many integers $n$ such that ${2n \choose n}$ is divisible by these primes to only low multiplicity. From a…

We prove the lower bound for the number of Lucas non-Wieferich primes in arithmetic progressions. More precisely, for any given integer $k\geq 2$ there are $\gg \log x$ Lucas non-Wieferich primes $p\leq x$ such that $p\equiv\pm1\pmod{k}$,…

The Erdos-Kac theorem, a foundational result in probabilistic number theory, states that the number of prime factors of an integer follows a Gaussian distribution. In this paper we develop and analyze probabilistic models for "random…

Let $\omega(n)$ denote the number of distinct prime factors of $n$. Then for any given $K\geq 2$, small $\epsilon>0$ and sufficiently large (only depending on $K$ and $\epsilon$) $x$, there exist at least $x^{1-\epsilon}$ integers…

We establish lower bounds for all weighted even moments of primes up to $X$ in intervals which are in agreement with a conjecture of Montgomery and Soundararajan. Our bounds hold unconditionally for an unbounded set of values of $X$, and…

The author sharpens a result of Jia (1996), showing that the interval $[n, n+n^{\frac{1}{21.5}+\varepsilon}]$ contains prime numbers for almost all $n$. Watt's mean value bound, a delicate sieve decomposition and more accurate estimates for…

We obtain new lower and upper bounds for probabilities of unions of events.These bounds are sharp. They are stronger than earlier ones. General bounds maybe applied in arbitrary measurable spaces.We have improved the method that has been…

In the present work we investigate the largest possible gaps between consecutive numbers which can be written as the difference of two primes. The best known upper bounds are the same as those concerning the largest possible difference of…

We give some new relations for Newman digit sums respectively different modulos and put some problems. In particular, for the odd prime modulos we put an important conjecture.