- if there exist integers $\color\red m$ and $\color{cyan}n$ such that $12\color\red m + 15\color{cyan}n = 1,$
then $\color\red m$ and $\color{cyan}n$ are both positive.
the given statement is incorrectly worded, isnt it? I think it should have been
- for all integers $m$ and $n$,
if $12m + 15n = 1,$ then $m$ and $n$ are both positive.
As hinted by Gerry Myerson in the comments above, mathematical writing is not formal logic. We'd read the two sentences in "Mary.... She...." as referring to the same entity. Similarly, with the (justifiable) understanding that variables are not being recycled (as if the given statement is just "if integers $m$ and $n$ are such that $12m + 15n = 1,$ then $m$ and $n$ are both positive", with no visible quantification), we can demonstrate that Statement 1 is logically worded, and in fact equivalent to Statement 2. We begin by making explicit Statement 1's implicit universal quantification.
\begin{align}&\text{Statement 1}\\\equiv{}&\forall x{,}y {\in}\mathbb Z \:\bigg(\exists m{,}n{\in}\mathbb Z \,\Big(12m+15n=1 \;\text{ and }\;(x,y)=(m,n)\Big)\implies x,y>0\bigg)\\
\equiv{}&\forall m{,}n {\in}\mathbb Z \:\bigg(\exists x{,}y{\in}\mathbb Z \,\Big(12x+15y=1 \;\text{ and }\;(m,n)=(x,y)\Big)\implies m,n>0\bigg)\\
\equiv{}&\forall m{,}n {\in}\mathbb Z \:\Big(12m+15n=1\implies m,n>0\Big)\\
\equiv{}&\text{Statement 2}.\end{align}
While at first glance Statement 1 and its common variant
- if any integers $\color\red m$ and $\color{cyan}n$ are such that $12\color\red m + 15\color{cyan}n = 1,$
then $\color\red m$ and $\color{cyan}n$ are both positive.
—which as a matter of fact is also equivalent to it and thus to Statement 2—appear to be incorrectly worded (and, to be clear, I do agree that wordings 1 and 3 are, echoing Andreas Blass above, "Yikes"), consider the fact that the following assertions, corresponding to the above, are idiomatically understood as mutually equivalent:
(2) Every solution is positive.
(1) If there exists a $\color\red{\text{solution}},$ $\color\red{\text{it}}$ must be positive.
(3) If there is any $\color\red{\text{solution}},$ $\color\red{\text{it}}$ must be positive.
Reply to the OP
This isn't an answer to the question. You're just showing that two rewritten versions of the statement are equivalent, not answering the question of whether the original statement as written is syntactically correct.ㅤ- Ben
You're asking whether Statement 1, the verbal statement given by your textbook, is "syntactically correct" (in the formal-logic sense). This depends on its formalisation (i.e., translation from natural langauge to formal logic), which is a function of the idioms and conventions of the source language—here mathematical English or Mathlish—and which is not always a rote, mechanical procedure (consider the non-obvious translation of "P(x) holds for at least two objects" as $$∀a\:∃x\:\big(x\ne a\,∧\,P(x)\big)\quad).$$
To answer your question requires formalising Statement 1, which I did by adopting the convention that the second and third occurrences of $\color\red m$ are meant to be pointing at the same object (likewise, $\color{cyan}n).$ With this understanding, Statement 1 is indeed syntactically correct and, furthermore, is semantically equivalent to your Statement 2.
If we were to treat Statement 1 not as part of mathematical exposition, but as a word-for-word transcription of a logic formula, then yes—rather than being equivalent to Statement 2, it indeed contains a free occurrence of each of the variables $m$ and $n,$ and so is an open formula and technically not even a statement.