In the field of cryptography, certain protocols rely on the property that specific constants are not rational. Let S S\,S be a constant defined by the equation S2−13=0S^2 - 13 = 0S2−13=0. Given that S>0S > 0S>0, prove by contradiction that S S\,S is an irrational number.
(You may assume that if n2 n^2\,n2 is a multiple of 13, then n n\,n is also a multiple of 13 for any integer nnn.)