Results 1 to 2 of 2

Math Help - division proof help

  1. #1
    Super Member
    Joined
    Sep 2008
    Posts
    560

    division proof help

    1. a,b and c are integers such that a|b and b|c. Prove that a^2 |(b^2 +bc).






    if a|b than

     b = ma for some m in the integers

    if b|c

     c = nb for some n in the integers,

    I know I need to show that if  a^{2} | (b^{2} + bc)

    than

     b^{2} + bc =  k a^{2} for some k in integers.

     b^{2} + bc = m^{2}a^{2} + ma nb

    really stuck from here, not such if my working is correct so far either,


    any help appreciated.
    Follow Math Help Forum on Facebook and Google+

  2. #2
    Junior Member
    Joined
    Sep 2013
    From
    United States
    Posts
    58
    Thanks
    1

    Re: division proof help

    Try substituting ma for b in your last equation on the right side
    Follow Math Help Forum on Facebook and Google+

Similar Math Help Forum Discussions

  1. Euclid Division Lemma proof.
    Posted in the Discrete Math Forum
    Replies: 0
    Last Post: April 11th 2012, 03:35 PM
  2. Polynomial division vs synthetic division
    Posted in the Algebra Forum
    Replies: 2
    Last Post: April 9th 2009, 05:49 AM
  3. Division
    Posted in the Number Theory Forum
    Replies: 6
    Last Post: October 15th 2008, 08:32 PM
  4. Division proof
    Posted in the Number Theory Forum
    Replies: 2
    Last Post: April 4th 2008, 07:34 PM
  5. Division proof
    Posted in the Number Theory Forum
    Replies: 4
    Last Post: January 24th 2008, 12:19 PM

Search Tags


/mathhelpforum @mathhelpforum