相关论文: Factorization of integers and arithmetic functions

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…

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…

We sketch a simplification of proofs of old results on the arithmeticity of the group generated by opposing integral unipotent radicals in higher rank arithmetic groups

The idea of generating integrals analogous to generating functions is first introduced in this paper. A new proof of the well-known Finite Harmonic Series Theorem in Analysis and Analytical Number Theory is then obtained by the method of…

Motivated by Andrews' recent work related to Euler's partition theorem, we consider the set of partitions of an integer $n$ where the set of even parts has exactly $j$ elements, versus the set of partitions of $n$ where the set of repeated…

Building on the concept of pretentious multiplicative functions, we give a new and largely elementary proof of the best result known on the counting function of primes in arithmetic progressions.

We establish correspondances between factorisations of finite abelian groups (direct factors, unitary factors, non isomorphic subgroup classes) and factorisations of integer matrices. We then study counting functions associated to these…

We discuss the formal aspects of the factorial polynomials and of the associated series. We develop the theory using the formalism of quasi-monomials and prove the usefulness of the method for the solutions of nontrivial difference…

This is mainly a small exposition on extensions of valuation rings as a filtered union of smooth algebras.

In this paper we investigate the properties of the Euler functions. By using the Fourier transform for the Euler function, we derive the interesting formula related to the infinite series. Finally we give some interesting identities between…

Computer algebra systems are really good at factoring polynomials, i.e. writing f as a product of irreducible factors. It is relatively easy to verify that we have a factorisation, but verifying that these factors are irreducible is a much…

We give a geometric approach to integer factorization. This approach is based on special approximations of segments of the curve that is represented by $y=n/x$, where $n$ is the integer whose factorization we need.

We introduce axiomatically the ring $\bf{Z}_\kappa$ of the Euclidean integers, that can be viewed as the ``integral part" of the field $\mathbb{E}$ of Euclidean numbers of [4], where the transfinite sum of ordinal indexed $\kappa$-sequences…

A spectral factorization theorem is proved for polynomial rank-deficient matrix-functions. The theorem is used to construct paraunitary matrix-functions with first rows given.

Integer factorization is a fundamental problem in algorithmic number theory and computer science. It is considered as a one way or trapdoor function in the (RSA) cryptosystem. To date, from elementary trial division to sophisticated methods…

In this paper we give simple proofs for the bounds (some of them sharp) of the difference of the moduli of the second and the first logarithmic coefficient for the general class of univalent functions and for the class of convex univalent…

In the first chapter, we will present a computation of the square value of the module of L functions associated to a Dirichlet character. This computation suggests to ask if a certain ring of arithmetic multiplicative functions exists and…

The discrete Fourier transform of the greatest common divisor is a multiplicative function, if taken with respect to the same order of the primitive root of unity, which is a well known fact. As such, the transform can be expressed in the…

Subsequently to the author's preceding paper, we give full proofs of some explicit formulas about factorizations of $K$-$k$-Schur functions associated with any multiple $k$-rectangles.

We prove a factorization formula for the Taylor series coefficients of a zero of a polynomial as a function of the polynomial's coefficients. This result extends to more general functions which we call "complex-exponent polynomials". To…