Search results

1. Shor's factoring algorithm

   ... factors from period The integers less than N and coprime with N form a finite group under multiplication modulo ...

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

2. Basic concepts in quantum computation

   ... b . Two integers a and b are said to be coprime or relatively prime if gcd( a ,  b ) = 1 . Given two integers a and n that are coprime, it can be shown that there exists an unique integer d ...

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