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).

• 22:19, 23 January 2022 Beijayl talk contribs created page Prime factorization is unique (Created page with "'''Prime factorization is unique''' is, in the context of the integers, part of the fundamental theorem of arithmetic. But the claim can be proven more generally in the context of abstract algebra. The uniqueness here refers to uniqueness except for multiplication with a unit. In the case of the integers the units are <math>1</math> and <math>-1</math>, so <math>6=2\cdot 3 = (-2)\cdot (-3)</math> is considered a unique factorization even though <math>-2, -3</math> als...")
• 20:11, 23 January 2022 Beijayl talk contribs created page If a prime divides a product it divides one of the factors (Created page with "'''If a prime <math>p</math> divides a product <math>ab</math> it also divides either <math>a</math> or <math>b</math>''', also called '''Euclid's lemma''', is a classic result in number theory. ==Proof== Suppose <math>p</math> divides <math>ab</math> but doesn't divide <math>b</math>. Then <math>p</math> and <math>b</math> are co-prime, so their greatest common divisor is one. Bézout's lemma ensures that there are integers <math>x\text{, }y</math> such that <math>p...")
• 03:08, 20 January 2022 Beijayl talk contribs created page Talk:Pi is transcendental (Created page with "I wasn't sure how much detail to include here since it's all quite technical ~~~~")
• 01:46, 19 January 2022 Beijayl talk contribs created page Any integer bigger than 1 is the multiple of a prime (Created page with "'''Any integer bigger than 1 is the multiple of a prime''' is a basic result in number theory, which can be proved by Reductio ad absurdum. Assume there are integers big...")
• 01:48, 18 January 2022 User account Beijayl talk contribs was created