Multiplying any integer with any prime

  • Context: Undergrad 
  • Thread starter Thread starter ull
  • Start date Start date
  • Tags Tags
    Integer Prime
Click For Summary

Discussion Overview

The discussion revolves around the properties of multiplying an integer by a prime number, specifically whether the product retains prime factors only from the integer and the prime itself. The scope includes theoretical aspects of number theory and the fundamental theorem of arithmetic.

Discussion Character

  • Technical explanation, Conceptual clarification, Debate/contested

Main Points Raised

  • One participant questions if there is a proof that the product of an integer and a prime number contains no prime factors other than those from the integer and the prime itself.
  • Another participant suggests that this is a result of the fundamental theorem of arithmetic.
  • Some participants assert that since a prime number can only be divided by 1 and itself, no two numbers can equal a prime number, indicating a potential misunderstanding of the question.
  • There is a mention that the fundamental theorem of arithmetic could provide the desired result, but the exact nature of the proof is not detailed.

Areas of Agreement / Disagreement

Participants express differing views on the clarity of the original question and the relevance of the fundamental theorem of arithmetic, indicating some confusion about the proof's application. The discussion remains unresolved regarding the specific proof sought by the original poster.

Contextual Notes

There is uncertainty about the terminology and the specific proof being referenced, as well as potential misunderstandings of the implications of prime factorization in the context of multiplication.

ull
Messages
6
Reaction score
0
PS. I don't speak or write english very well. I´m doing my best. Is it still ok to post questions?

a = any integer
b = any prime number

a * b = c

Is there a proof that "c" isn't made up by any other prime factors than the prime factors that make up "a" (except for "b")?
 
Mathematics news on Phys.org
ull said:
PS. I don't speak or write english very well. I´m doing my best. Is it still ok to post questions?

a = any integer
b = any prime number

a * b = c

Is there a proof that "c" isn't made up by any other prime factors than the prime factors that make up "a" (except for "b")?
It's a result of the fundamental theorem of arithmetic. :wink:
 
  • Like
Likes   Reactions: 1 person
Sinse a prime number can only be divided by 1 and itself, no two numbers can ever equal a prime number. I don't know what the proof is called though. I think the OP wants to know the name of the actual law/proof.
 
MathJakob said:
Sinse a prime number can only be divided by 1 and itself, no two numbers can ever equal a prime number. I don't know what the proof is called though. I think the OP wants to know the name of the actual law/proof.

As Mandelbroth said, the proof is the fundamental theorem of arithmetic, from which the OP's desired result follows immediately.
 

Similar threads

  • · Replies 1 ·
Replies
1
Views
2K
Replies
7
Views
2K
  • · Replies 3 ·
Replies
3
Views
1K
  • · Replies 4 ·
Replies
4
Views
2K
  • · Replies 9 ·
Replies
9
Views
3K
  • · Replies 7 ·
Replies
7
Views
2K
  • · Replies 43 ·
2
Replies
43
Views
7K
  • · Replies 1 ·
Replies
1
Views
3K
Replies
9
Views
3K
Replies
5
Views
2K