Proving the Salvage of a Divisibility Statement with Relatively Prime Numbers

  • Thread starter Thread starter DrAlexMV
  • Start date Start date
  • Tags Tags
    Proof
DrAlexMV
Messages
24
Reaction score
0
In my Discrete Mathematics class we are are covering divisibility. One of the problems that the professor covered (quite terribly) is the following:

Homework Statement



Prove or salvage:

If a|bc, then a|b.

Homework Equations



Relevant concepts:

Relatively prime numbers
Divisibility

The Attempt at a Solution



I know that the statement is wrong as it is. I also know that in order to salvage the statement, I must say that a and c are relatively prime. The problem is that I do not know how to rigorously prove this.

Could somebody guide me in how to do this. Teach a man to fish!
 
Physics news on Phys.org
Use the following fact: If gcd(a,c)=1, then ax+cy=1 for some integers x,y.
 
Prove $$\int\limits_0^{\sqrt2/4}\frac{1}{\sqrt{x-x^2}}\arcsin\sqrt{\frac{(x-1)\left(x-1+x\sqrt{9-16x}\right)}{1-2x}} \, \mathrm dx = \frac{\pi^2}{8}.$$ Let $$I = \int\limits_0^{\sqrt 2 / 4}\frac{1}{\sqrt{x-x^2}}\arcsin\sqrt{\frac{(x-1)\left(x-1+x\sqrt{9-16x}\right)}{1-2x}} \, \mathrm dx. \tag{1}$$ The representation integral of ##\arcsin## is $$\arcsin u = \int\limits_{0}^{1} \frac{\mathrm dt}{\sqrt{1-t^2}}, \qquad 0 \leqslant u \leqslant 1.$$ Plugging identity above into ##(1)## with ##u...
There are two things I don't understand about this problem. First, when finding the nth root of a number, there should in theory be n solutions. However, the formula produces n+1 roots. Here is how. The first root is simply ##\left(r\right)^{\left(\frac{1}{n}\right)}##. Then you multiply this first root by n additional expressions given by the formula, as you go through k=0,1,...n-1. So you end up with n+1 roots, which cannot be correct. Let me illustrate what I mean. For this...
Back
Top