# Factor Divisibility

Level pending*x*,*y* are nonnegative integers has 64 solutions, from \( (x_{1},y_{1}) \) to \( (x_{64},y_{64}) \). Let \( f(n) \) denote the number of factors of *n* which are divisible by 3 and \( g(n) \) denote the number of factors of *n* which are not divisible by 3. What is \( \displaystyle\sum_{i=1}^{64} \dfrac{f(y_{i})}{g(y_{i})} \)?

**Your answer seems reasonable.**Find out if you're right!

Sign up to access problem solutions.

**That seems reasonable.**Find out if you're right!

Already have an account? Log in here.