Results 31 to 40 of about 1,271,098 (314)
Quantum Annealing for Prime Factorization [PDF]
Scientific Reports, 2018 AbstractWe have developed a framework to convert an arbitrary integer factorization problem to an executable Ising model by first writing it as an optimization function then transforming the k-bit coupling (k ≥ 3) terms to quadratic terms using ancillary variables. Our resource-efficient method uses $${\mathscr{O}}({\mathrm{log}}^{2}(N))$$
Shuxian Jiang +4 more
openaire +3 more sources
On the Diophantine equation x3=dy2±q6
International Journal of Mathematics and Mathematical Sciences, 2001 Let q>3 denote an odd prime and d a positive integer without any prime factor p≡1(mod3). In this paper, we have proved that if (x,q)=1, then x3=dy2±q6 has exactly two solutions provided q≢±1(mod24).
Fadwa S. Abu Muriefah
doaj +1 more source
Psychologica Belgica, 2012 Recent studies have shown that subliminal priming effects can be of a semantic nature. However, the question remains how strong this kind of priming will prove to be.
Eva Van den Bussche +3 more
doaj +1 more source
On a Deconcatenation Problem [PDF]
, 2003 In a recent study of the PrimaIity oj the Smarandache Symmetric Sequences Sabin and Tatiana Tabirca observed a very high frequency of the prime factor 333667 in the factorization of the terms of the second order sequence.
Ibstedt, Henry
core +1 more source
Factoring with Two Large Primes [PDF]
Mathematics of Computation, 1991 Summary: We describe a modification to the well-known large prime variant of the multiple polynomial quadratic sieve factoring algorithm [Eurocrypt '90, Lect. Notes Comput. Sci. 473, 72--82 (1991; Zbl 0779.11061)]. In practice this leads to a speed-up factor of 2 to 2.5.
Lenstra, A. K., Manasse, M. S.
openaire +2 more sources
Prime Factorization And Domination In The Hierarchical Product Of Graphs
Discussiones Mathematicae Graph Theory, 2017 In 2009, Barrière, Dalfó, Fiol, and Mitjana introduced the generalized hierarchical product of graphs. This operation is a generalization of the Cartesian product of graphs.
Anderson S.E. +3 more
doaj +1 more source
Toward the Unification of Physics and Number Theory [PDF]
Reports in Advances of Physical Sciences, 2019 This paper introduces the notion of simplex-integers and shows how, in contrast to digital numbers, they are the most powerful numerical symbols that implicitly express the information of an integer and its set theoretic substructure.
Klee Irwin
doaj +1 more source
Primitive abundant and weird numbers with many prime factors
, 2018 We give an algorithm to enumerate all primitive abundant numbers (briefly, PANs) with a fixed $\Omega$ (the number of prime factors counted with their multiplicity), and explicitly find all PANs up to $\Omega=6$, count all PANs and square-free PANs up to
Amato, Gianluca +3 more
core +2 more sources
Smooth solutions to the abc equation: the xyz Conjecture [PDF]
, 2011 This paper studies integer solutions to the ABC equation A+B+C=0 in which none of A, B, C has a large prime factor. Set H(A,B, C)= max(|A|,|B|,|C|) and set the smoothness S(A, B, C) to be the largest prime factor of ABC.
Lagarias, Jeffrey C., Soundararajan, K.
core +2 more sources
Carmichael Numbers with a Prime Number of Prime Factors
, 2022 Under the assumption of Heath-Brown's conjecture on the first prime in an arithmetic progression, we prove that there are infinitely many Carmichael numbers $n$ such that the number of prime factors of $n$ is prime.
openaire +3 more sources