Are there types prime factorizations in the sense of primes other than the Fundamental Theorem of Arithmetic (and its generalization to euclidean/principle rings), primary decomposition and Dedekind domains?
2026-04-02 21:50:25.1775166625
Factorization in the Sense of Primes
163 Views Asked by Bumbble Comm https://math.techqa.club/user/bumbble-comm/detail At
1
There are 1 best solutions below
Related Questions in ABSTRACT-ALGEBRA
- Feel lost in the scheme of the reducibility of polynomials over $\Bbb Z$ or $\Bbb Q$
- Integral Domain and Degree of Polynomials in $R[X]$
- Fixed points of automorphisms of $\mathbb{Q}(\zeta)$
- Group with order $pq$ has subgroups of order $p$ and $q$
- A commutative ring is prime if and only if it is a domain.
- Conjugacy class formula
- Find gcd and invertible elements of a ring.
- Extending a linear action to monomials of higher degree
- polynomial remainder theorem proof, is it legit?
- $(2,1+\sqrt{-5}) \not \cong \mathbb{Z}[\sqrt{-5}]$ as $\mathbb{Z}[\sqrt{-5}]$-module
Related Questions in NUMBER-THEORY
- Maximum number of guaranteed coins to get in a "30 coins in 3 boxes" puzzle
- Interesting number theoretical game
- Show that $(x,y,z)$ is a primitive Pythagorean triple then either $x$ or $y$ is divisible by $3$.
- About polynomial value being perfect power.
- Name of Theorem for Coloring of $\{1, \dots, n\}$
- Reciprocal-totient function, in term of the totient function?
- What is the smallest integer $N>2$, such that $x^5+y^5 = N$ has a rational solution?
- Integer from base 10 to base 2
- How do I show that any natural number of this expression is a natural linear combination?
- Counting the number of solutions of the congruence $x^k\equiv h$ (mod q)
Related Questions in PRIME-NUMBERS
- New prime number
- Confirmation of Proof: $\forall n \in \mathbb{N}, \ \pi (n) \geqslant \frac{\log n}{2\log 2}$
- How do I prove this question involving primes?
- What exactly is the definition of Carmichael numbers?
- I'm having a problem interpreting and starting this problem with primes.
- Decimal expansion of $\frac{1}{p}$: what is its period?
- Multiplying prime numbers
- Find the number of relatively prime numbers from $10$ to $100$
- A congruence with the Euler's totient function and sum of divisors function
- Squares of two coprime numbers
Related Questions in PRIME-FACTORIZATION
- For which natural numbers are $\phi(n)=2$?
- Fractions of the form $\frac{a}{k}\cdot\frac{b}{k}\cdot\frac{c}{k}\cdots=\frac{n}{k}$
- (Number of perfect powers ≤ n) ∼ $\sqrt{n}$?
- How do I solve complicated prime factorization problems? (Ex: 20711)
- Is there a pattern to addition of primesFactored numbers?
- Proof of Fundamental Theorem of Arithmetic: Uniqueness Part of Proof
- Find a prime factor of $7999973$ without a calculator
- Proof verification: Let $gcd(x,y)=1$. If $xy$ is a perfect square, then $x$ and $y$ are perfect squares.
- An idea for approaching Brocard's problem ($n!+1=m^2$)
- Looking for complex roots of unity which also happen to be complex primes
Trending Questions
- Induction on the number of equations
- How to convince a math teacher of this simple and obvious fact?
- Find $E[XY|Y+Z=1 ]$
- Refuting the Anti-Cantor Cranks
- What are imaginary numbers?
- Determine the adjoint of $\tilde Q(x)$ for $\tilde Q(x)u:=(Qu)(x)$ where $Q:U→L^2(Ω,ℝ^d$ is a Hilbert-Schmidt operator and $U$ is a Hilbert space
- Why does this innovative method of subtraction from a third grader always work?
- How do we know that the number $1$ is not equal to the number $-1$?
- What are the Implications of having VΩ as a model for a theory?
- Defining a Galois Field based on primitive element versus polynomial?
- Can't find the relationship between two columns of numbers. Please Help
- Is computer science a branch of mathematics?
- Is there a bijection of $\mathbb{R}^n$ with itself such that the forward map is connected but the inverse is not?
- Identification of a quadrilateral as a trapezoid, rectangle, or square
- Generator of inertia group in function field extension
Popular # Hahtags
second-order-logic
numerical-methods
puzzle
logic
probability
number-theory
winding-number
real-analysis
integration
calculus
complex-analysis
sequences-and-series
proof-writing
set-theory
functions
homotopy-theory
elementary-number-theory
ordinary-differential-equations
circles
derivatives
game-theory
definite-integrals
elementary-set-theory
limits
multivariable-calculus
geometry
algebraic-number-theory
proof-verification
partial-derivative
algebra-precalculus
Popular Questions
- What is the integral of 1/x?
- How many squares actually ARE in this picture? Is this a trick question with no right answer?
- Is a matrix multiplied with its transpose something special?
- What is the difference between independent and mutually exclusive events?
- Visually stunning math concepts which are easy to explain
- taylor series of $\ln(1+x)$?
- How to tell if a set of vectors spans a space?
- Calculus question taking derivative to find horizontal tangent line
- How to determine if a function is one-to-one?
- Determine if vectors are linearly independent
- What does it mean to have a determinant equal to zero?
- Is this Batman equation for real?
- How to find perpendicular vector to another vector?
- How to find mean and median from histogram
- How many sides does a circle have?
Absolutely, but then it becomes essential to distinguish between irreducible and primes, as they are not always the same.
For a non-unit number to be irreducible, it's enough that it's not the product of two other non-unit numbers. But for it to be prime, it must be divide at least one factor of any product that it's a divisor of.
For example, in $\mathbb Z[\sqrt{10}]$, we see that 2, 3, $2 - \sqrt{10}$ and $2 + \sqrt{10}$ are all irreducible but not prime, since $2 \times 3 = (-1)(2 - \sqrt{10})(2 + \sqrt{10}) = 6$, yet in this ring $2 \nmid (2 \pm \sqrt{10})$, $3 \nmid (2 \pm \sqrt{10})$.
However, 7 is prime in this domain. You can find nonzero multiples of 7 with more than one factorization, but in every case you will find 7 irreducible in those factorizations.
Not quite sure if that's what you're looking for. Maybe this: a domain "smaller" than $\mathbb Z$, which consists solely of positive integers of the form $4k + 1$. If we start with $\mathbb Z^+$, we remove integers of the forms $4k$, $4k + 2$ and $4k + 3$ so that we are left with 1, 5, 9, 13, 17, 21, 25, 29, etc.
Clearly 1089 is composite in this domain. Its prime factorization is $3^2 \times 11^2$. Oops, that's wrong, since neither 3 nor 11 is of the form $4k + 1$. Instead it's factorizations are $9 \times 121 = 33^2$. Therefore 9, 33 and 121 are all irreducible but not prime.
For a number to be prime and irreducible in this domain, it has to be a prime of the form $4k + 1$ in $\mathbb Z$. So 5 is prime and irreducible in this domain, sometimes called $\mathcal S$. We see, for example, that 2205 has more than one distinct factorization in this domain, but the blame for that goes to 441, not 5.
And here is one where things get really trippy: the finite $\mathbb Z_{10}$, consisting entirely of 0, 1, 2, 3, 4, 5, 6, 7, 8, 9. Addition and multiplication are adjusted to keep arithmetic within $\mathbb Z_{10}$, e.g., $5 + 5 = 0$. Then 5 is prime but not irreducible, as $5 = 5^2 = 5^3 = 5^4 = \ldots$