Total weight of every cycle is even if and only if the total weight of every triangle is even. Integer weights are written on the edges of a complete graph. Prove that the total weight of every cycle is even if and only if the total weight of every triangle is even.
Is there any hints on how to get started here?

It is obvious that if every cycle has even total weight, then so does any triangle.  
For the other direction, suppose to the contrary that the total weight of each triangle is even, but there is a cycle with odd total weight. Then there is a shortest cycle $\mathcal{C}$ with odd total weight. 
Cycle $\mathcal{C}$ has length $\ge 4$. Let $p$, $q$, and $r$ be consecutive vertices on this cycle. 
The cycle obtained from $\mathcal{C}$ by deleting vertex $q$, and replacing the edges $pq$ and $qr$ by the edge $pq$, is a cycle $\mathcal{C}'$ shorter than $\mathcal{C}$.  By the minimality assumption, the total weight of $\mathcal{C}'$ is even.
For any edge $uv$, let $W(u,v)$ be the weight of $uv$. 
Let the weight of $\mathcal{C}$ be $W(\mathcal{C})$, and the weight of $\mathcal{C}'$ be $W(\mathcal{C}')$.
We have 
$$
\begin{align}W(\mathcal{C})&=W(\mathcal{C}')+W(p,q)+W(q, r)-W(p,r)\\
&= W(\mathcal{C}')+W(p,q)+W(q,r)+W(p,r) -2W(p,r).\end{align}\tag{$1$}$$
But $W(\mathcal{C}')$ is even. Also, $W(p,q)+W(q,r)+W(p,r)$ is even, since it is the sum of the edge weights of a triangle.  And  of course $2W(p,r)$ is even. 
Thus the right-hand side of $(1)$ is even, contradicting the fact that $W(\mathcal{C})$ is odd.  
Remark: It is straightforward to recast the above argument as a conventional induction argument. 
