How to proof a = Log(N) / Log(P) is maximum exponent of prime (P) such that (P) power (a) is less than N

Question

I\'m trying to solve Project Euler\'s Problem #5 which is:

What is the smallest positive number that is evenly divisible by all of the numbers from 1 to N?

I c