Julio1
- 66
- 0
Show that $(\forall x\in \mathbb{R})(\exists p\in \mathbb{Z}):\, p\le x\le p+1.$Hello :). The Hint is use the Axiom of Archimedes and the Principle of Well Order
The discussion centers on the application of the Axiom of Archimedes to demonstrate the existence of integers within any real number interval, specifically proving that for any real number \( x \), there exists an integer \( p \) such that \( p \leq x \leq p + 1 \). The scope includes mathematical reasoning and exploration of foundational principles in real analysis.
Participants express some confusion regarding the reasoning behind the definition of the set \( S \) and its implications, indicating that the discussion remains unresolved on this point.
The discussion does not resolve the assumptions underlying the definition of the set \( S \) or the application of the Axiom of Archimedes, leaving these aspects open for further exploration.
Julio said:Show that $(\forall x\in \mathbb{R})(\exists p\in \mathbb{Z}):\, p\le x\le p+1.$Hello :). The Hint is use the Axiom of Archimedes and the Principle of Well Order
Julio said:Thanks :)
But how conclude that $n\ge x-1$? I don't understand :(