相关论文: An Extension to Fermat's Factorisation and a simpl…
Lambda-calculi come with no fixed evaluation strategy. Different strategies may then be considered, and it is important that they satisfy some abstract rewriting property, such as factorization or normalization theorems. In this paper we…
The purpose of this article is to delve into the properties of invariants. The properties, explained in [2], reveal new ways to develop algorithms that allow us to test the primality of a number. In this article, some of these are shown,…
New form of Fermat's principle for light propagation in arbitrary (i.e. in general neither static nor stationary) gravitational field is proposed. It is based on Herglotz extension of canonical formalism and simple relation between the…
The purpose of this article is to introduce the concept of invariance and its properties. These properties can be used to check the primality of a number. Combining these properties with the Euler theorem, it is possible to generalize this…
Factorization of numbers with the help of Gauss sums relies on an intimate relationship between the maxima of these functions and the factors. Indeed, when we restrict ourselves to integer arguments of the Gauss sum we profit from a…
The problem to express a natural number N as a product of natural numbers without regard to order corresponds to a thermally isolated non-interacting Bose gas in a one-dimensional potential with logarithmic energy eigenvalues. This…
We study Kummer's approach towards proving the Fermat's last Theorem for regular primes. Some basic algebraic prerequisites are also discussed in this report, and also a brief history of the problem is mentioned. We review among other…
This chapter amalgamates some foundational developments and calculations in factorization homology.
In this article, we factor the composite $4n^2 +1$ using Fermat's factorization method. Consequently, we characterized all proper factors of composite $4n^2 +1$ in terms of its form. Furthermore, the composite Fermat's number is considered…
A difference equation based method of determining two factors of a composite is presented. The feasibility of P-complexity is shown. Presentation of material is non-theoretical; intended to be accessible to a broader audience of non…
In this paper we derive an explicit formula for calculating the marginal likelihood of a given factorization of a categorical dataset. Since the marginal likelihood is proportional to the posterior probability of the factorization, these…
In this note we generalise a method of Perott to give new proofs that there are infinitely many prime numbers.
Prime factorization is an outstanding problem in arithmetic, with important consequences in a variety of fields, most notably cryptography. Here we employ the intriguing analogy between prime factorization and optical interferometry in…
A simple criterion is derived in order that a number sequence ${\cal S}_n$ is a permitted spectrum of a quantized system. The sequence of the prime numbers fulfils the criterion and the corresponding one-dimensional quantum potential is…
Polynomial factorization in conventional sense is an ill-posed problem due to its discontinuity with respect to coefficient perturbations, making it a challenge for numerical computation using empirical data. As a regularization, this paper…
In this paper, we introduce two primality tests based on new divisibility properties of binomial coefficients. These new properties were enunciated and proved in previous work. We also study two similar tests that can be obtained from…
Factorization theorem plays the central role at high energy colliders to study standard model and beyond standard model physics. The proof of factorization theorem is given by Collins, Soper and Sterman to all orders in perturbation theory…
The Flavour Expansion Theorem, which has been recently proposed as a more general and elegant algebraic method, for the derivation of the commonly used Mass Insertion Approximation, is revisited. The theorem is reviewed, with respect to its…
Robert Denomme and Gordan Savin made a primality test for Fermat numbers 2^(2^k)+1 using elliptic curves. We propose another primality test using elliptic curves for Fermat numbers and also give primality tests for integers of the form…
The aim of this paper is to establish various factorization results and then to derive estimates for linear functionals through the use of a generalized Taylor theorem. Additionally, several error bounds are established including…