Results 11 to 20 of about 1,271,098 (314)
A Simple Algorithm for Prime Factorization and Primality Testing
Journal of Mathematics, 2022 We propose a new simple and faster algorithm to factor numbers based on the nature of the prime numbers contained in such composite numbers. It is well known that every composite number has a unique representation as a product of prime numbers.
Kabenge Hamiss
doaj +1 more source
Shifted primes without large prime factors [PDF]
Acta Arithmetica, 1998 Let \(\pi(x,y)=\sum_{\substack{ a {x \over (\log x)^c} , \] valid for an absolute constant \(c>0\), \(x\geq x_0(a)\), and \(y\geq x^\beta\) with \(\beta = 0.2961\). This improves on the result of \textit{J. B. Friedlander} [Number theory and applications, Proc. NATO ASI, Banff/Can. 1988, NATO ASI Ser., Ser.
Baker, R. C., Harman, G.
openaire +2 more sources
Proceedings of the National Academy of Sciences, 1996 We use Voiculescu’s free probability theory to prove the existence of prime factors, hence answering a longstanding problem in the theory of von Neumann algebras.
openaire +3 more sources
The $\eta^\prime g^* g^*$ vertex with arbitrary gluon virtualities in the perturbative QCD hard scattering approach [PDF]
, 2000 We study the $\eta^\prime g^* g^*$ vertex for arbitrary gluon virtualities in the time-like and space-like regions, using the perturbative QCD hard scattering approach and an input wave-function of the $\eta^\prime$-meson consistent with the measured ...
A. Ali +56 more
core +1 more source
Proceedings of the National Academy of Sciences, 2000 It is shown that for each 0 < λ < 1, the free Araki–Woods factor of type III λ cannot be written as a tensor product of two diffuse von Neumann algebras (i.e., is prime) and does not contain a Cartan subalgebra.
openaire +3 more sources
Counting Smooth Solutions to the Equation A+B=C [PDF]
, 2011 This paper studies integer solutions to the Diophantine equation A+B=C in which none of A, B, C have a large prime factor. We set H(A, B,C) = max(|A|, |B|, |C|), and consider primitive solutions (gcd}(A, B, C)=1) having no prime factor p larger than (log
Lagarias, J. C., Soundararajan, K.
core +2 more sources
Amodal completion of partly occluded figures: Effect of contour orientation [PDF]
Psihologija, 2003 In present study the temporal dimension of amodal completion in visual occlusion was investigated. We supposed that the visual system prefers to complete normally (vertically-horizontally) oriented contours than the oblique ones. Using the prime-matching
Marković Slobodan S. +1 more
doaj +1 more source
The largest prime factor of $X^3+2$ [PDF]
, 2001 The largest prime factor of $X^3+2$ has been investigated by Hooley, who gave a conditional proof that it is infinitely often at least as large as $X^{1+\delta}$, with a certain positive constant $\delta$.
Heath-Brown, D. R.
core +2 more sources
Quasirecognition by Prime Graph of the Groups 2D2n(q) Where q < 105
Mathematics, 2018 Let G be a finite group. The prime graph Γ ( G ) of G is defined as follows: The set of vertices of Γ ( G ) is the set of prime divisors of | G | and two distinct vertices p and p ′ are connected in &Gamma ...
Hossein Moradi +2 more
doaj +1 more source
Similarity and Coincidence Isometries for Modules [PDF]
, 2010 The groups of (linear) similarity and coincidence isometries of certain modules in d-dimensional Euclidean space, which naturally occur in quasicrystallography, are considered.
Adkins +8 more
core +1 more source