Date: May 15, 2011 7:07 AM
Author: Casey
Subject: Is there an efficient way to generate Euler's totient function for [2,3..n]?


Is there an efficient way to generate Euler's totient function for
[2,3..n]?

Or an arithmetical sequence?

Or a geometric sequence?

Or some generalized sequence?

Thank you for your time.