Since 405=34×5, then 405 is divisible by 34 but is not divisible by 35.
Thus, f(405)=4.
First, we find all factors of 3 which exist in the product 1×2×3×4×5×6×7×8×9×10.
The multiples of 3 are the only numbers which contain factors of 3.
The multiples of 3 in the given product are 3, 6 and 9.
Rewriting the given product, we get ==1×2×3×4×5×6×7×8×9×101×2×3×4×5×(2×3)×7×8×(3×3)×1034×(1×2×4×5×2×7×8×10). Since the product in parentheses does not include any factors of 3, then the largest power of 3 which divides the given product is 34, and so f(1×2×3×4×5×6×7×8×9×10)=4.
First, we count the number of factors of 3 included in 100!.
Every multiple of 3 includes least 1 factor of 3.
The product 100! includes 33 multiples of 3 (since 33×3=99).
Counting one factor of 3 from each of the multiples of 3 (these are 3,6,9,12,15,18,…,93,96,99), we see that 100! includes at least 33 factors of 3.
However, each multiple of 32=9 includes a second factor of 3 (since 9=32,18=32×2, etc.) which was not counted in the previous 33 factors.
The product 100! includes 11 multiples of 9 (since 11×9=99), and thus there are at least 11 additional factors of 3 in 100!.
Similarly, 100! includes 3 multiples of 33=27, each of which contribute an additional factor of 3 (these are 27=33,54=33×2, and 81=34).
Finally, there is one multiple of 34=81 which contributes one more factor of 3.
Since 35>100, then 100! does not include any multiples of 35 and so we have counted all possible factors of 3.
Thus, 100! includes exactly 33+11+3+1=48 factors of 3, and so 100!=348×t for some positive integer t that is not divisible by 3.
Counting in a similar way, the product 50! includes 16 multiples of 3, 5 multiples of 9, and 1 multiple of 27, and thus includes 16+5+1=22 factors of 3.
Therefore, 50!=322×r for some positive integer r that is not divisible by 3.
Also, 20! includes 6+2=8 factors of 3, and thus 20!=38×s for some positive integer s that is not divisible by 3.
Therefore, N=50!20!100!=(322×r)(38×s)348×t=(330×rs)348×t=rs318×t.
Since we are given that N is equal to a positive integer, then rs318×t is a positive integer.
Since r and s contain no factors of 3 and 318×t is divisible by rs, then it must be the case that t is divisible by rs.
In other words, we can re-write N=rs318×t as N=318×rst where rst is an integer.
Since each of r, s and t does not include any factors of 3, then the integer rst is not divisible by 3.
Therefore, the largest power of 3 which divides 50!20!100! is 318, and so f(N)=18.
Since f(a)=8, then the exponent of the largest power of 3 that divides a is 8.
That is, a=38m for some positive integer m and 3 does not divide m.
Since f(b)=7, then the exponent of the largest power of 3 that divides b is 7.
That is, b=37n for some positive integer n and 3 does not divide n.
Substituting and simplifying, we get a+b=38m+37n=37(3m+n) Since 3 divides 3m but 3 does not divide n, then 3 does not divide the sum 3m+n.
That is, 3m+n is not a multiple of 3 and so the largest power of 3 that divides a+b is 37.
Therefore, f(a+b)=7.