one + two + eleven + twelve
Problem: How many positive integer solutions
Let
Thus
But
First,
Because
(X_1)=2=1+1=o+e^2*l*v ,l=o=v=e=1 .And
(X_2)=n(1)+t*w=13 . There are twelve possibilities:n=1 andt*w=12 ,n=2 andt*w=11 , ...n=12 andt*w=1 .If
t*w=1 andn=12 , this corresponds to1 solution to the overall equation.If
t*w is prime, each such possibility corresponds to2 solutions to the overall equation; there are5 prime numbers≤12 . This yields10 solutions to the overall equation.If
t*w is composite:If
t*w is square, i.e.t*w=4 ort*w= 9, each possibility corresponds to3 solutions to the overall equation. Overall this yields6 solutions to the overall equation.If
t*w is not square:t*w=6=3×2=1×6 contributes4 solutions.t*w=8=2×4=1×8 contributes4 solutions.t*w=10=2×5=1×10 contributes4 solutions.t*w=12=3×4=6×2=1×12 contributes6 solutions.
This case has
Second,
Because
(X_2)=2=1+1=n*e+t*w ,n=e=w=t=1 .And
(X_1)=o+(1)^2*l*v=13 . Above, we have shown thatn+t*w=13 has35 solutions. This is the same case, just relabel the variables.
This case has
Across both cases, there are