DI - RERO DOC
it is an easy exercise to show that (?) holds if N = p for a prime p ? 1 ... also the correction ?g,f , if using the method of §3.5.1) to a given number ...
it is an easy exercise to show that (?) holds if N = p for a prime p ? 1 ... also the correction ?g,f , if using the method of §3.5.1) to a given number ...