Related papers: An Extension to Fermat's Factorisation and a simpl…

Each natural number can be associated with some tree graph. Namely, a natural number $n$ can be factorized as $$ n = p_1^{\alpha_1}\ldots p_k^{\alpha_k},$$ where $p_i$ are distinct prime numbers. Since $\alpha_i$ are naturals, they can be…

We present some new ideas on important problems related to primes. The topics of our discussion are: simple formulae for primes, twin primes, Sophie Germain primes, prime tuples less than or equal to a predefined number, and their…

A natural partial order on the set of prime numbers was derived by the author from the internal symmetries of the primary finite fields, independently of Ford a.a., who investigated Pratt trees for primality tests. It leads to 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.

In this paper, we study the properties of Carmichael numbers, false positives to several primality tests. We provide a classification for Carmichael numbers with a proportion of Fermat witnesses of less than 50%, based on if the smallest…

Truncated Fourier, Gauss, Kummer and exponential sums can be used to factorize numbers: for a factor these sums equal unity in absolute value, whereas they nearly vanish for any other number. We show how this factorization algorithm can…

I show that propositional intuitionistic logic is complete with respect to an adaptation of Dummett's pragmatist justification procedure. In particular, given a pragmatist justification of an argument, I show how to obtain a natural…

Any rational number can be factored into a product of several rationals whose sum vanishes. This simple but nontrivial fact was suggested as a problem on a maths olympiad for high-school students. We completely solve similar questions in…

Let $f(n)$ be the number of distinct exponents in the prime factorization of the natural number $n$. We prove some results about the distribution of $f(n)$. In particular, for any positive integer $k$, we obtain that $$ \#\{n \leq x : f(n)…

We give a short proof -- not relying on ideal classes or the geometry of numbers -- of a known criterion for quadratic orders to possess unique factorization.

We use actions by finite cyclic groups to derive generalizations of three classical theorems from elementary number theory.

Using the simple properties of Riemman integrable functions, Ramanujan's formula for sum of the square roots of first n natural numbers has been generalized to include r'th roots where r is any real number greater than 1.As an application…

We start with elementary algebraic theory of factorization of linear ordinary differential equations developed in the period 1880-1930. After exposing these classical results we sketch more sophisticated algorithmic approaches developed in…

In this note we prove that the factorization theorem for dominated polynomials previously proved by the authors is equivalent to an alternative factorization scheme that uses classical linear techniques and a linearization process. However,…

The usual product $m\cdot n$ on $\mathbb{Z}$ can be viewed as the sum of $n$ terms of an arithmetic progression whose first term is $a_{1}=m-n+1$ and whose difference is $d=2$. Generalizing this idea, we define new similar product mappings,…

Let $a > 1$. Then $a^n < n!$ for some positive integer $n$. We show that the smallest such $n$ is one of a pair of possibilities, or is one possibility, which we show how to calculate. There are three interesting numerical sequences which…

In this paper, we introduce a novel quantum algorithm for the factorization of composite odd numbers. This work makes two significant contributions. First, we present a new improvement to the classical Fermat method, fourfold reducing the…

In this expository paper we describe four primality tests. The first test is very efficient, but is only capable of proving that a given number is either composite or 'very probably' prime. The second test is a deterministic polynomial time…

A very simple and short proof of the polynomial matrix spectral factorization theorem (on the unit circle as well as on the real line) is presented, which relies on elementary complex analysis and linear algebra.

We prove new variants of the Lambert series factorization theorems studied by Merca and Schmidt (2017) which correspond to a more general class of Lambert series expansions of the form $L_a(\alpha, \beta, q) := \sum_{n \geq 1} a_n q^{\alpha…