...† In fact, since z is an element of the norm-one subgroup of R × , m is bounded above by 2 s a, where s is the number of distinct primes dividing 2a. A more detailed study of the group R × appears in =-=[36]-=-.37 Remark 2.4.4. The argument in the proof of Theorem 2.4.1 can easily be made into an algorithm for finding x and y, using for example using one of the techniques described by Matthews [83] or Robe...