中文
相关论文

相关论文: Factorization of number into prime numbers viewed …

200 篇论文

Factorization is the most fundamental way to determine if a number $n$ is prime or composite. Yet, this approach becomes impracticable when considering large values of $n$, a difficulty that is exploited by cryptographic protocols. We…

量子物理 · 物理学 2023-10-06 A. L. M. Southier , L. F. Santos , P. H. Souto Ribeiro , A. D. Ribeiro

A compression algorithm is presented that uses the set of prime numbers. Sequences of numbers are correlated with the prime numbers, and labeled with the integers. The algorithm can be iterated on data sets, generating factors of doubles on…

综合物理 · 物理学 2007-05-23 Gordon Chalmers

Completely entangled quantum states are shown to factorize into tensor products of entangled states whose dimensions are powers of prime numbers. The entangled states of each prime-power dimension transform among themselves under a finite…

高能物理 - 理论 · 物理学 2007-05-23 Daniel I. Fivel

We study the asymptotic distribution of integers sharing the same rooted-tree structure that encodes their complete prime factorization tower. For each tree we derive an explicit density formula depending only on a pair $(m,k)$, the density…

数论 · 数学 2025-12-02 Roberto Conti , Pierluigi Contucci , Vitalii Iudelevich

This research presents the results of a study on the existence and frequency distribution of the shell primes defined herein as prime numbers that result from the calculation of the "half-shell" of an p-dimensional entity of the form…

综合数学 · 数学 2023-04-21 Michael P. May

We draw attention to various aspects of number theory emerging in the time evolution of elementary quantum systems with quadratic phases. Such model systems can be realized in actual experiments. Our analysis paves the way to a new,…

量子物理 · 物理学 2015-06-26 Holger Mack , Marc Bienert , Florian Haug , Matthias Freyberger , Wolfgang P. Schleich

We consider polynomials with integer coefficients and discuss their factorization properties in Z[[x]], the ring of formal power series over Z. We treat polynomials of arbitrary degree and give sufficient conditions for their reducibility…

交换代数 · 数学 2014-06-20 Daniel Birmajer , Juan B. Gil , Michael D. Weiner

Let $f(x)\in \mathbb{Z}[x]$ be an irreducible polynomial of degree $d\ge 1$. Let $k\ge2$ be an integer. The number of integers $n$ such that $f(n)$ is $k$-free is widely studied in the literature. In principle, one expects that $f(n)$ is…

数论 · 数学 2026-01-21 Biao Wang , Shaoyun Yi

Number partitioning is a classical problem from combinatorial optimisation. In physical terms it corresponds to a long range anti-ferromagnetic Ising spin glass. It has been rigorously proven that the low lying energies of number…

无序系统与神经网络 · 物理学 2016-08-19 Heiko Bauke , Silvio Franz , Stephan Mertens

It is well known that the distribution of the prime numbers plays a central role in number theory. It has been known, since Riemann's memoir in 1860, that the distribution of prime numbers can be described by the zero-free region of the…

综合数学 · 数学 2010-07-27 Yuan-You Fu-Rui Cheng

Counting the number of prime numbers up to a certain natural number and describing the asymptotic behavior of such a counting function has been studied by famous mathematicians like Gauss, Legendre, Dirichlet, and Euler. The prime number…

数论 · 数学 2023-01-11 Jonatan Gomez

We will describe an algorithm to arrange all the positive and negative integer numbers. This array of numbers permits grouping them in six different Classes, $\alpha$, $\beta$, $\gamma$, $\delta$, $\epsilon$, and $\zeta$. Particularly,…

综合数学 · 数学 2007-07-10 Leopoldo Garavaglia , Mario Garavaglia

We will see that key concepts of number theory can be defined for arbitrary operations. We give a generalized distributivity for hyperoperations (usual arithmetic operations and operations going beyond exponentiation) and a generalization…

环与代数 · 数学 2011-01-06 Patrick St-Amant

One familiar with the Euler zeta function, which established the remarkable relationship between the prime and composite numbers, might naturally ponder the results of the application of this special function in cases where there is no…

数论 · 数学 2023-04-12 Michael P. May

We introduce a stochastic algorithm that acts as a prime number generator. The dynamics of such algorithm gives rise to a continuous phase transition which separates a phase where the algorithm is able to reduce a whole set of integers into…

计算物理 · 物理学 2009-11-13 Bartolo Luque , Lucas Lacasa , Octavio Miramontes

The role of integrable systems in string theory is discussed. We remind old examples of the correspondence between stringy partition functions or effective actions and integrable equations, based on effective application of the matrix model…

高能物理 - 理论 · 物理学 2007-05-23 A. Marshakov

The symbolic representation of a number should be considered as a data structure, and the choice of data structure depends on the arithmetic operations that are to be performed. Numbers are almost universally represented using position…

计算复杂性 · 计算机科学 2011-04-18 Ross D. King

Partition functions $Z(x)$ of statistical mechanics are generally approximated by integrals. The approximation fails in small cavities or at very low temperature, when the ratio $x$ between the energy quantum and thermal energy is larger or…

统计力学 · 物理学 2007-05-23 Michel Planat

The statistical mechanics of particles that populate indistinguishable energy sub-states is explored. In particular, the mathematical treatment of the microstates differs from conventional statistical mechanics where for a given degeneracy,…

统计力学 · 物理学 2026-05-20 Shimul Akhanjee

String theory and supersymmetry are theoretical ideas that go beyond the standard model of particle physics and show promise for unifying all forces. After a brief introduction to supersymmetry, we discuss the prospects for its experimental…

高能物理 - 理论 · 物理学 2008-11-26 John H. Schwarz , Nathan Seiberg
‹ 上一页 1 2 3 10 下一页 ›