| |
| |
| |
|
Page: 1 2 3 4 5 6
Comments:
<0> I know this is simpel, must be my stupid day... Getting Bitwise result of '7' is: 1, 0 when is should be Bitwise result of '7' is: 4, 2, 1 http://pastebin.ca/119290
<1> yo Jymmm what is '%' in php?
<1> if it means 'modulus' same as in C, and '===' means 'is equal to' then the code seems like it is not right
<1> in C that would have to be '&' instead of '%' and then i think it would work right
<1> still don't know what Bitwise '0' would mean though
<1> don;t know much about php though
<0> % is modulus
<2> Jymmm: is*modulus
<0> well, amybe the zero isn't necessary there, but it's a "fallthru" when I get the logic correct.
<3> professor X had one weakness.... stairs
<4> Safrole: he could mind control other mutants with telekenesis power to levitate him over stairs
<3> lol
<5> prof X had telekinesis.
<5> ...or atleast i thought he did
<5> nope, just telepathic
<6> hi all
<6> i need to ask a question
<6> please help me
<3> shoot
<6> 10x+a/10a+y
<3> okay...
<7> Do you mean (10x+a)/(10a+y) ?
<6> no
<6> 10x+a over 10a+y
<3> lol
<8> Kudo1275: then you do mean what woggle said
<6> yah
<8> rather than 10x + (a/10) a + y, which is what you wrote really means
<6> i see this qusetion from book
<8> okay, so this is an expression, what do you want to do with it?
<6> its answer is 10ax/9x+a
<6> yah
<8> You haven't asked a question though
<6> 10x+a over 10a+y
<8> yeah, what about it?
<6> no,i don't want ask this question again
<8> what?
<9> problem is, we have no clue what you're trying to ask
<8> I don't understand what you want to do with that expression
<8> What's the whole question from the book?
<6> question:the sum of from 1 to 100
<8> 100 * 101 / 2
<6> type of the book is self imporvement
<6> ???
<2> Maybe you meant: . id pl v wn
<6> the sum of 1 to 100]
<8> > sum [1..100]
<6> yah
<2> 5050
<8> > 100 * 101 / 2
<2> 5050.0
<6> please state the solution
<8> excuse the slowness of the bot, I'm presently lagged
<6> i teach you the shortcut
<8> The sum of k from k = 1 to n is n (n+1) / 2. You can prove this by induction.
<7> In general, sum [1..n] = n(n+1)/2. This is easy to prove by induction.
<7> Ah, too slow.
<6> 1+100
<6> 1+100=101 so on(until 50)
<8> yeah
<6> 101*50
<6> 5050 answer
<6> i also read about the high speed to make into lowest terms
<7> There is that clever way of showing it, but it doesn't work as well for, e.g., the sum of k**2 for k = 1 to n (which is n(n+1)(2n+1)/6)
<6> what you mean,woggle
<6> i don't what are you talking about
<7> It's more useful to understand the proof by induction. (;
<6> ok
<6> i want to ask 26 over 65=
<6> make it into lowest terms with high speed
<7> % 26 / 65
<2> woggle: 2/5
<7> See, that was fast. (;
<8> excuse the slowness of the bot, I was transferring something
<8> (now it's done)
<7> Though doing it by hand, I'd quickly recognize that both numbers were divisible by 13.
<8> > product [1..100]
<2> 93326215443944152681699238856266700490715968264381621468592963895217599993229915608941463976156518286253697920827223758251185210916864000000000000000000000000
<6> 5050
<8> > sum [1..100]
<2> 5050
<6> very hard to say
<6> bb
<7> > scanl1 (*) [1..20]
<2> [1,2,6,24,120,720,5040,40320,362880,3628800,39916800,479001600,6227020800,87178291200,1307674368000,20922789888000,355687428096000,6402373705728000,121645100408832000,2432902008176640000]
<10> hi, is anyone familiar with the Ant Colony Algorithm for graph theory ?
<10> or Ant System algorithm ? They are similar to Bellman and Dijikstra
<10> anyone has any idea what I am talking bout?
<11> @keal
<2> i cant think anymore
<12> http://rafb.net/paste/results/nblzdI91.html
<12> can someone help me with this (trivial for most of you) problem?
<13> "and similarly horses 2 through n are the same color"
<13> that's the problem
<8> azi: How do you know that there are two horses?
<13> azi: there's no reason for horse n-1 and horse n to be the same color
<13> azi: that's not an inductive step
<13> Cale: uh what?
<8> er, sorry
<12> i'm not really skilled at clear math reasoning and i just guessed you cannot prove that the horses has a different color just by checking each one
<8> It's really, how do you know that the sets (horses 1 through n-1) and (horses 2 through n) have a member in common
<8> that is, the set of horses 2 through n-1 might be empty
<8> Which is the case when n = 2
<13> Cale: you miss the point
<8> no, I'm not
<13> Cale: i agree with the set of 2 horses there is a problem
<8> The argument would work, if you could ensure that the set of "middle horses" was nonempty
<8> but it can be empty
<13> Cale: the main point that they are after is clearly the ""and similarly horses 2 through n are the same color""
<8> Oh, they are
<14> Cale: what is a monad for dumb please i didn't understood the wikipedia article about
<8> They're a set of size n-1, and so are the same colour by the induction hypothesis
<12> i still don't see if *I* missed the point or no
<8> Manyfold: You're interested in programming applications?
<13> azi: the point is that the "and similarly horses 2 through n are the same color" is wrong
<8> azi: the two sets of horses you're talking about may not share a member
<13> azi: because the inductive step would be to prove that horse n-1 and horse n are the same color
<8> JohnFlux: no, that part is fine
<14> Cale: well first what it is all about
<13> Cale: damnit cale. you're supposed to be smart :P
<8> JohnFlux: The induction hypothesis is that any set of k < n horses will all be the same colour.
<8> The induction step is to prove that this implies that any set of n horses will be the same colour.
<13> indeed
<8> JohnFlux: the horses 2 through n are a set of size n-1 < n
<8> so the induction hypothesis applies to them as well
<8> It's just that the set of horses 1 through n-1 and the set of horses 2 through n might not have a member in common.
<8> The argument ***umes that they do.
<13> that's not the point of it
<8> it really is
<13> it's not. the point is that you can ***ume horse 1 to n-1 are the same color
<13> but you can't ***ume that horse n-1 and n are the same color
<13> that's the point of the question
<13> it's to make you understand that
<13> consider a set of 10 horses
<14> set n=2
<12> and why you can't do that? becuase the induction impl something unproven?
<12> impl/imply?
<8> ugh
<14> so group 1 is horse 1 and group 2 is horse 2
<8> You're ***uming that *any* set of horses of size k < n will be the same colour.
<14> both are disjunct
<13> azi: right. you have to prove that horse n-1 and n are the same color. the fault is the "and similiarly.."
<14> right?
<13> Cale: correct
<8> no, the fault isn't there
<13> yes it is :P
<8> You're allowed to take these sets of horses, and say that they'll be colour-homogeneous
<13> see, you are over complicating it
<8> because they're smaller cases
<8> I'm not
<8> I'm being correct about it
Return to
#math
or
Go to some related
logs:
#ldap
#perl
#lgp
enable-sound-mixing
* MySQL NOT started (0)
#centos
iftab gentoo
ubuntu cedega opengl xgl
#fedora
quickpkg world
|
|