Solution 1 (Algebra)
Let z=x+y. By the substitution z=x+y, we rewrite the third property in terms of x and z, then solve for f(x,z):
zf(x,z−x)f(x,z)=(z−x)f(x,z)=z−xz⋅f(x,z−x).
Using the properties of f, we have
f(14,52)=3852⋅f(14,38)=3852⋅2438⋅f(14,24)=3852⋅2438⋅1024⋅f(14,10)=3852⋅2438⋅1024⋅f(10,14)=3852⋅2438⋅1024⋅414⋅f(10,4)=3852⋅2438⋅1024⋅414⋅f(4,10)=3852⋅2438⋅1024⋅414⋅610⋅f(4,6)=3852⋅2438⋅1024⋅414⋅610⋅26⋅f(4,2)=3852⋅2438⋅1024⋅414⋅610⋅26⋅f(2,4)=3852⋅2438⋅1024⋅414⋅610⋅26⋅24⋅f(2,2)=3852⋅2438⋅1024⋅414⋅610⋅26⋅24⋅2=364.
~MRENTHUSIASM (credit given to AoPS)
Solution 2 (Algebra)
Since all of the function's properties contain a recursive definition except for the first one, we know that f(x,x)=x in order to obtain an integer answer. So, we have to transform f(14,52) to this form by exploiting the other properties. The second one doesn't help us immediately, so we will use the third one.
Note that
f(14,52)=f(14,14+38)=3852⋅f(14,38).
Repeating the process several times,
f(14,52)=f(14,14+38)=3852⋅f(14,38)=3852⋅2438⋅f(14,14+24)=2452⋅f(14,24)=1052⋅f(10,14)=1052⋅414⋅f(10,4)=591⋅f(4,10)=391⋅f(4,6)=91⋅f(2,4)=91⋅2⋅f(2,2)=364.
Solution 3 (Number Theory)
Notice that f(x,y)=lcm(x,y) satisfies all three properties:
For the first two properties, it is clear that lcm(x,x)=x and lcm(x,y)=lcm(y,x).
For the third property, using the identities gcd(x,y)⋅lcm(x,y)=x⋅y and gcd(x,x+y)=gcd(x,y) gives
y⋅lcm(x,x+y)=gcd(x,x+y)y⋅x(x+y)=gcd(x,y)(x+y)⋅xy=(x+y)⋅lcm(x,y).
Hence, f(x,y)=lcm(x,y) is a solution to the functional equation.
Since this is an AIME problem, there is exactly one correct answer, and thus, exactly one possible value of f(14,52).
Therefore, we have
f(14,52)=lcm(14,52)=lcm(2⋅7,22⋅13)=22⋅7⋅13=364.
Proof that f(x,y)=lcm(x,y) is the only function instead of just using the fact that this is an AIME problem (Proof credited to AMSP's 101 Algebra Problems):
FTSOC, suppose that there is another function g(x,y) also satisfying the given conditions. Let S be the set of all pairs of positive integers (x,y) such that f(x,y)=g(x,y), and let (m,n) be such a pair with minimal sum m+n. It is clear that m=n, otherwise f(m,n)=f(m,m)=m=g(m,m)=g(m,n). By symmetry, we can also assume that n>m. Note that
nf(m,n−m)=[m+(n−m)]f(m,n−m)
=(n−m)f(m,m+(n−m))=(n−m)f(m,n)
or
f(m,n−m=nn−m⋅f(m,n).
Likewise,
g(m,n−m)=nn−m⋅g(m,n).
Since f(m,n)=g(m,n), f(m,n−m)=g(m,n−m). Thus (m,n−m)∈S. But (m,n−m) has a smaller sum then (m,n), a contradiction. Therefore, f(x,y)=lcm(x,y) is the only solution.
~Yiyj1