Add to ORKGIn this paper, I explore the following problem: Problem. Find instances where a product of distinct prime numbers is an integer multiple of the sum of the same prime numbers. Find as many such instances as possible
We introduce a method for showing that there exist prime numbers which are very close together. The ...
Only a subset of all even integers can be proved in which every even integer > 4 can be expressed as...
2014 We introduce a fundamental theorem of prime sieving (FTPS) and show how it illuminates structur...
Let k ≥ 2 and n ≥ 1 be integers. We denote by ∆(n, k) = n(n+ 1) · · · (n+ k − 1). For an integer...
Abstract. It is shown under Schinzel’s Hypothesis that for a given ` ≥ 1, there are infinitely many...
This paper is concerned with formulation and demonstration of new versions of equations that can hel...
The Fundamental Theorem of Arithmetic is usually stated in a form emphasizing how primes enter the s...
It is shown under Schinzel's Hypothesis that for a given l≥ 1, there are infinitely many k such that...
We define the arithmetic function P by P (1) = 0, and P (n) = p1 + p2+ · · ·+ pk if n has the uni...
Based on an arithmetical and autocatalytic approach, the authors propose a solution for the occurren...
Although the number of primes is infinite, one can still find as many consecutive integers as one pl...
In this paper problems 14, 15, 29, 30, 34, 78, 83, 97, and 116 from [6] are formalized, using the Mi...
In 1955 Erd??s posed the multiplication table problem: Given a large integer N, how many distinct pr...
The fundamental theorem of arithmetic states that any composite natural integer can be expressed in ...
The sum-product problem of Erdos and Szemeredi asserts that any subset of the integers has many prod...
We introduce a method for showing that there exist prime numbers which are very close together. The ...
Only a subset of all even integers can be proved in which every even integer > 4 can be expressed as...
2014 We introduce a fundamental theorem of prime sieving (FTPS) and show how it illuminates structur...
Let k ≥ 2 and n ≥ 1 be integers. We denote by ∆(n, k) = n(n+ 1) · · · (n+ k − 1). For an integer...
Abstract. It is shown under Schinzel’s Hypothesis that for a given ` ≥ 1, there are infinitely many...
This paper is concerned with formulation and demonstration of new versions of equations that can hel...
The Fundamental Theorem of Arithmetic is usually stated in a form emphasizing how primes enter the s...
It is shown under Schinzel's Hypothesis that for a given l≥ 1, there are infinitely many k such that...
We define the arithmetic function P by P (1) = 0, and P (n) = p1 + p2+ · · ·+ pk if n has the uni...
Based on an arithmetical and autocatalytic approach, the authors propose a solution for the occurren...
Although the number of primes is infinite, one can still find as many consecutive integers as one pl...
In this paper problems 14, 15, 29, 30, 34, 78, 83, 97, and 116 from [6] are formalized, using the Mi...
In 1955 Erd??s posed the multiplication table problem: Given a large integer N, how many distinct pr...
The fundamental theorem of arithmetic states that any composite natural integer can be expressed in ...
The sum-product problem of Erdos and Szemeredi asserts that any subset of the integers has many prod...
We introduce a method for showing that there exist prime numbers which are very close together. The ...
Only a subset of all even integers can be proved in which every even integer > 4 can be expressed as...
2014 We introduce a fundamental theorem of prime sieving (FTPS) and show how it illuminates structur...