Is a Prime Number Always a Factor of a Product of Integers?

  • Thread starter Thread starter liangiecar
  • Start date Start date
  • Tags Tags
    Prime
liangiecar
Messages
2
Reaction score
0
How to proof?
A prime number p is a factor of a non-zero product of integers a*b if and only if it is a facotr of a and/or b.
 
Physics news on Phys.org
The "if" direction is obvious. For the "only if", you need to use the fundamental theorem of arithmetic. Because a*b has a unique prime decomposition, if a prime p divides a*b then it must be one of the primes in the decomposition. The prime decomposition of a*b is just the product of the decompositions of a and b, so p must divide a and/or b.

This sounds like a homework question! In which case you will need to be a lot more rigorous when you write it out.
 
Last edited:
One side is trivial: if p is a factor of a and/or b, then it is clearly a factor of a * b.

For the converse implication, the easiest way I can think of is using the unique decomposition of any integer into its prime factors.
 
thx,guys
 
Caution. Some proofs of unique factorization may use this property of primes. And then it would be illegitimate to use unique factorization in the proof of this...
 
assume p is a factor of ab. then p|ab. since p is prime, euclid's lemma says p|a and/or p|b, thus p is a factor of a and/or b.
 

Thread 'Trouble understanding an online solution to an exercise in Dummit & Foote'

##\textbf{Exercise 10}:## I came across the following solution online: Questions: 1. When the author states in "that ring (not sure if he is referring to ##R## or ##R/\mathfrak{p}##, but I am guessing the later) ##x_n x_{n+1}=0## for all odd $n$ and ##x_{n+1}## is invertible, so that ##x_n=0##" 2. How does ##x_nx_{n+1}=0## implies that ##x_{n+1}## is invertible and ##x_n=0##. I mean if the quotient ring ##R/\mathfrak{p}## is an integral domain, and ##x_{n+1}## is invertible then...
View full post »

Thread 'Questions about non existence of GCDs vs (coimages, cokernels)'

The following are taken from the two sources, 1) from this online page and the book An Introduction to Module Theory by: Ibrahim Assem, Flavio U. Coelho. In the Abelian Categories chapter in the module theory text on page 157, right after presenting IV.2.21 Definition, the authors states "Image and coimage may or may not exist, but if they do, then they are unique up to isomorphism (because so are kernels and cokernels). Also in the reference url page above, the authors present two...
View full post »

Thread 'Decomposition into irreps of compact Lie group'

When decomposing a representation ##\rho## of a finite group ##G## into irreducible representations, we can find the number of times the representation contains a particular irrep ##\rho_0## through the character inner product $$ \langle \chi, \chi_0\rangle = \frac{1}{|G|} \sum_{g\in G} \chi(g) \chi_0(g)^*$$ where ##\chi## and ##\chi_0## are the characters of ##\rho## and ##\rho_0##, respectively. Since all group elements in the same conjugacy class have the same characters, this may be...
View full post »

Similar threads

I Localising a non integral domain at a prime
Replies
17
Views
1K
I How to show ##p(x)=g(x)x\pm 1\in\Bbb{Q}[x]## is irreducible in ##\Bbb{Q}_{\Bbb{Z}}[x]##?
Replies
48
Views
3K
I Fundamental theorem of arithmetic from Jordan-Hölder theorem
Replies
5
Views
2K
I Irreducible polynomials and prime elements
Replies
5
Views
2K
For ## n>1 ##, show that every prime divisor of ## n+1 ## is an odd integer
Replies
9
Views
2K
I ##(A/\mathfrak{a})_{\mathfrak{p}/\mathfrak{a}}## and its isomorphism?
Replies
31
Views
1K
I How to Prove a Congruence Relation for Prime Numbers?
Replies
17
Views
2K
An integer n>1 is square-free if and only if?
Replies
13
Views
4K
B Probability that 2 distinct integers are divisible by the same number
Replies
9
Views
2K
B Are All Imaginable Integer Series Necessarily Infinite?
Replies
17
Views
2K

Hot Threads

Recent Insights

Back
Top