Newbetuts

Critique my proof of: For every integer $x$, the remainder when $x^2$ is divided by $4$ is either $0$ or $1$

Difficulty in Mathematical Writing

Are there any generic thinking approaches for providing mathematical proofs to a given theorem

When is a proof or definition formal?

Every finite set contains its supremum: proof improvement.

Can an algorithm be part of a proof?

Critique my proof of: For every real number x, if $x^2 \geq x$, then either $x \leq 0 \lor x \geq 1$.

Can a proof be just words? [closed]

Proving the set of the strictly increasing sequences of natural numbers is not enumerable.

How to negate a conditional statement with the term "either"

Proving rigorously the supremum of a set

Critique my proof of: Suppose $F$ and $G$ are families of sets, and $F \cap G \neq \varnothing$. Then $\bigcap F \subseteq \bigcup G$.

What does the "$\exists !$" modified quantifier mean in mathematical proof? eg, "$\exists\ !x \ P(x)$"

What are some good introductory books on mathematical proofs?

How to translate mathematical intuition into a rigorous proof?

Formal proof of $\lim_{x\to a}f(x) = \lim_{h\to 0} f(a+h)$ [closed]

Could someone give a detailed (yet elementary) proof for Jensen's inequality?

New posts in proof-writing

Prove that the directrix-focus and focus-focus definitions are equivalent

Prove $P(\emptyset)=\{\emptyset\}$ where $P(\emptyset)$ is the power set of the empty set.

Proofs in Real Analysis are too 'convenient'

Critique my proof of: For every integer $x$, the remainder when $x^2$ is divided by $4$ is either $0$ or $1$

Difficulty in Mathematical Writing

Are there any generic thinking approaches for providing mathematical proofs to a given theorem

When is a proof or definition formal?

Every finite set contains its supremum: proof improvement.

Can an algorithm be part of a proof?

Critique my proof of: For every real number x, if $x^2 \geq x$, then either $x \leq 0 \lor x \geq 1$.

Can a proof be just words? [closed]

Proving the set of the strictly increasing sequences of natural numbers is not enumerable.

How to negate a conditional statement with the term "either"

Proving rigorously the supremum of a set

Critique my proof of: Suppose $F$ and $G$ are families of sets, and $F \cap G \neq \varnothing$. Then $\bigcap F \subseteq \bigcup G$.

What does the "$\exists !$" modified quantifier mean in mathematical proof? eg, "$\exists\ !x \ P(x)$"

What are some good introductory books on mathematical proofs?

How to translate mathematical intuition into a rigorous proof?

Formal proof of $\lim_{x\to a}f(x) = \lim_{h\to 0} f(a+h)$ [closed]

Could someone give a detailed (yet elementary) proof for Jensen's inequality?