Given a range [L,R], where 1<= L <= R <= 1e5, for each integer x in the range, find count of numbers in the range that are co-prime with x.
Any efficient/doable approach?