What is the Proof of the Size of Divisors for Integers?

cariad69 · 2012-03-09T11:32:34+00:00

could anybody help me prove this if a,b,c are integers and b doesn't equal zero if a| b then |a| < | b| in particular any divisors a of a positive divisor b must fall in the interval 1 < a <b

Thread 'About the existence of Hamel basis for vector spaces'

It is well known that a vector space always admits an algebraic (Hamel) basis. This is a theorem that follows from Zorn's lemma based on the Axiom of Choice (AC). Now consider any specific instance of vector space. Since the AC axiom may or may not be included in the underlying set theory, might there be examples of vector spaces in which an Hamel basis actually doesn't exist ?

View full post »

Thread 'About the existence of Hamel basis for vector spaces'

Similar threads

Hot Threads

I How to show ##p(x)=g(x)x\pm 1\in\Bbb{Q}[x]## is irreducible in ##\Bbb{Q}_{\Bbb{Z}}[x]##?

I Showing ##k[x_1,\ldots,x_n]/\mathfrak{a}## is finite dimensional

A Near-Rings with Noncommutative Addition and Two-Sided Distributivity

I How do we distinguish two different notations for cokernel and coimage?

I Localising a non integral domain at a prime

Recent Insights

Insights Why Entangled Photon-Polarization Qubits Violate Bell’s Inequality

Insights Quantum Entanglement is a Kinematic Fact, not a Dynamical Effect

Insights What Exactly is Dirac’s Delta Function? - Insight

Insights Relativator (Circular Slide-Rule): Simulated with Desmos - Insight

Insights Fixing Things Which Can Go Wrong With Complex Numbers

Insights Fermat's Last Theorem