A community for students.
Here's the question you clicked on:
 0 viewing
hartnn
 3 years ago
inverse of mod function?
like y= x mod p,
1=5 mod 2
how do i get 5 from {1,2}
hartnn
 3 years ago
inverse of mod function? like y= x mod p, 1=5 mod 2 how do i get 5 from {1,2}

This Question is Closed

suvesh253
 3 years ago
Best ResponseYou've already chosen the best response.0doesnot exist as inverse only possible for oneone function

mukushla
 3 years ago
Best ResponseYou've already chosen the best response.1y=x ? inverse of this will not be a function

mukushla
 3 years ago
Best ResponseYou've already chosen the best response.1inverse exist x=y but its not a function

ganeshie8
 3 years ago
Best ResponseYou've already chosen the best response.0mod is not 11 function

suvesh253
 3 years ago
Best ResponseYou've already chosen the best response.0modulus is a manyone function hence it's inverse not possible

hartnn
 3 years ago
Best ResponseYou've already chosen the best response.2c= a mod b = > corresponds to

Mikael
 3 years ago
Best ResponseYou've already chosen the best response.1NO PROBLEMAS SENIOUR @hartnn ! Let B be the set of ordered pairs of pairsofnumbers, in other words pairs of points in the plane: \[ b \in B \,\,\iff b=(P_1, P_2) \] then the inverse function of \[Abs^{1}(y) = ((y,y),(y,y)) \] and a medal , naturally. forgive my humbleness...

hartnn
 3 years ago
Best ResponseYou've already chosen the best response.2whats and how ? \(Abs^{1}(y) = ((y,y),(y,y))\)

hartnn
 3 years ago
Best ResponseYou've already chosen the best response.2if i have y=x mod 7, how would i find its inverse ?

Mikael
 3 years ago
Best ResponseYou've already chosen the best response.1The Abs is of course x not the algebraic coincidence of names.

hartnn
 3 years ago
Best ResponseYou've already chosen the best response.2i eas talking about remainder

suvesh253
 3 years ago
Best ResponseYou've already chosen the best response.0if modulus is with only number then it is oneone and inverse will exist

Mikael
 3 years ago
Best ResponseYou've already chosen the best response.1Anyway also for remainder possible to invert \[ mod:\,r_{Ideal} \rightarrow r \\ mod^{1}: r \rightarrow r_{Ideal}\]

Mikael
 3 years ago
Best ResponseYou've already chosen the best response.1and a , the action that should not be asked but anyway received :)

hartnn
 3 years ago
Best ResponseYou've already chosen the best response.2but i didn't understand....

Mikael
 3 years ago
Best ResponseYou've already chosen the best response.1Learn about Ideals even if you dont have them :) http://en.wikipedia.org/wiki/Ideal_(ring_theory)

Mikael
 3 years ago
Best ResponseYou've already chosen the best response.1MEdals, Medals gentleman for the wondering scholar ....! Keep them falling !

hartnn
 3 years ago
Best ResponseYou've already chosen the best response.2hmmm...didn't study ideals, i'll go through them, thanks

Mikael
 3 years ago
Best ResponseYou've already chosen the best response.1Everybody that did  pls gratify

satellite73
 3 years ago
Best ResponseYou've already chosen the best response.0i think the question is maybe something different, are you asking how do you solve \[x\equiv y (mod n)\] for \(y\) if you know \(x\) ?

hartnn
 3 years ago
Best ResponseYou've already chosen the best response.2yes, i wrote somewhere in between = > correcponds to

Mikael
 3 years ago
Best ResponseYou've already chosen the best response.1If that was the question I would not solve it  but it was not!

satellite73
 3 years ago
Best ResponseYou've already chosen the best response.0so for example solve \( 5\equiv x\text{ mod } 3\)

Mikael
 3 years ago
Best ResponseYou've already chosen the best response.1No uniqueness  only an IDEAL OF ANSWERS

hartnn
 3 years ago
Best ResponseYou've already chosen the best response.2there are many (or infinite ?) values of x in 5=x mod 3 ??

Mikael
 3 years ago
Best ResponseYou've already chosen the best response.1Yes  they form an IDEAL

satellite73
 3 years ago
Best ResponseYou've already chosen the best response.0ideals live in arbitrary rings, and are not necessary for understanding elementary number theory

Mikael
 3 years ago
Best ResponseYou've already chosen the best response.1Anyway the set pf answers here IS an Ideal.

Mikael
 3 years ago
Best ResponseYou've already chosen the best response.1By the way the only proper way to make equivalence necessary for "REMAINDER CALCULUS" is bu using ideals. Elementary  well yes.

hartnn
 3 years ago
Best ResponseYou've already chosen the best response.2ok, thank you @Mikael i'll go through IDEALS and ask u if i have any doubts. thanks to @satellite73 also :)

Mikael
 3 years ago
Best ResponseYou've already chosen the best response.1Firstly is the "cyclical group". It will give you the applications. Only then that. This takes you further

hartnn
 3 years ago
Best ResponseYou've already chosen the best response.2any good reference for such things(other than wikipedia) where these things are explained in lucid manner ?

Mikael
 3 years ago
Best ResponseYou've already chosen the best response.11 mathdl.maa.org/images/upload_library/22/Polya/Brenton.pdf en.wikipedia.org/wiki/Elementary_group_theory math.uc.edu/~hodgestj/Abstract%20Algebra/GroupTheory512.pdf www.rowan.edu/.../Some%20Elementary%20Group%20Theory.pdf

hartnn
 3 years ago
Best ResponseYou've already chosen the best response.2because of those ... i cannot get the reference

hartnn
 3 years ago
Best ResponseYou've already chosen the best response.2only last one i couldn't get

Mikael
 3 years ago
Best ResponseYou've already chosen the best response.1Just ggle "elementary remainder group theory"
Ask your own question
Sign UpFind more explanations on OpenStudy
Your question is ready. Sign up for free to start getting answers.
spraguer
(Moderator)
5
→ View Detailed Profile
is replying to Can someone tell me what button the professor is hitting...
23
 Teamwork 19 Teammate
 Problem Solving 19 Hero
 Engagement 19 Mad Hatter
 You have blocked this person.
 ✔ You're a fan Checking fan status...
Thanks for being so helpful in mathematics. If you are getting quality help, make sure you spread the word about OpenStudy.