Related papers: Applications of the abc conjecture to powerful num…

We prove that the frequency of abc equations c^n = a+b satisfying the strong abc - conjecture is phi(c^n)/2+o(phi(c^n)/2), for n going to infinity.

For $n \geq 3,$ let $ p_n $ denote the $n^{\rm th}$ prime number. Let $[ \; ]$ denote the floor or greatest integer function. For a positive integer $m,$ let $\pi_2(m)$ denote the number of twin primes not exceeding $m.$ The twin prime…

The conjecture of Masser-Oesterl\'e, popularly known as $abc$-conjecture have many consequences. We use an explicit version due to Baker to solve a number of conjectures.

The Collatz and $abc$ conjectures, both well known and thoroughly studied, appear to be largely unrelated at first sight. We show that assuming the $abc$ conjecture true is helpful to improve the lower bound of integers initiating a…

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.

This article seeks to encourage a mathematical dialog regarding a possible solution to Beals Conjecture. It breaks down one of the worlds most difficult math problems into laymans terms and encourages people to question some of the most…

We study diophantine equations of the form ${a_1 + \ldots + a_n = 0}$ where the $a_i$'s are assumed to be coprime and to satisfy certain subsum conditions. We are interested in the limit superior of the qualities of the admissible solutions…

This paper studies integer solutions to the ABC equation A+B+C=0 in which none of A, B, C has a large prime factor. Set H(A,B, C)= max(|A|,|B|,|C|) and set the smoothness S(A, B, C) to be the largest prime factor of ABC. We consider…

Question 10208b (1992) of the American Mathematical Monthly asked: does there exist an increasing sequence $\{a_k\}$ of positive integers and a constant $B > 0$ having the property that $\{ a_k + n\}$ contains no more than $B$ primes for…

Under Cram\'er's conjecture concerning the prime numbers, we prove that for any $x>1$, there exists a real $A=A(x)>1$ for which the formula $[A^{n^x}]$ (where $[]$ denotes the integer part) gives a prime number for any positive integer $n$.…

In this paper we study practical numbers of some special forms. For any integers $b\ge0$ and $c>0$, we show that if $n^2+bn+c$ is practical for some integer $n>1$, then there are infinitely many nonnegative integers $n$ with $n^2+bn+c$…

Following an idea of Rowland we give a conjectural way to generate increasing sequences of primes using algorithms involving the gcd. These algorithms seem not so useless for searching primes since it appears we found sometime primes much…

While currently the $abc$ conjecture and work towards it remains open or is disputed, at the same time much work has been done on weaker versions, as well as on its generalisation to number fields. Given integers satisfying $a+b=c$, Stewart…

Ellenberg proved that the abc conjecture would follow if this conjecture were known for sums $a+b=c$ such that $D\mid abc$ for some integer~$D$. Mochizuki proved a theorem with an opposite restriction, that the full abc conjecture would…

Let $\mathcal{P}$ denote the set of all primes. In 1950, P. Erd\H{o}s conjectured that if $c$ is an arbitrarily given constant, $x$ is sufficiently large and $a_1,\dots , a_t$ are positive integers with $a_1<a_2<\cdot\cdot\cdot<a_t\leqslant…

Let $b$ be an integer greater than or equal to $2$. For any integer $n\in \left[b^{\lambda-1}, b^{\lambda}-1\right]$, we denote by $R_\lambda (n)$ the reverse of $n$ in base $b$, obtained by reversing the order of the digits of $n$. We…

We show that the $abc$ conjecture of Masser-Oesterl\'{e}-Szpiro for number fields implies that there are infinitely many non-Fibonacci-Wieferich primes. We also provide a new heuristic for the number of such primes beneath a certain value.

We present a novel conjecture concerning the additive representation of natural numbers using prime powers. Based on extensive computational verification, we conjecture that every integer n > 23 can be expressed as a sum of at most five…

In this paper, we use a variety of classical and new research methods for ternary exponential Diophantine equations and extensive use of computer calculations to study the conjecture of R. Scott and R. Styer which asserts that for any fixed…

Silverman showed that, assuming the $abc$ conjecture, there are $\gg \log x$ non-Wieferich primes base $a$ less than $x$ \cite{silverman}, for all non-zero $a$. This inspired Graves and Murty \cite{Graves}, Chen and Ding \cite{Chen1}…