相关论文: On the greatest prime factor of ab+1

We prove that for integers a>b>c>0, the greatest prime factor of (ab+1)(ac+1) tends to infinity with a.

We estimate from below the lower density of the set of prime numbers p such that p-1 has a prime factor of size at least p^c, where c lies in between 1/4 and 1/2. We also establish upper and lower bounds on the counting function of the set…

In this paper, we state a conjecture on the prime factorization of numbers of the form $n!+1$, explore its implications, and compare it with empirical evidence and established results based on the $abc$ conjecture.

In this paper, we find all integers $x$ such that $x^{2}-1$ has only prime factors smaller than 100. This gives some interesting numerical corollaries. For example, for any positive integer $n$ we can find the largest positive integer $x$…

Let $x$ denote a sufficiently large integer. We show that the recent result of Grimmelt and Merikoski actually yields the largest prime factor of $n^2 +1$ is greater than $x^{1.317}$ infinitely often. As an application, we give a new upper…

Let $a_0=b_0=0$ and $0<a_1\leq b_1<a_2\leq b_2<\ldots\leq b_{n}$ be integers. Let $Q\left(x;\bigcup_{j=1}^{n}[a_j,b_j]\right)$ be the number of integers between $1$ and $x$ such that all exponents in their prime factorization are in…

If $a>b$ and $n>1$ are positive integers and $a$ and $b$ are relatively prime integers, then a large Zsigmondy prime for $(a,b,n)$ is a prime $p$ such that $p \,|\, a^n-b^n$ but $p \,\nmid \, a^m-b^m$ for $1 \leq m < n$ and either $p^2 \, |…

We give estimates from below for the greatest prime factor of the n-th term of a binary recurrence sequence.

Let $P^+(n)$ denote the largest prime factor of the integer $n$ and $P_y^+(n)$ denote the largest prime factor $p$ of $n$ which satisfies $p\leqslant y$. In this paper, firstly we show that the triple consecutive integers with the two…

The number of primes of a kind x^2+1 is infinite.

Let $f(n)=\min_{p} |n-p|$, where $p$ is a prime. We show that there is a positive constant $\delta$ such that for any large integer $N$ there exist two positive integers $n_1$ and $n_2$ such that $N=n_1 + n_2$ and $f(n_i)\gg \ln N (\ln\ln…

A natural number $n$ is called semi-prime if it is a product of two primes or a square of a prime. We denote $\mathbb{P}_2$ the set of all semi-primes. Our goal is to prove that for fixed integer number $a$ and sufficiently large $x$ the…

We consider the representation of primes as a sum of a prime and twice a triangular number. We prove that a subset of the primes having density 1 is expressible in this form. We conjecture that every odd prime number is expressible as a sum…

We show that the difference between consecutive terms in sequences of integers whose greatest prime factor grows slowly tends to infinity.

Let N be a large enough natural number, A and B be subsets of {N+1, ... , 2N}. In this paper, we prove that there exists integers a, b with a belongs to A, b belongs to B such that ab=P_k^2 + O(P_k^{1-c}), where 0<c<1/2 and P_k denotes an…

Let P(n) denote the largest prime factor of $n \ge 2, P(1) = 1$, and let $$ \beta(n) = \sum_{p|n}p, \Beta(n) = \sum_{p^\alpha||n}\alpha p, \Beta_1(n) = \sum_{\p^\alpha||n}p^\alpha $$ denote "large" additive functions. A survey of results on…

Let $x>1$ be a large number. This note shows that the largest prime factor of the quadratic product $\prod_{x\leq n\leq 2x}\left(n^2+1 \right)$ satisfies the relation $p \geq x^{3/2}$ as $x$ tends to infinity. This improves the current…

For a subset A of a field F, write A(A + 1) for the set {a(b + 1):a,b\in A}. We establish new estimates on the size of A(A+1) in the case where F is either a finite field of prime order, or the real line. In the finite field case we show…

We consider the distribution of the largest prime divisor of the integers in the interval $[2,x]$, and investigate in particular the mode of this distribution, the prime number(s) which show up most often in this list. In addition to giving…

We show that there exist infinite sets $A = \{a_1,a_2,\dots\}$ and $B = \{b_1,b_2,\dots\}$ of natural numbers such that $a_i+b_j$ is prime whenever $1 \leq i < j$.