Related papers: An Extension to Fermat's Factorisation and a simpl…
We introduce a new version of arithmetic in all finite types which extends the usual versions with primitive notions of extensionality and extensional equality. This new hybrid version allows us to formulate a strong form of extensionality,…
We study the conservativity of extensions by additional strict equalities of dependent type theories (and more general second-order generalized algebraic theories). The conservativity of Extensional Type Theory over Intensional Type Theory…
Recently, a factorization theorem was proposed for partonic flavor evolution as defined by the net flavor of the Winner-Take-All axis of a jet. We validate the factorization theorem through explicit calculation at two-loop order, and in the…
We extend a factorization due to Krein to arbitrary analytic functions from the upper half-plane to itself. The factorization represents every such function as a product of fractional linear factors times a function which, generally, has…
We propose an approach to factorize the time-evolution operator of a quantum system through a (finite) sequence of elementary operations that are time-ordered. Our proposal borrows from previous approaches based on Lie algebra techniques…
We give a simple direct proof of Fermat's two squares theorem. Our argument uses no intricate notions or ideas; one might say that it is a proof by careful bookkeeping. As such, the proof may be particularly easy to comprehend by students…
This document presents an alternative proof of Sylvester's theorem stating that "the product of $n$ consecutive numbers strictly greater than $n$ is divisible by a prime strictly greater than $n$". In addition, the paper proposes stronger…
In this paper, we consider sums of generalized polygonal numbers with repeats, generalizing Fermat's polygonal number theorem which was proven by Cauchy. In particular, we obtain the minimal number of generalized $m$-gonal numbers required…
The multiplicative theory of a set of numbers (which could be natural, integer, rational, real or complex numbers) is the first-order theory of the structure of that set with (solely) the multiplication operation (that set is taken to be…
We first summarize joint work on several preliminary canonical Lambert series factorization theorems. Within this article we establish new analogs to these original factorization theorems which characterize two specific primary cases of the…
Every natural number greater than two may be written as the sum of a prime and a square-free number. We establish several generalisations of this, by placing divisibility conditions on the square-free number.
We consider the question of extending propositional logic to a logic of plausible reasoning, and posit four requirements that any such extension should satisfy. Each is a requirement that some property of classical propositional logic be…
The features of a logically sound approach to a theory of statistical reasoning are discussed. A particular approach that satisfies these criteria is reviewed. This is seen to involve selection of a model, model checking, elicitation of a…
We consider a probabilistic quantum implementation of a variable of the Pocklington-Lehmer $N-1$ primality test using Shor's algorithm. O($\log^3 N \log\log N \log\log\log N$) elementary q-bit operations are required to determine the…
We present a simple proof of the factorization of (complex) symmetric matrices into a product of a square matrix and its transpose, and discuss its application in establishing a uniqueness property of certain antilinear operators.
Let $k \geq 2$ be an integer. We prove that factorization of integers into $k$ parts follows the Dirichlet distribution $\text{Dir}\left(\frac{1}{k},\ldots,\frac{1}{k}\right)$ by multidimensional contour integration, thereby generalizing…
We add one condition to the theorem of Proth to extend its applicability to $N=k2^n+1$ where $2^n>N^{1/3}$ as opposed to the former constraint of $2^n>k$. This additional condition adds barely any complexity or time to the test and can…
In this paper we prove a few propositions concerning factorizations of morphisms in pro categories, the most important of which solves an open problem of Isaksen concerning the existence of certain types of functorial factorizations. On our…
We study conditions under which a partial differential operator of arbitrary order $n$ in two variables or ordinary linear differential operator admits a factorization with a first-order factor on the left. The factorization process…
Stirling's formula is a powerful asymptotic approximation of the factorial function. Many well-known proofs of this formula are grounded in integral calculus. In this paper, we present an alternative proof of Stirling's formula using only…