Every positive integer m has a product representation of the form
k 3n;+1 'i
1.1, 5n+2
where v, k and the n; are positive integers, and each £; = ± 1. A value can
be given for v which is uniform in the m. A representation can be computed
so that no n; exceeds a certain fixed power of 2m, and the number k of
terms needed does not exceed a fixed power of log 2m.