相关论文: Note on Integer Factoring Methods I

This paper introduced a way of fractal to solve the problem of taking count of the integer partitions, furthermore, using the method in this paper some recurrence equations concerning the integer partitions can be deduced, including the…

A novel method of asymptotic factorization of $n \times n$ matrix functions is proposed. Considered class of matrices is motivated by certain problems originated in the elasticity theory. An example is constructed to illustrate…

Consider $k\ge 2$ distinct, linearly independent, homogeneous linear recurrences of order $k$ satisfying the same recurrence relation. We prove that the recurrences are related to a decomposable form of degree $k$, and there is a very broad…

A new heuristic method for the evaluation of definite integrals is presented. This method of brackets has its origin in methods developed for theevaluation of Feynman diagrams. We describe the operational rules and illustrate the method…

The proposed system of integer functions is logically fully independent from the traditional mathematical analysis of the real functions, but there is a well-defined mutual correspondence between the two disciplines. The system of integer…

Multidimensional factorization method is formulated in arbitrary curvilinear coordinates. Particular cases of polar and spherical coordinates are considered and matrix potentials with separating variables are constructed. A new class of…

We propose several procedures for creating new families of integer sequences based on the method of Cantor diagonalization. Then we modify and generalize this method. The paper includes explicit formulas for most proposed families of…

In this paper we give a new aggregation framework for linear Diophantine equations. In particular, we prove that an aggregated system of minimum size can be built in polynomial time. We also derive an analytic formula that gives the number…

This paper presents an integer decomposition method. The method first writes an integer as a polynomial with 2 as variable that its coefficients are zero or one. Then, suppose that an integer is decomposed into product of such two…

In this paper, we use a simple discrete dynamical model to study partitions of integers into powers of another integer. We extend and generalize some known results about their enumeration and counting, and we give new structural results. In…

In this paper, we construct certain infinite families of imaginary quadratic fields whose class number is divisible by a given positive integer.

This paper focuses on the numerical solution of initial value problems for fractional differential equations of linear type. The approach we propose grounds on expressing the solution in terms of some integral weighted by a generalized…

In this note we recall the definition of the digital root, and apply the notion of the digital root to searching solutions of Diophantine equations. A table of arithmetic operations with digital roots is given. This method is incapable of…

We offer multiplication method for factoring big natural numbers which extends the group of the Fermat's and Lehman's factorization algorithms and has run-time complexity $O(n^{1/3})$. This paper is argued the finiteness of proposed…

We generalize recent matrix-based factorization theorems for Lambert series generating functions generating the coefficients $(f \ast 1)(n)$ for some arithmetic function $f$. Our new factorization theorems provide analogs to these…

This work is a tutorial on Shor's factoring algorithm by means of a worked out example. Some basic concepts of Quantum Mechanics and quantum circuits are reviewed. It is intended for non-specialists which have basic knowledge on…

The theoretical aspects of four integer factorization algorithms are discussed in details in this note. The focus is on the performances of these algorithms on the subset of hard to factor balanced integers N = pq, p < q < 2p. The running…

In this paper we prove an existence theorem concerning linear forms of a given Diophantine type and apply it to study the structure of the spectrum of lattice exponents.

The paper introduces a method of partial fractions with matrix coefficients and its applications to finding chains of generalized eigenvectors, to evaluation of matrix exponentials, and to solution of linear systems of ordinary differential…

We use the periodicity properties of generalized Gauss sums to factor numbers. Moreover, we derive rules for finding the factors and illustrate this factorization scheme for various examples. This algorithm relies solely on interference and…