Square-free element
In mathematics, a square-free element is an element r of a unique factorization domain R that is not divisible by a non-trivial square. This means that every s such that is a unit of R.
Alternate characterizations
Square-free elements may be also characterized using their prime decomposition. The unique factorization property means that a non-zero non-unit r can be represented as a product of prime elements
Then r is square-free if and only if the primes pi are pairwise non-associated (i.e. that it doesn't have two of the same prime as factors, which would make it divisible by a square number).
Examples
Common examples of square-free elements include square-free integers and square-free polynomials.
gollark: AQA assembly language is some sort of weird ARM derivative with 13 registers and 1024 words of RAM.
gollark: So the obvious solution is to save time and compile into it.
gollark: We are doing assembly programming in computer science and I dislike their language.
gollark: How quickly can a C compiler be written/retargeted for a bizarre architecture?
gollark: https://github.com/kelseyhightower/nocode
See also
References
- David Darling (2004) The Universal Book of Mathematics: From Abracadabra to Zeno's Paradoxes John Wiley & Sons
- Baker, R. C. "The square-free divisor problem." The Quarterly Journal of Mathematics 45.3 (1994): 269-277.
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.