Oh I really need to put it in the numerator and show it ? I didn't know that !

How many steps to put in is not a fixed thing. You have to demonstrate that your proof is rigorous. If there's marks in it, I would 'err' on the side of caution and put in too many rather than too few. No one can complain at that.

Bob

]]>We have shown that such factorization exists which can make the equation equal :

1*1/1*1-0*x/1*1=+1/1*1*1*1

which results in 1-0=1

The other one is :

0*x/1*1-1*1/1*1=-1/1*1*1*1

0-1=-1

I don't know if there exists other ways of 1 or -1, but anyway, this is out of the context of the inital problem.

]]>because ovisously we could have 1*1/1*1-0*x/1*1=1/1*1*1*1

Which is one example of such a factorization that exists.

]]>The ************* is missing a simplification of fractions to show where the LN has gone. It's fairly obvious but I would have put it in.

Bob

]]>So :

a/b-c/d=+-1/bd

xi/xj-c/d = +-1/((xj)*d)

(i/j-c/d=+-1/xj*d) * jd

id-jc not =l +-1/x

except for 1 and -1

The same is done for the second fractions on the left side.

]]>For the *****, I'm not sure what you're referring to... I shall add more later on.

]]>I couldn't follow this because of the way you had set out your proof. So, I've converted the fractions, taken out the * and written L instead of l.

I have added some words in red that make it clearer to me what you are doing.

In a proof by contradiction you may put equals even though you are hoping to show that the two sides are not equal. So you may replace "equality to be determined" by "=".

Instead of the word "let" you could put "suppose".

At the line of ************* I think you need to add one more step.

After my word But you need to justify why these expressions cannot be equal.

Bob

Now, reduce the common numbers :

We must now prove that the left hand side has irreductible fractions. Lets see what would happen if these fraction were reductible.

let

Reduce and multiply by Ln:

***************

But

We have considered the initial fractions to be reductible and have arrived at a false result. An integer cannot be equal to (+-1/z*p)

So, the initial fractions must be irreductible.

]]>http://postimg.org/image/buax1y1sd/

ad/bd-bc/bd=+-1/bd is neighbor fraction

Now, reduce the common numbers :

a/b-c/d=+-1/bd

We must now prove that the left hand side has irreductible fractions. Lets see what would happen if these fraction were reductible.

let a=z*y , b=z*l , c=p*m d=p*n

z*y/z*l-p*m/p*n equality to be determined +-1/(z*l)*(p*n)

Reduce:

*ln (y/l-m/n) equality to be determined (+-1/(z*l)*(p*n))*ln

yn-lm equality to be determined +-1/z*p

yn-lm not= +-1/z*p

We have considered the initial fractions to be reductible and have arrived at a false result. An integer cannot be equal to (+-1/z*p)

So, the initial fractions must be irreductible.

*Of course, I'm considering the variables to represents integers.

]]>