Proof of the Existence of Integer Solutions for $(f_1)^2 + (f_2)^2 +( f_3)^2... = I^2$ 
Using fractions($f_n$) where integer $n$ is the number of fractions, prove that the sum of the squares $f_1$ to $f_n$ has no integer($I$) solutions when $n >=  1$ given each fraction has a distinct positive integer numerator and denominator and every fraction is a fully simplified non integer:

$$\left(f_1\right)^2 + \left(f_2\right)^2 + \left(f_3\right)^2 ...  =  I^2$$
I could not find a proof, but using distinct positive integers $a,b,c,d,e,f$ I managed to prove this for the case of
$$\left(\frac{a}{b}\right)^2 + \left(\frac{c}{d}\right) ^2 = \left(\frac{e}{f}\right)^2 $$
by simplifying:
$$\frac{(ad)^2 + (bc)^2}{(bd)^2}  = (\frac{e}{f})^2 $$
Since $(ad)^2 + (bc)^2$  must satisfy a Pythagorean triple, we know that each side length(excluding the hypotenuse) must be the product of two distinct integers, which can be proven through Euclid's formula :
$$ac = (2m)(n)$$
$$bd = (m -n)(m + n)$$
Q.E.D.
Although this still did not prove useful to answering my question, I later found a proof that the sum of the sqaures $f_1$ to $f_2$ has no integer solutions using distinct positive integers $a,b,c,d$ where $(\frac{a}{b})^2 +  (\frac{c}{d} ) ^2 = I^2 $   using the following:
$$\frac {a^2}{b^2} = \frac {I^2d^2 - c^2}{d^2}$$
Both sides are in their simplest form since
$$\gcd(a^2,b^2) = 1 = \gcd(c^2,d^2) = \gcd(I^2d^2 - c^2, d^2)$$
so $a^2 = e^2d^2-c^2, b^2 = d^2$.
Given $b,d > 0$, $b=d$. Therefore no solutions exists.
But this lead me to question what if there were more than $2$ integer fractions? This would mean that
the denominator of some integer fraction could be the product of $2$ or more distinct integers, which suggests that this proof which uses $b = d$ does not nesscacarily need to be true for there to be an integer solution where $n > 2$.

So I made a conjecture that there are no integer solutions for the sum of any number of squared fractions where the numerator and denominator are distinct positive integers and the fractions are fully simplified non-integers.

Edit:
This turned out to be false,
New questions:

Provide a proof


A method to finding integer solutions

(The one that finds the most affective method will be more likely to receive the bounty)

This proof is INVALID, but pieces of it might give insights to the forms of solutions...

In fact as long as just the denominators are distinct, the sum of squares is never an integer, so it can't be the square of an integer.
Let's call the fractions $\frac{a_i}{b_i}$, where $a_i, b_i \in \mathbb{N}, b_i \geq 2$, and we require that for each index $i$, $\gcd(a_i,b_i)=1$ and for all index pairs $i \neq j$ that $b_i \neq b_j$. We look for solutions where:
$$S = \sum_{i=1}^n \frac{a_i^2}{b_i^2} \in \mathbb{Z}$$
Suppose by way of contradiction that the set of such solutions is not empty. Let $N$ be the smallest count with at least one solution using exactly $n=N$ fractions in this set. Then let $B$ be the smallest positive integer which appears as a denominator $b_i$ in any solution of size $N$.
Consider a "minimal" solution which has $n=N$ and has $b_i=B$ for some $i$. Let $p$ be a prime factor of $B$ (which is at least $2$). Let $\beta$ be the set of denominators $b_i$ which are a multiple of $p$. This is not the empty set since $p \mid B \Rightarrow B \in \beta$. If $\beta$ is the entire set $\{b_1, \ldots b_N\}$, then we have
$$ \sum_{i=1}^N \frac{a_i^2}{(b_i/p)^2} = p^2 \sum_{i=1}^N \frac{a_i^2}{b_i^2} = p^2 S \in \mathbb{Z} $$
is a solution with the same $N$, and one of the denominators is $B/p$, but this contradicts the choice of $B$ as the smallest denominator in any solution of size $N$.
If $\beta$ is not the entire set $\{b_1, \ldots b_N\}$, then the set difference $\beta^c = \{b_1, \ldots b_N\} \setminus \beta$ is not empty. The least common multiples of these two subsets of denominators satisfy $p \mid \mathop{\rm lcm}(\beta)$ and $p \nmid \mathop{\rm lcm}(\beta^c)$. Splitting the sum $S$ over these two subsets:
$$ S = \sum_{b_i \in \beta} \frac{a_i^2}{b_i^2} 
+ \sum_{b_i \in \beta^c} \frac{a_i^2}{b_i^2} \\
S (\mathop{\rm lcm} \beta^c)^2 = \sum_{b_i \in \beta} \frac{a_i^2 (\mathop{\rm lcm} \beta^c)^2}{b_i^2} + \sum_{b_i \in \beta^c} a_i^2 \left(\frac{\mathop{\rm lcm} \beta^c}{b_i}\right)^2 \\
\sum_{b_i \in \beta} \left(\frac{a_i \mathop{\rm lcm}(\beta^c)}{b_i}\right)^2 = S (\mathop{\rm lcm} \beta^c)^2 - \sum_{b_i \in \beta^c} a_i^2 \left(\frac{\mathop{\rm lcm} \beta^c}{b_i}\right)^2 \in \mathbb{Z} $$
For each addend term in the left side, $p \mid b_i$ by definition of $\beta$. Since $\gcd(a_i, b_i) = 1$, $p \nmid a_i$, and we already noted $p \nmid \mathop{\rm lcm}(\beta^c)$. So the fraction is not an integer. Every $b_i$ in these fractions is a distinct integer, since they're a subsequence of the entire sequence of $N$ different $b_i$. Therefore the left side is a solution to the problem with $n = |\beta| < N$, contradicting the choice of $N$ as minimal.

EDIT: Here's the error. The $b_i$ values are distinct, but they are not necessarily the denominators of the new fractions when reduced to lowest form. The actual reduced denominators could duplicate some values, meaning the formula is not another solution to the problem as I modified it.

All possibilities lead to contradiction, so there are no solutions at all.
