All public logs

Combined display of all available logs of arguably.io. You can narrow down the view by selecting a log type, the username (case-sensitive), or the affected page (also case-sensitive).

• 04:41, 23 January 2022 PapiChulo talk contribs created page Every rational number has an irreducible representation (Created page with "'''Every rational number has an irreducible representation''' is a claim in number theory that all rational numbers must have a representation where the numerator and denominator cannot be further reduced. '''Proof''' Suppose one has a rational number m/n that is reducible. We can assume n≥1 (divide the numerator and denominator by −1 otherwise). Take an integer k≥2 which divides both of m and n, and so m′=m/k and n′=n/k are smaller integers satisfying m...")