Related papers: Some Tribonacci Conjectures
Revised proofs of Kenneth Arrow's impossibility theorem have been presented in prose form, incorporating novel ideas such as decisive sets and pivotal voters. This study develops another approach to proving the theorem. Using a proof…
In this paper we adopt a geometric point of view regarding a famous conjecture due to Littlewood in diophantine approximation of real numbers. Following the spirit of the geometric theory of continued fractions, we give a sufficient…
We establish a weak form of Ennola's conjecture. We achieve this by showing that two main assumptions Louboutin made in his previous work hold true. These assumptions are about Laurent polynomials over the rationals, and we prove them by…
We apply the Desnanot-Jacobi identity to give an alternative proof of the determinants whose entries are rising powers of the Fibonacci numbers given by Prodinger. We then generalize the determinants to include entries that are rising…
Hilbert's Irreducibility Theorem is a cornerstone that joins areas of analysis and number theory. Both the genesis and genius of its proof involved combining real analysis and combinatorics. We try to expose the motivations that led Hilbert…
We present a method to prove the decidability of provability in several well-known inference systems. This method generalizes both cut-elimination and the construction of an automaton recognizing the provable propositions.
Recent results about sums of cubes of Fibonacci numbers [Frontczak, 2018] are extended to arbitrary powers.
Kronecker's 1856 paper contains a solvability theorem that is useful to construct unsolvable algebraic equations. We show how Kronecker's solvability theorem can be derived naturally via a polynomial complete decomposition method. This…
The conjecture of Valent about the type of Jacobi matrices with polynomially growing weights is proved.
We prove an effective version of the Oppenheim conjecture with a polynomial error rate. The proof is based on an effective equidistribution theorem which in turn relies on recent progress towards restricted projection problem.
Polignac [1] conjectured that for every even natural number $2k (k\geq1)$, there exist infinitely many consecutive primes $p_n$ and $p_{n+1}$ such that $p_{n+1}-p_n=2k$. A weakened form of this conjecture states that for every $k\geq1$,…
We prove some cases of a conjecture of Lewis, Reiner and Stanton regarding Hilbert series corresponding to the action of $Gl_n(\mathbb{F}_q)$ on a polynomial ring modulo Frobenius powers. We also give a few conjectures about the invariant…
We show the finiteness of perfect powers in orbits of polynomial dynamical systems over an algebraic number field. We also obtain similar results for perfect powers represented by ratios of consecutive elements in orbits. Assuming the…
We propose conjectural generalizations of the Fermat-Catalan conjecture, the Tijdeman-Zagier conjecture, and of the Fermat Last Theorem, in which powers are replaced by products of integers. We also formulate a new explicit version of the…
We give a reduction of the irregular case for the effective non-vanishing conjecture by virtue of the Fourier-Mukai transform. As a consequence, we reprove that the effective non-vanishing conjecture holds on algebraic surfaces.
We announce here that Fermat's Last theorem was solved, but there is an easy proof of it on the basis of elemetary undergraduate mathematics. We shall disclose such an easy proof.
The abc conjecture is one of the most famous unsolved problems in number theory. The conjecture claims for each real $\epsilon > 0$ that there are only a finite number of coprime positive integer solutions to the equation $a+b = c$ with $c…
We derive new infinite series involving Fibonacci numbers and Riemann zeta numbers. The calculations are facilitated by evaluating linear combinations of polygamma functions of the same order at certain arguments.
An open problem posed by Milner asks for a proof that a certain axiomatisation, which Milner showed is sound with respect to bisimilarity for regular expressions, is also complete. One of the main difficulties of the problem is the lack of…
In this note we generalise a method of Perott to give new proofs that there are infinitely many prime numbers.