Multiplying any integer with any prime

  • Thread starter Thread starter ull
  • Start date Start date
  • Tags Tags
    Integer Prime
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 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.
 
Insights auto threads is broken atm, so I'm manually creating these for new Insight articles. In Dirac’s Principles of Quantum Mechanics published in 1930 he introduced a “convenient notation” he referred to as a “delta function” which he treated as a continuum analog to the discrete Kronecker delta. The Kronecker delta is simply the indexed components of the identity operator in matrix algebra Source: https://www.physicsforums.com/insights/what-exactly-is-diracs-delta-function/ by...
Fermat's Last Theorem has long been one of the most famous mathematical problems, and is now one of the most famous theorems. It simply states that the equation $$ a^n+b^n=c^n $$ has no solutions with positive integers if ##n>2.## It was named after Pierre de Fermat (1607-1665). The problem itself stems from the book Arithmetica by Diophantus of Alexandria. It gained popularity because Fermat noted in his copy "Cubum autem in duos cubos, aut quadratoquadratum in duos quadratoquadratos, et...
I'm interested to know whether the equation $$1 = 2 - \frac{1}{2 - \frac{1}{2 - \cdots}}$$ is true or not. It can be shown easily that if the continued fraction converges, it cannot converge to anything else than 1. It seems that if the continued fraction converges, the convergence is very slow. The apparent slowness of the convergence makes it difficult to estimate the presence of true convergence numerically. At the moment I don't know whether this converges or not.
Back
Top