MHB Resurrecting a previous post. Coprime mod n implies coprime-ish mod n.

  • Thread starter Thread starter caffeinemachine
  • Start date Start date
Click For Summary
SUMMARY

The discussion centers on the mathematical relationship between two integers, \(a\) and \(b\), in the context of modular arithmetic. Specifically, it addresses the condition under which \(ap + bq \equiv 1 \mod n\) implies the existence of integers \(a', b', p',\) and \(q'\) such that \(a'p' + b'q' = 1\). The consensus is that if \(\gcd(a, b) = 1\), then such integers exist. However, uncertainty remains regarding the scenario when \(\gcd(a, b) \neq 1\), prompting further inquiry into potential solutions.

PREREQUISITES
  • Understanding of modular arithmetic and congruences
  • Familiarity with the concept of greatest common divisor (gcd)
  • Knowledge of integer linear combinations
  • Basic principles of number theory
NEXT STEPS
  • Explore the implications of the Extended Euclidean Algorithm on modular equations
  • Research the properties of coprime integers in modular arithmetic
  • Investigate the conditions under which integer solutions exist for linear Diophantine equations
  • Examine case studies involving gcd and modular relationships in number theory
USEFUL FOR

Mathematicians, students of number theory, and anyone interested in the properties of integers and modular arithmetic will benefit from this discussion.

caffeinemachine
Gold Member
MHB
Messages
799
Reaction score
15
This was a question posted a long time ago by Swlabr but somehow the thread died.
Let $a$ and $b$ be two integers such that there exists integers $p$, $q$ with $ap+bq=1\text{ mod }n$. Do there exist integers $a^{\prime}$ $b^{\prime}$, $p^{\prime}$ and $q^{\prime}$ such that, $x^{\prime}=x\text{ mod }n$ for $x\in\{a, b, p, q\}$ and, $$a^{\prime}p^{\prime}+b^{\prime}q^{\prime}=1?$$.This was my response.
If $\gcd (a,b)=1$ then yes.

$ap+bq \equiv 1 \mod n$ means there exist integer $\gamma$ such that $ap + bq+n \gamma =1$ . If $\gcd (a, b)=1$ then $\exists k_1, k_2$ such that

$ak_1+bk_2=\gamma$.

Take $a{'} =a, b{'}=b, p{'}=p+nk_1, q{'}=q+nk_2$

Then $a{'}b{'} +b{'}q{'}=1$

I am not sure what happens when $\gcd (a,b) \neq 1$.

Ideas anyone?

The original thread is http://www.mathhelpboards.com/f15/coprime-mod-%24n%24-implies-coprime-ish-mod-%24n%24-624/#post3495
 
Last edited by a moderator:
Mathematics news on Phys.org
Re: ressurecting a previous post. Coprime mod $n$ implies coprime-ish mod $n$.

Here's what I think,
From $ap + bq+n \gamma =1$, it's evident that $(a,b)$ is coprime to $\gamma$. Then I look for solutions in the form $p'=p+nx$,$q'=q+ny$, so if we want $ap'+bq'=1$ we are led to $ax+by=\gamma$, which has a solution.
 
Re: ressurecting a previous post. Coprime mod $n$ implies coprime-ish mod $n$.

melese said:
Here's what I think,
From $ap + bq+n \gamma =1$, it's evident that $(a,b)$ is coprime to $\gamma$. Then I look for solutions in the form $p'=p+nx$,$q'=q+ny$, so if we want $ap'+bq'=1$ we are led to $ax+by=\gamma$, which has a solution.
Hey melese! You have helped me a lot at MHF(I used abhishekkgp as my nick there). Thanks for showing interest in this thread.

Now, from what I understand you use the fact that $ax+by=\gamma$ has a solution. Ok.. I'll assume, for the moment, that it does. Write $g=\gcd(a,b)$. This would mean that $g| \gamma$. But from $ap+bq+n\gamma=1$ we'd have $g|1$ as $g$ divides $a,b$ and $\gamma$. This would force that $\gcd(a,b)=1$ which is not a necessity in the hypothesis.
 

Similar threads

  • · Replies 1 ·
Replies
1
Views
1K
  • · Replies 1 ·
Replies
1
Views
3K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 7 ·
Replies
7
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 2 ·
Replies
2
Views
1K
  • · Replies 12 ·
Replies
12
Views
645
  • · Replies 1 ·
Replies
1
Views
1K