#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 5418 5419 5420 5421 5422 5423 5424 5425 5426 5427 5428 5429 5430 5431 5432 5433 5434 5435 5436 Next
#math
<DemisM> yeah
<DemisM> like it's one or the other not both
<gzl> right
<asphyxia> http://tersloev.dk/untitled.pdf
<asphyxia> gzl: I am sorry if this bothers you, then dont have a look at it.
<asphyxia> but that is the best translation, I was able to make.
<asphyxia> I think it will help clear up the misunderstandings
<gzl> that statement was fine, the issue is that (1 2)(1 3) is not equal to (1 2 3) and has nothing to do with that theorem
<gzl> (1 3)(1 2) would be an example
<gzl> or (1 5)(1 4)(1 3)(1 2)
<asphyxia> the product of the last expression is equal to (1 2 3 4 5), right?
<gzl> yes
<gzl> by your theorem. but you brought up this (1 2)(1 3) example which has nothing to do with this
<gzl> in fact if you apply that theorem it tells you that (1 2)(1 3) = (1 3 2)
<asphyxia> ko
<asphyxia> ok...
<gzl> if there's something you're confused about you should point to what it is
<asphyxia> well, I think it's kind of cleared up
<gzl> ok
<asphyxia> I will mutter about it later if there is some glitch... but thanks
<asphyxia> I think it helped me to translate that passage.
<brick_> Ok, I understand how to find out what the error term is for a given number of terms in a taylor expansion
<brick_> Yet given an error, how do I find the number of terms needed to get there?
<brick_> For instance, I have Sin(.45) as a power series. How many terms do I need to get to .0000001 error?
<me22> brick_: signs alternate, so find the first term smaller than the required error
<thianpa> Anyone knows how i can swap two number only using the two variable ?
<Jafet> http://en.wikipedia.org/wiki/Swap_(computer_science)
<Jafet> I wrote that article (:
<Jafet> Anyway, this is more of a computer science question.
<thianpa> a better channel ?
<me22> thianpa: std::swap, in C++ =)
<Steve|Office> thianpa: Use xor.
<Steve|Office> std::swap uses a temp variable.
<me22> thianpa: ask in a channel dedicated to the language you're using
<me22> Steve|Office: not always.
<Steve|Office> (Unless it is a template specialization.)
<me22> a good implementation uses XCHG where possible
<Steve|Office> But for integers, xor works.
<Steve|Office> xchg?
<me22> x86 ASM
<thianpa> me22: Its a shell prog. And also I know with the temp variable. I want the logic with the two variables that contains both the number
<Steve|Office> Who said anything about x86? I just heard c++.
<me22> interestingly, some gcc versions will optimize the xor trick down to XCHG
<Steve|Office> thianpa: I told you, use xor.
<Jafet> In x86, XCHG locks access to operands, and so is only of any real benefit in swapping registers generally.
<me22> anyways, it's a QOI detail
<Jafet> Compared to all the hassle of inlining assembly and providing for alternative platforms...
<thianpa> Got it. Its a simple logic
<thianpa> a=a+b
<Jafet> That's one of the lamest ways to swap.
Previous Page Next Page