Got Homework?
Connect with other students for help. It's a free community.
Here's the question you clicked on:
 0 viewing
hartnn
Group Title
inverse of mod function?
like y= x mod p,
1=5 mod 2
how do i get 5 from {1,2}
 one year ago
 one year ago
hartnn Group Title
inverse of mod function? like y= x mod p, 1=5 mod 2 how do i get 5 from {1,2}
 one year ago
 one year ago

This Question is Closed

suvesh253 Group TitleBest ResponseYou've already chosen the best response.0
doesnot exist as inverse only possible for oneone function
 one year ago

mukushla Group TitleBest ResponseYou've already chosen the best response.1
y=x ? inverse of this will not be a function
 one year ago

mukushla Group TitleBest ResponseYou've already chosen the best response.1
inverse exist x=y but its not a function
 one year ago

ganeshie8 Group TitleBest ResponseYou've already chosen the best response.0
mod is not 11 function
 one year ago

suvesh253 Group TitleBest ResponseYou've already chosen the best response.0
modulus is a manyone function hence it's inverse not possible
 one year ago

hartnn Group TitleBest ResponseYou've already chosen the best response.2
c= a mod b = > corresponds to
 one year ago

Mikael Group TitleBest ResponseYou've already chosen the best response.1
NO 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...
 one year ago

hartnn Group TitleBest ResponseYou've already chosen the best response.2
whats and how ? \(Abs^{1}(y) = ((y,y),(y,y))\)
 one year ago

hartnn Group TitleBest ResponseYou've already chosen the best response.2
if i have y=x mod 7, how would i find its inverse ?
 one year ago

Mikael Group TitleBest ResponseYou've already chosen the best response.1
The Abs is of course x not the algebraic coincidence of names.
 one year ago

hartnn Group TitleBest ResponseYou've already chosen the best response.2
i eas talking about remainder
 one year ago

hartnn Group TitleBest ResponseYou've already chosen the best response.2
like 5 mod 2 is 1
 one year ago

suvesh253 Group TitleBest ResponseYou've already chosen the best response.0
if modulus is with only number then it is oneone and inverse will exist
 one year ago

estudier Group TitleBest ResponseYou've already chosen the best response.0
x = sgn(x) .x
 one year ago

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

Mikael Group TitleBest ResponseYou've already chosen the best response.1
and a , the action that should not be asked but anyway received :)
 one year ago

hartnn Group TitleBest ResponseYou've already chosen the best response.2
but i didn't understand....
 one year ago

Mikael Group TitleBest ResponseYou've already chosen the best response.1
thx oh exalted one !
 one year ago

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

Mikael Group TitleBest ResponseYou've already chosen the best response.1
MEdals, Medals gentleman for the wondering scholar ....! Keep them falling !
 one year ago

hartnn Group TitleBest ResponseYou've already chosen the best response.2
hmmm...didn't study ideals, i'll go through them, thanks
 one year ago

Mikael Group TitleBest ResponseYou've already chosen the best response.1
Everybody that did  pls gratify
 one year ago

satellite73 Group TitleBest ResponseYou've already chosen the best response.0
i 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\) ?
 one year ago

hartnn Group TitleBest ResponseYou've already chosen the best response.2
yes, i wrote somewhere in between = > correcponds to
 one year ago

Mikael Group TitleBest ResponseYou've already chosen the best response.1
If that was the question I would not solve it  but it was not!
 one year ago

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

Mikael Group TitleBest ResponseYou've already chosen the best response.1
No uniqueness  only an IDEAL OF ANSWERS
 one year ago

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

Mikael Group TitleBest ResponseYou've already chosen the best response.1
Yes  they form an IDEAL
 one year ago

satellite73 Group TitleBest ResponseYou've already chosen the best response.0
ideals live in arbitrary rings, and are not necessary for understanding elementary number theory
 one year ago

Mikael Group TitleBest ResponseYou've already chosen the best response.1
Anyway the set pf answers here IS an Ideal.
 one year ago

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

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

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

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

Mikael Group TitleBest ResponseYou've already chosen the best response.1
http://en.wikipedia.org/wiki/Modular_arithmetic
 one year ago

Mikael Group TitleBest ResponseYou've already chosen the best response.1
1 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
 one year ago

hartnn Group TitleBest ResponseYou've already chosen the best response.2
because of those ... i cannot get the reference
 one year ago

hartnn Group TitleBest ResponseYou've already chosen the best response.2
only last one i couldn't get
 one year ago

Mikael Group TitleBest ResponseYou've already chosen the best response.1
Just ggle "elementary remainder group theory"
 one year ago
See more questions >>>
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.