Let f (n) or the base-2 logarithm of f (n) be either d(n) (the divisor function), σ(n) (the divisor-sum function), ϕ(n) (the Euler totient function), ω(n) (the number of distinct prime factors of n) or Ω(n) (the total number of prime factors of n). We present good lower bounds for M N − α in terms of N , where α = [0; f (1), f (2),. . .]. J α (N) ∈ f (N), g(N) .