Related papers: On Triples of Numbers
For a finite set of non-zero natural numbers that contains at least one element different from 1 and the least common multiple of any of its subsets, there exists a subset of at least half of its members which has a common divisor larger…
A linear combination $aT_r(m)+bT_s(n)$ of an \mbox{$r$-gonal} number $T_r(m)$ and an $s$-gonal number $T_s(n)$ with mutually coprime positive integer coefficients $a$ and $b$ produces infinitely many primes as $m$ and~$n$ varies over the…
We show that for any natural number $n$ satisfying $n\equiv 4 \mod 8$ and $n\not\equiv 0 \mod 5$, and for any odd integer $t\geq \frac{n+6}{2}$ there are infinitely many Salem numbers ${\alpha}$ of degree $2t$ such that ${\alpha}^n-1$ is a…
A given subset $A$ of natural numbers is said to be complete if every element of $\N$ is the sum of distinct terms taken from $A$. This topic is strongly connected to the knapsack problem which is known to be NP complete. The main goal of…
A classification of twin primes implies special twin primes. When applied to triplets, it yields exceptional prime number triplets. These generalize yielding exceptional prime number multiplets.
Recent results about sums of cubes of Fibonacci numbers [Frontczak, 2018] are extended to arbitrary powers.
Singmaster's conjecture asserts that every natural number greater than one occurs at most a bounded number of times in Pascal's triangle; that is, for any natural number $t \geq 2$, the number of solutions to the equation $\binom{n}{m} = t$…
We investigate integer numbers which possess at the same time the properties to be triangulars and squares, that are, numbers $a$ for which do exist integers $m$ and $n$ such that $ a = n^2 = \frac{m \cdot (m+1)}{2} $. In particular, we are…
A palintiple is a natural number which is an integer multiple of its digit reversal. A previous paper partitions all palintiples into three distinct classes according to patterns in the carries and then determines all palintiples belonging…
We introduce and study arithmetic polygons. We show that these arithmetic polygons are connected to triples of square pyramidal numbers. For every odd $N\geq3$, we prove that there is at least one arithmetic polygon with $N$ sides. We also…
We introduce the class of supra-SIM sets of natural numbers. We prove that this class is partition regular and closed under finite-embeddability. We also prove some results on sumsets and SIM sets motivated by their positive Banach density…
A hypothesis is put forward regarding the function $\pi_2(x)$ which describes the distribution of twin primes in the set of natural numbers. The function $\pi_2(x)$ is tested by evaluation and an empirical $\pi_2^{\ast}(x)$ is arrived at,…
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 show that for any n divisible by 3, almost all order-n Steiner triple systems have a perfect matching (also known as a parallel class or resolution class). In fact, we prove a general upper bound on the number of perfect matchings in a…
For an arbitrary integer $x$, an integer of the form $T(x)\!=\!\frac{x^2+x}{2}$ is called a triangular number. Let $\alpha_1,\dots,\alpha_k$ be positive integers. A sum $\Delta_{\alpha_1,\dots,\alpha_k}(x_1,\dots,x_k)=\alpha_1…
A general construction yielding infinitely many families of $D(m^2)$-triples of triangular numbers is presented. Moreover, each triple obtained from this construction contains the same triangular number $T_n$.
A natural number is a binary $k$'th power if its binary representation consists of $k$ consecutive identical blocks. We prove an analogue of Waring's theorem for sums of binary $k$'th powers. More precisely, we show that for each integer $k…
Euler showed that there are infinitely many triangular numbers that are three times other triangular numbers. In general, it is an easy consequence of the Pell equation that for a given square-free m > 1, the relation P=mP' is satisfied by…
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$.…
We introduce a notion of palindromicity of a natural number which is independent of the base. We study the existence and density of palindromic and multiple palindromic numbers, and we raise several related questions.