#apache #archlinux #asterisk #centos #debian #gentoo #haskell #kde #kubuntu #lisp #math #mysql #perl #python #ruby-lang #rubyonrails #suse #ubuntu #vim #wikipedia 0 1 2 3 4 5 6 7 8 9 10 11
Top Prev 5204 5205 5206 5207 5208 5209 5210 5211 5212 5213 5214 5215 5216 5217 5218 5219 5220 5221 5222 Next
#math
<ed> the knuth one?
<cyclicFifths> asphyxia: no, but it's nice to be able to bounce your thoughts off someone
<asphyxia> cyclicFifths: Well, I've read the wikipedia-entry some times over now, and I've tried doing some writings
<asphyxia> yeah, that's my reasoning
<asphyxia> I appreciate the help, no doubt about it
<asphyxia> I am not getting anywhere though
<cyclicFifths> asphyxia: i think the existence part should be the easier
<cyclicFifths> uniqueness i could see as being more difficult
<asphyxia> I think my problem is that it is not totally clear to me what it means that z -> [z]n
<cyclicFifths> i guess thats how it usually goes with iff statements
<asphyxia> are you refering to the composite map \tilde Phi Q or just the CRT in general?
<cyclicFifths> hmm, as far as I know it is the map of z onto z modulo n
<cyclicFifths> just any if and only if statement...
<cyclicFifths> usually it's easier to show the existence part
<cyclicFifths> the more difficult part is usually the uniqueness
<KD19> ed yes the knuth one
<KD19> ed and that's a cool song to play on guitar
<ed> KD can you plz send me the book in case i want to read it later?
<KD19> sure
<KD19> but
<KD19> I wonder
<asphyxia> cyclicFifths: ok... about the mapping, z onto z modulo n makes sense, only z modulo n, which elements does it contain?
<cyclicFifths> asphyxia: so z in ZZ, we want to map those to their equivalence class modulo n; so some n, we don't know what it is, only that we are assuming that for each n_i in the range of Q divides n
<cyclicFifths> so z mod n contains all integers {0,1,...,n-1}
<asphyxia> yeah
<asphyxia> ehm
<cyclicFifths> hmm
<cyclicFifths> i may have goofed that
<asphyxia> I dont know about that - our book says "[a]_n = {..., -2n +a, -n + a, a, n+a, 2n+a, ...}"
<cyclicFifths> ok, but the range is ZZ mod n isn't it?
<Kasadkad> [a]_n there is referring to the equivalence class under the relation mod n which contains a
<ed> KD19 yes?
<KD19> how do I read tex
<KD19> hehe
<asphyxia> Kasadkad: true
<cyclicFifths> Kasadkad has it
<asphyxia> cyclicFifths: I am not sure though what the range of Q is
<asphyxia> By definition of Q, yes it is
<cyclicFifths> you defined it earlier, right? Q:ZZ -> ZZ/n
<asphyxia> but, is that all equivalence classes under n?
<asphyxia> cyclicFifths: yeah
<Kasadkad> What's Q?
<cyclicFifths> just some mapping
<asphyxia> Q is just a map
<Kasadkad> And what's ZZ?
<Kasadkad> Oh, Z
<cyclicFifths> just the integers
<asphyxia> \mathbb Z
<Kasadkad> Mm
<asphyxia> Kasadkad: My assignment is:
Previous Page Next Page