Hey there! Sign in to join this conversationNew here? Join for free
    • Thread Starter
    Offline

    2
    ReputationRep:
    Does (n + a) | (bn + (a-c)), where a, b and c are known, a,b,c, \in \mathbb{N}, and n \not = 0, a\not = 0, a\not = c, ever have any solutions when gcd(b,a-c) = 1?

    For example, could I infer that (n+2008)|(2n + 2007) can only be true for n=c=1 or not? (Or is it even true?)
    Offline

    2
    ReputationRep:
    Well, I would first deduce that n + 2008 divides n - 1. But n + 2008 > n - 1, so we conclude that n \le 1, since there are no multiples of n + 2008 between 0 and n - 1. But n \in \mathbb{N}, so n = 1.
    • Thread Starter
    Offline

    2
    ReputationRep:
    Thank you, that completes my rather shoddy proof, but is it true in general?
    Offline

    0
    ReputationRep:
    Somehow I've made it through infant school, primary school, secondary school and up to my A2s without knowing how to do division on paper... so looking at that makes me brick myself
    • Wiki Support Team
    Offline

    14
    ReputationRep:
    Wiki Support Team
    (Original post by rupertj)
    Does (n + a) | (bn + (a-c)), where a, b and c are known, a,b,c, \in \mathbb{N}, and n \not = 0, a\not = 0, a\not = c, ever have any solutions when gcd(b,a-c)\not = 1?
    n + 8 | 2n + 4 (a = 8, b = 2, c = 4, so gcd(b, a-c) = 2) has a solution n = 4.
    • Thread Starter
    Offline

    2
    ReputationRep:
    (Original post by generalebriety)
    n + 8 | 2n + 4 (a = 8, b = 2, c = 4, so gcd(b, a-c) = 2) has a solution n = 4.
    Apologies, I meant gcd(b,a-c)=1, rather than 'is not equal to'.

    I've edited it now.
    • Wiki Support Team
    Offline

    14
    ReputationRep:
    Wiki Support Team
    (Original post by rupertj)
    Apologies, I meant gcd(b,a-c)=1, rather than 'is not equal to'.

    I've edited it now.
    Ok. n+7|3n+2 (a=7, b=3, c=5, so gcd(b, a-c) = 1) has solution n=12.
    • Thread Starter
    Offline

    2
    ReputationRep:
    (Original post by generalebriety)
    Ok. n+7|3n+2 (a=7, b=3, c=5, so gcd(b, a-c) = 1) has solution n=12.
    Okay, thanks. I'm so stupid.
    • Wiki Support Team
    Offline

    14
    ReputationRep:
    Wiki Support Team
    (Original post by rupertj)
    Okay, thanks. I'm so stupid.
    In fact, here's something a bit stronger. Suppose we want to solve n+a | bn + (a-c). Then one solution obviously occurs if (n+a) divides (bn + (a-c)) precisely (b-1) times. That is:

    (b-1)(n+a) = bn + a - c
    i.e.
    (b-1)n + a(b-1) = bn + a - c
    and so
    n = a(b-2) + c

    which is always a positive integer if b >= 2.
 
 
 
  • See more of what you like on The Student Room

    You can personalise what you see on TSR. Tell us a little about yourself to get started.

  • Poll
    Brussels sprouts
    Useful resources

    Make your revision easier

    Maths

    Maths Forum posting guidelines

    Not sure where to post? Read the updated guidelines here

    Equations

    How to use LaTex

    Writing equations the easy way

    Student revising

    Study habits of A* students

    Top tips from students who have already aced their exams

    Study Planner

    Create your own Study Planner

    Never miss a deadline again

    Polling station sign

    Thinking about a maths degree?

    Chat with other maths applicants

    Can you help? Study help unanswered threads

    Groups associated with this forum:

    View associated groups
  • See more of what you like on The Student Room

    You can personalise what you see on TSR. Tell us a little about yourself to get started.

  • The Student Room, Get Revising and Marked by Teachers are trading names of The Student Room Group Ltd.

    Register Number: 04666380 (England and Wales), VAT No. 806 8067 22 Registered Office: International House, Queens Road, Brighton, BN1 3XE

    Quick reply
    Reputation gems: You get these gems as you gain rep from other members for making good contributions and giving helpful advice.