scholarly journals On the parallel generation of the residues for the continued fraction factoring algorithm

1987 ◽  
Vol 48 (177) ◽  
pp. 405-405 ◽  
Author(s):  
H. C. Williams ◽  
M. C. Wunderlich
Symmetry ◽  
2021 ◽  
Vol 13 (5) ◽  
pp. 735
Author(s):  
Rasyid Redha Mohd Tahir ◽  
Muhammad Asyraf Asbullah ◽  
Muhammad Rezal Kamel Ariffin ◽  
Zahari Mahad

Fermat’s Factoring Algorithm (FFA) is an integer factorisation methods factoring the modulus N using exhaustive search. The appearance of the Estimated Prime Factor (EPF) method reduces the cost of FFA’s loop count. However, the EPF does not work for balanced primes. This paper proposed the modified Fermat’s Factoring Algorithm 1-Estimated Prime Factor (mFFA1-EPF) that improves the EPF method. The algorithm works for factoring a modulus with unbalanced and balanced primes, respectively. The main results of mFFA1-EPF focused on three criteria: (i) the approach to select good candidates from a list of convergent continued fraction, (ii) the establishment of new potential initial values based on EPF, and (iii) the application of the above modification upon FFA. The resulting study shows the significant improvement that reduces the loop count of FFA1 via (improved) EPF compared to existing methods. The proposed algorithm can be executed without failure and caters for both the modulus N with unbalanced and balanced primes factor. The algorithm works for factoring a modulus with unbalanced and balanced primes.


2020 ◽  
Vol 25 (2) ◽  
pp. 125-132
Author(s):  
Bal Bahadur Tamang ◽  
Ajay Singh

This article attempts to describe the continued fraction expansion of ÖD viewed as a Laurent series x-1. As the behavior of the continued fraction expansion of ÖD is related to the solvability of the polynomial Pell’s equation p2-Dq2=1  where D=f2+2g  is monic quadratic polynomial with deg g<deg f  and the solutions p, q  must be integer polynomials. It gives a non-trivial solution if and only if the continued fraction expansion of ÖD  is periodic.


2020 ◽  
Vol 18 (1) ◽  
pp. 1727-1741
Author(s):  
Yoonjin Lee ◽  
Yoon Kyung Park

Abstract We study the modularity of Ramanujan’s function k ( τ ) = r ( τ ) r 2 ( 2 τ ) k(\tau )=r(\tau ){r}^{2}(2\tau ) , where r ( τ ) r(\tau ) is the Rogers-Ramanujan continued fraction. We first find the modular equation of k ( τ ) k(\tau ) of “an” level, and we obtain some symmetry relations and some congruence relations which are satisfied by the modular equations; these relations are quite useful for reduction of the computation cost for finding the modular equations. We also show that for some τ \tau in an imaginary quadratic field, the value k ( τ ) k(\tau ) generates the ray class field over an imaginary quadratic field modulo 10; this is because the function k is a generator of the field of the modular function on Γ 1 ( 10 ) {{\mathrm{\Gamma}}}_{1}(10) . Furthermore, we suggest a rather optimal way of evaluating the singular values of k ( τ ) k(\tau ) using the modular equations in the following two ways: one is that if j ( τ ) j(\tau ) is the elliptic modular function, then one can explicitly evaluate the value k ( τ ) k(\tau ) , and the other is that once the value k ( τ ) k(\tau ) is given, we can obtain the value k ( r τ ) k(r\tau ) for any positive rational number r immediately.


Mathematics ◽  
2021 ◽  
Vol 9 (3) ◽  
pp. 255
Author(s):  
Dan Lascu ◽  
Gabriela Ileana Sebe

We investigate the efficiency of several types of continued fraction expansions of a number in the unit interval using a generalization of Lochs theorem from 1964. Thus, we aim to compare the efficiency by describing the rate at which the digits of one number-theoretic expansion determine those of another. We study Chan’s continued fractions, θ-expansions, N-continued fractions, and Rényi-type continued fractions. A central role in fulfilling our goal is played by the entropy of the absolutely continuous invariant probability measures of the associated dynamical systems.


Entropy ◽  
2021 ◽  
Vol 23 (7) ◽  
pp. 840
Author(s):  
Maxim Sølund Kirsebom

The Hurwitz complex continued fraction is a generalization of the nearest integer continued fraction. In this paper, we prove various results concerning extremes of the modulus of Hurwitz complex continued fraction digits. This includes a Poisson law and an extreme value law. The results are based on cusp estimates of the invariant measure about which information is still limited. In the process, we obtained several results concerning the extremes of nearest integer continued fractions as well.


2021 ◽  
Vol 11 (1) ◽  
Author(s):  
Unathi Skosana ◽  
Mark Tame

AbstractWe report a proof-of-concept demonstration of a quantum order-finding algorithm for factoring the integer 21. Our demonstration involves the use of a compiled version of the quantum phase estimation routine, and builds upon a previous demonstration. We go beyond this work by using a configuration of approximate Toffoli gates with residual phase shifts, which preserves the functional correctness and allows us to achieve a complete factoring of $$N=21$$ N = 21 . We implemented the algorithm on IBM quantum processors using only five qubits and successfully verified the presence of entanglement between the control and work register qubits, which is a necessary condition for the algorithm’s speedup in general. The techniques we employ may be useful in carrying out Shor’s algorithm for larger integers, or other algorithms in systems with a limited number of noisy qubits.


1979 ◽  
Vol 89 ◽  
pp. 95-101
Author(s):  
S. Mikkola

A continued fraction was derived for the summation of the asymptotic expansion of astronomical refraction. Using simple approximations for the last denominator of the fraction, accurate formulae, useful down to the horizon, were obtained. The method is not restricted to any model of the atmosphere and can thus be used in calculations based on actual aerological measurements.


Sign in / Sign up

Export Citation Format

Share Document