Inverse of a equation with modulo operator The Next CEO of Stack OverflowHow to find the inverse modulo m?Notation for modulo: congruence relation vs operatorSolving equations with modSolving to find the general equation with a “mod” equationRules for modulo of bitwise xorRelation between powers of inverse modulo n.Solve equation with modulo operatorreversing modulo equationAlgebra rules when finding inverse moduloSolving modulo Equation with denominator
MAZDA 3 2006 (UK) - poor acceleration then takes off at 3250 revs
% symbol leads to superlong (forever?) compilations
Is the concept of a "numerable" fiber bundle really useful or an empty generalization?
Trouble understanding the speech of overseas colleagues
Are there languages with no euphemisms?
Fastest way to shutdown Ubuntu Mate 18.10
Implement the Thanos sorting algorithm
How to get regions to plot as graphics
Why didn't Khan get resurrected in the Genesis Explosion?
Natural language into sentence logic
Can a single photon have an energy density?
What does this shorthand mean?
Where to find order of arguments for default functions
Customer Requests (Sometimes) Drive Me Bonkers!
Why doesn't a table tennis ball float on the surface? How do we calculate buoyancy here?
If I blow insulation everywhere in my attic except the door trap, will heat escape through it?
Can the Reverse Gravity spell affect the Meteor Swarm spell?
What does "Its cash flow is deeply negative" mean?
Which organization defines CJK Unified Ideographs?
Why were Madagascar and New Zealand discovered so late?
Was a professor correct to chastise me for writing "Prof. X" rather than "Professor X"?
Rotate a column
How do we know the LHC results are robust?
How do spells that require an ability check vs. the caster's spell save DC work?
Inverse of a equation with modulo operator
The Next CEO of Stack OverflowHow to find the inverse modulo m?Notation for modulo: congruence relation vs operatorSolving equations with modSolving to find the general equation with a “mod” equationRules for modulo of bitwise xorRelation between powers of inverse modulo n.Solve equation with modulo operatorreversing modulo equationAlgebra rules when finding inverse moduloSolving modulo Equation with denominator
$begingroup$
I have this equation:
$y=ax+b quad pmod26$
where a, b are two parameters. I would like to calculate the inverse of this equation, but I don't know which algebra rules I have to apply. Can you help me?
modular-arithmetic
$endgroup$
add a comment |
$begingroup$
I have this equation:
$y=ax+b quad pmod26$
where a, b are two parameters. I would like to calculate the inverse of this equation, but I don't know which algebra rules I have to apply. Can you help me?
modular-arithmetic
$endgroup$
1
$begingroup$
By "the inverse," do you mean $x=cy+dpmod26$? If so, it may not be doable. It depends on $a$. Is there anything else you can tell us about $a$?
$endgroup$
– Cameron Buie
Mar 18 at 11:51
1
$begingroup$
The usual rules: subtract $b$ from both sides, and multiply both sides by the multiplicative inverse of $a$. Here, the multiplicative inverse of $a$ is the element $c$ such that $ac$ is the multiplicative identity. And the multiplicative identity is the element $1bmod26$.
$endgroup$
– Gerry Myerson
Mar 18 at 11:55
$begingroup$
As @Gerry points out, it isn't much different from what you're used to. The big difference is that $a$ may not have a multiplicative inverse modulo 26.
$endgroup$
– Cameron Buie
Mar 18 at 12:02
add a comment |
$begingroup$
I have this equation:
$y=ax+b quad pmod26$
where a, b are two parameters. I would like to calculate the inverse of this equation, but I don't know which algebra rules I have to apply. Can you help me?
modular-arithmetic
$endgroup$
I have this equation:
$y=ax+b quad pmod26$
where a, b are two parameters. I would like to calculate the inverse of this equation, but I don't know which algebra rules I have to apply. Can you help me?
modular-arithmetic
modular-arithmetic
edited Mar 18 at 12:07
Bernard
123k741117
123k741117
asked Mar 18 at 11:45
JhdoeJhdoe
537
537
1
$begingroup$
By "the inverse," do you mean $x=cy+dpmod26$? If so, it may not be doable. It depends on $a$. Is there anything else you can tell us about $a$?
$endgroup$
– Cameron Buie
Mar 18 at 11:51
1
$begingroup$
The usual rules: subtract $b$ from both sides, and multiply both sides by the multiplicative inverse of $a$. Here, the multiplicative inverse of $a$ is the element $c$ such that $ac$ is the multiplicative identity. And the multiplicative identity is the element $1bmod26$.
$endgroup$
– Gerry Myerson
Mar 18 at 11:55
$begingroup$
As @Gerry points out, it isn't much different from what you're used to. The big difference is that $a$ may not have a multiplicative inverse modulo 26.
$endgroup$
– Cameron Buie
Mar 18 at 12:02
add a comment |
1
$begingroup$
By "the inverse," do you mean $x=cy+dpmod26$? If so, it may not be doable. It depends on $a$. Is there anything else you can tell us about $a$?
$endgroup$
– Cameron Buie
Mar 18 at 11:51
1
$begingroup$
The usual rules: subtract $b$ from both sides, and multiply both sides by the multiplicative inverse of $a$. Here, the multiplicative inverse of $a$ is the element $c$ such that $ac$ is the multiplicative identity. And the multiplicative identity is the element $1bmod26$.
$endgroup$
– Gerry Myerson
Mar 18 at 11:55
$begingroup$
As @Gerry points out, it isn't much different from what you're used to. The big difference is that $a$ may not have a multiplicative inverse modulo 26.
$endgroup$
– Cameron Buie
Mar 18 at 12:02
1
1
$begingroup$
By "the inverse," do you mean $x=cy+dpmod26$? If so, it may not be doable. It depends on $a$. Is there anything else you can tell us about $a$?
$endgroup$
– Cameron Buie
Mar 18 at 11:51
$begingroup$
By "the inverse," do you mean $x=cy+dpmod26$? If so, it may not be doable. It depends on $a$. Is there anything else you can tell us about $a$?
$endgroup$
– Cameron Buie
Mar 18 at 11:51
1
1
$begingroup$
The usual rules: subtract $b$ from both sides, and multiply both sides by the multiplicative inverse of $a$. Here, the multiplicative inverse of $a$ is the element $c$ such that $ac$ is the multiplicative identity. And the multiplicative identity is the element $1bmod26$.
$endgroup$
– Gerry Myerson
Mar 18 at 11:55
$begingroup$
The usual rules: subtract $b$ from both sides, and multiply both sides by the multiplicative inverse of $a$. Here, the multiplicative inverse of $a$ is the element $c$ such that $ac$ is the multiplicative identity. And the multiplicative identity is the element $1bmod26$.
$endgroup$
– Gerry Myerson
Mar 18 at 11:55
$begingroup$
As @Gerry points out, it isn't much different from what you're used to. The big difference is that $a$ may not have a multiplicative inverse modulo 26.
$endgroup$
– Cameron Buie
Mar 18 at 12:02
$begingroup$
As @Gerry points out, it isn't much different from what you're used to. The big difference is that $a$ may not have a multiplicative inverse modulo 26.
$endgroup$
– Cameron Buie
Mar 18 at 12:02
add a comment |
1 Answer
1
active
oldest
votes
$begingroup$
You can find an inverse equation only if $gcd(a,26)=1$, then $a$ has an inverse $a^-1$ such that$$acdot a^-1equiv 1mod26$$therefore$$yequiv ax+bmod26iff a^-1yequiv x+a^-1bmod 26\iff\ xequiv a^-1y-a^-1bmod 26$$
$endgroup$
$begingroup$
If i find an $a^-1$ such as $a^-1aequiv 1 quad (mod26)$, what assures me that $a^-1axequiv xquad (mod26)$ ?
$endgroup$
– Jhdoe
Mar 18 at 14:21
1
$begingroup$
Two things: (1) the definition of inverse $$acdot a^-1equiv 1$$and (2) the neutrality of $1$ $$1cdot xequiv x$$
$endgroup$
– Mostafa Ayaz
Mar 18 at 14:45
add a comment |
Your Answer
StackExchange.ifUsing("editor", function ()
return StackExchange.using("mathjaxEditing", function ()
StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix)
StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
);
);
, "mathjax-editing");
StackExchange.ready(function()
var channelOptions =
tags: "".split(" "),
id: "69"
;
initTagRenderer("".split(" "), "".split(" "), channelOptions);
StackExchange.using("externalEditor", function()
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled)
StackExchange.using("snippets", function()
createEditor();
);
else
createEditor();
);
function createEditor()
StackExchange.prepareEditor(
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: true,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
bindNavPrevention: true,
postfix: "",
imageUploader:
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
,
noCode: true, onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
);
);
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3152692%2finverse-of-a-equation-with-modulo-operator%23new-answer', 'question_page');
);
Post as a guest
Required, but never shown
1 Answer
1
active
oldest
votes
1 Answer
1
active
oldest
votes
active
oldest
votes
active
oldest
votes
$begingroup$
You can find an inverse equation only if $gcd(a,26)=1$, then $a$ has an inverse $a^-1$ such that$$acdot a^-1equiv 1mod26$$therefore$$yequiv ax+bmod26iff a^-1yequiv x+a^-1bmod 26\iff\ xequiv a^-1y-a^-1bmod 26$$
$endgroup$
$begingroup$
If i find an $a^-1$ such as $a^-1aequiv 1 quad (mod26)$, what assures me that $a^-1axequiv xquad (mod26)$ ?
$endgroup$
– Jhdoe
Mar 18 at 14:21
1
$begingroup$
Two things: (1) the definition of inverse $$acdot a^-1equiv 1$$and (2) the neutrality of $1$ $$1cdot xequiv x$$
$endgroup$
– Mostafa Ayaz
Mar 18 at 14:45
add a comment |
$begingroup$
You can find an inverse equation only if $gcd(a,26)=1$, then $a$ has an inverse $a^-1$ such that$$acdot a^-1equiv 1mod26$$therefore$$yequiv ax+bmod26iff a^-1yequiv x+a^-1bmod 26\iff\ xequiv a^-1y-a^-1bmod 26$$
$endgroup$
$begingroup$
If i find an $a^-1$ such as $a^-1aequiv 1 quad (mod26)$, what assures me that $a^-1axequiv xquad (mod26)$ ?
$endgroup$
– Jhdoe
Mar 18 at 14:21
1
$begingroup$
Two things: (1) the definition of inverse $$acdot a^-1equiv 1$$and (2) the neutrality of $1$ $$1cdot xequiv x$$
$endgroup$
– Mostafa Ayaz
Mar 18 at 14:45
add a comment |
$begingroup$
You can find an inverse equation only if $gcd(a,26)=1$, then $a$ has an inverse $a^-1$ such that$$acdot a^-1equiv 1mod26$$therefore$$yequiv ax+bmod26iff a^-1yequiv x+a^-1bmod 26\iff\ xequiv a^-1y-a^-1bmod 26$$
$endgroup$
You can find an inverse equation only if $gcd(a,26)=1$, then $a$ has an inverse $a^-1$ such that$$acdot a^-1equiv 1mod26$$therefore$$yequiv ax+bmod26iff a^-1yequiv x+a^-1bmod 26\iff\ xequiv a^-1y-a^-1bmod 26$$
answered Mar 18 at 12:02
Mostafa AyazMostafa Ayaz
18.1k31040
18.1k31040
$begingroup$
If i find an $a^-1$ such as $a^-1aequiv 1 quad (mod26)$, what assures me that $a^-1axequiv xquad (mod26)$ ?
$endgroup$
– Jhdoe
Mar 18 at 14:21
1
$begingroup$
Two things: (1) the definition of inverse $$acdot a^-1equiv 1$$and (2) the neutrality of $1$ $$1cdot xequiv x$$
$endgroup$
– Mostafa Ayaz
Mar 18 at 14:45
add a comment |
$begingroup$
If i find an $a^-1$ such as $a^-1aequiv 1 quad (mod26)$, what assures me that $a^-1axequiv xquad (mod26)$ ?
$endgroup$
– Jhdoe
Mar 18 at 14:21
1
$begingroup$
Two things: (1) the definition of inverse $$acdot a^-1equiv 1$$and (2) the neutrality of $1$ $$1cdot xequiv x$$
$endgroup$
– Mostafa Ayaz
Mar 18 at 14:45
$begingroup$
If i find an $a^-1$ such as $a^-1aequiv 1 quad (mod26)$, what assures me that $a^-1axequiv xquad (mod26)$ ?
$endgroup$
– Jhdoe
Mar 18 at 14:21
$begingroup$
If i find an $a^-1$ such as $a^-1aequiv 1 quad (mod26)$, what assures me that $a^-1axequiv xquad (mod26)$ ?
$endgroup$
– Jhdoe
Mar 18 at 14:21
1
1
$begingroup$
Two things: (1) the definition of inverse $$acdot a^-1equiv 1$$and (2) the neutrality of $1$ $$1cdot xequiv x$$
$endgroup$
– Mostafa Ayaz
Mar 18 at 14:45
$begingroup$
Two things: (1) the definition of inverse $$acdot a^-1equiv 1$$and (2) the neutrality of $1$ $$1cdot xequiv x$$
$endgroup$
– Mostafa Ayaz
Mar 18 at 14:45
add a comment |
Thanks for contributing an answer to Mathematics Stack Exchange!
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
Use MathJax to format equations. MathJax reference.
To learn more, see our tips on writing great answers.
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3152692%2finverse-of-a-equation-with-modulo-operator%23new-answer', 'question_page');
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
1
$begingroup$
By "the inverse," do you mean $x=cy+dpmod26$? If so, it may not be doable. It depends on $a$. Is there anything else you can tell us about $a$?
$endgroup$
– Cameron Buie
Mar 18 at 11:51
1
$begingroup$
The usual rules: subtract $b$ from both sides, and multiply both sides by the multiplicative inverse of $a$. Here, the multiplicative inverse of $a$ is the element $c$ such that $ac$ is the multiplicative identity. And the multiplicative identity is the element $1bmod26$.
$endgroup$
– Gerry Myerson
Mar 18 at 11:55
$begingroup$
As @Gerry points out, it isn't much different from what you're used to. The big difference is that $a$ may not have a multiplicative inverse modulo 26.
$endgroup$
– Cameron Buie
Mar 18 at 12:02