Proof about relatively prime integers.

  • Context: Graduate 
  • Thread starter Thread starter cragar
  • Start date Start date
  • Tags Tags
    Integers Prime Proof
Join the discussion
Ask a follow-up here, or get your own question answered by working scientists, mathematicians and engineers — people, not an autocomplete.
Real named experts · corrections over time · the nuance an AI answer skips
1 reply · 2K views
cragar
Messages
2,546
Reaction score
3
This is not homework. If n is a positive odd integer then
n and [itex]n+2^k[/itex] are relatively prime. k is a positive integer.
Let's assume for contradiction that n and [itex]n+2^k[/itex] have a common factor.
then it should divide their difference but their difference is [itex]2^k[/itex] and since n is odd it has no factors of 2 so this is a contradiction and they are relatively prime.
 
Mathematics news on Phys.org
Hey cragar.

I'm not sure exactly what your lecturer expects, but you might want to write down a prime decomposition for n and the other number and show it in detail.

The intuition behind your proof is right but I'm not sure if your lecturer will want more.