(pdf)
(pdf)

Knot energies and knot invariants
Knot energies and knot invariants

On the prime counting function and the partial sum of reciprocals of
On the prime counting function and the partial sum of reciprocals of

... then k cannot be a composite. Therefore, k must be a prime. In example 1 page 3, the sorted list L = {85, 87, 91}, this means c1 = 85 is the smallest odd composite that is greater than n = 81. Now since there is a gap between n and c1 wide enough to hold one odd integer, we say that the odd integer ...
ASSOCIATIVE GEOMETRIES. I: GROUDS, LINEAR RELATIONS
ASSOCIATIVE GEOMETRIES. I: GROUDS, LINEAR RELATIONS

13(4)
13(4)

Mathematics Course 111: Algebra I Part II: Groups
Mathematics Course 111: Algebra I Part II: Groups

the rigidity of graphs - American Mathematical Society
the rigidity of graphs - American Mathematical Society

Homotopy theory and generalized duality for spectral
Homotopy theory and generalized duality for spectral

On some problems in computable topology
On some problems in computable topology

Symbolic Powers of Edge Ideals - Rose
Symbolic Powers of Edge Ideals - Rose

Fell bundles associated to groupoid morphisms
Fell bundles associated to groupoid morphisms

An introduction to the algorithmic of p-adic numbers
An introduction to the algorithmic of p-adic numbers

Chapter 8 The Log-Euclidean Framework Applied to
Chapter 8 The Log-Euclidean Framework Applied to

Modal Decomposition on Nondeterministic Probabilistic Processes
Modal Decomposition on Nondeterministic Probabilistic Processes

Introduction to Functions
Introduction to Functions

Group Theory
Group Theory

Equivalence Relations and Partial Orders ()
Equivalence Relations and Partial Orders ()

UNSOLVED PROBLEMS SOME UNSOLVED PROBLEMS by In this
UNSOLVED PROBLEMS SOME UNSOLVED PROBLEMS by In this

Picard Groups of Affine Curves Victor I. Piercey University of Arizona Math 518
Picard Groups of Affine Curves Victor I. Piercey University of Arizona Math 518

On minimal colorings without monochromatic solutions to a linear
On minimal colorings without monochromatic solutions to a linear

Square Roots and the - Mr. Souza Algebra Readiness
Square Roots and the - Mr. Souza Algebra Readiness

3 Lecture 3: Spectral spaces and constructible sets
3 Lecture 3: Spectral spaces and constructible sets

Dual Banach algebras
Dual Banach algebras

The lecture notes in PDF (version August 2016)
The lecture notes in PDF (version August 2016)

Factor This - Yeah, math, whatever.
Factor This - Yeah, math, whatever.

Fundamental theorem of algebra

The fundamental theorem of algebra states that every non-constant single-variable polynomial with complex coefficients has at least one complex root. This includes polynomials with real coefficients, since every real number is a complex number with an imaginary part equal to zero.Equivalently (by definition), the theorem states that the field of complex numbers is algebraically closed.The theorem is also stated as follows: every non-zero, single-variable, degree n polynomial with complex coefficients has, counted with multiplicity, exactly n roots. The equivalence of the two statements can be proven through the use of successive polynomial division.In spite of its name, there is no purely algebraic proof of the theorem, since any proof must use the completeness of the reals (or some other equivalent formulation of completeness), which is not an algebraic concept. Additionally, it is not fundamental for modern algebra; its name was given at a time when the study of algebra was mainly concerned with the solutions of polynomial equations with real or complex coefficients.