Search results

1. Shor's factoring algorithm

   ... some integers m and n (this is a property of the greatest common divisor .) Multiplying both sides by v , we find that mkN ...

   Wiki article - JMiszczak - 26/10/2015 - 17:56 - 0 comments

2. Basic concepts in quantum computation

   ... divisors). Otherwise, a is called composite . The greatest common divisor of two integers a and b is the greatest ... assess the complexity of other algorithms. For example, the greatest common divisor of two integers x and $y can be found using ...

   Wiki article - Anonymous (not verified) - 04/01/2016 - 11:49 - 0 comments