| |
| |
| |
|
Page: 1 2 3 4 5 6 7
Comments:
<0> anyway, I'm going to eat dinner :)
<1> How was that image generated ?
<2> The PNG file actually consists of three seperate states. The states are "following", "ending" and "loose". "following" is like 3, where it's moving in a straight path to another wire. "ending" is like 2, where it ends and is connected to something. "loose" is like 257 where it's hanging loose somewhere.
<2> using old files made in '03/'04ish
<2> I noticed this:
<2> http://pastebin.ca/109306
<2> oops. Um. I was working on it and I noticed that the number is increasing in a logical way. might ***ist
<2> Ex-Chat? Ironically "Ex" is the first two letters of the original creator. =P
<2> Too bad he vanished. <_<
<2> measuring the direction the wire is in.
<1> Look at the values in binary.
<1> Similar items usually differ by the number of trailing zeroes.
<1> There's no real scheme to it, though.
<2> Hmm.
<2> Mind giving me an alternative way?
<2> I have 8 states. What I need to do is make these 8 states hav edifferent functions
<2> 8 states for "normal", 8 stated for "connected", and 8 states for "loose".
<1> OK.
<2> hmm
<2> would multyiplying by 10 help?
<1> It's one way of doing it.
<1> A better way would be to use 3 bits for the base states and 2 bits for the descriptors.
<2> 1 = wire up, 2 = wire down, ... || 101 = wire up end, 102 = wire down end || 10001 = wire up loose, 10002 = wire down loose
<2> hmm? I need you to show me how..
<2> I need an example.. I dunno
<1> Well, the first bit decides between normal and connected or loose. The second bit decides between connected or loose (if you choose one of those). The third decides between the standard four directions and the diagonal ones.
<2> hmm
<1> The fourth decides between the axes. The fifth decides which direction.
<2> uh
<2> hmm
<2> uhhh
<2> sleep
<3> is there a name for the multisets of the form {((x*y) mod N) for 0 <= y < N} where 0<=x<N and both x and y are integers?
<4> why is that a multiset ?
<3> exampls with N=4, {0,1,2,3} and {0,0,2,2}
<4> why those 2 ?
<3> There is also {0,0,0,0} but that is it
<4> i don't understand your construction
<3> Think of the numbers from 0 to N. Starting at 0, skip count by come constant. Put the resulting numbers that you hit after N hits into a multi set
<3> if your skip is by 1, you get {0,1,2,3}. If your skip is by 2 you get, {0,2,0,2}, if your skip is by 3, you get {0,3,2,1}={0,1,2,3}.
<3> skip by 0 and you get {0,0,0,0}
<4> well but that's a list
<4> {0,0,0,0}={0} as sets
<3> I need multisets
<3> {0,0,0,0} != {0} as multisets, but {0,2,0,2} = {0,0,2,2} as multisets
<3> multiset may be more of a computer science term. perhapse there is a more mathish term for the same concept (sets that can hold duplicates, lists with no order)
<4> http://en.wikipedia.org/wiki/Multiset
<4> it is math term as well but contrary to a list the order does not matter
<3> yep, that's the concept I'm after
<4> i.e, usually you wouldn't write {0,2,0,2} but {0,0,2,2} as you did above
<4> but i'm not aware of a special name for your mod N construction
<4> well not in terms of multisets
<5> hey
<5> how do you know if a function has a vertical asymptote?
<5> if it comes out as undefined?
<3> is it a ratio of two polynomials?
<6> It also has to tend towards the asymptote. you can't say log x has a vertical asymptote at x=-3 because it's not defined
<5> sqrt(1-x^2)/x
<7> If the limit for f(x) as x approaches c is +-Infinity then x=c is a vertical asymptote.
<5> yeah it'd be at 0 because the degree of the numerator = degree of denominator
<5> correct?
<8> Cale: how about a go match on IGS?
<9> hi
<9> is there a way to list N consecutive non-prime numbers, where N is an integer
<10> big heavy math guys?
<10> http://local.wasp.uwa.edu.au/~pbourke/modelling/chladni/
<10> please someone who knows these things, I don't know what C1 and C2 are supposed to be in the equation for circular plates/membranes on that page
<5> hey
<5> i'm having trouble finding the solution to an optimization problem
<5> the question says "find the point on the line y=4x+7 that is closest to the origin"
<5> i found that d (distance) = sqrt(x^2+(4x=7)^2)
<5> but then when i consult the answer book, it says "it is easier to work with the square of the distance" then they square the sqrt
<5> but doesn't that "tip the scale"?
<5> heh
<5> in the book it says
<5> 'you should convince yourself that the minimum of d occurs at the same point as the minimum of d^2
<11> it means
<11> squaring the distance and finding its minimum point is easier
<11> because if 0 < a < b, then a^2 < b^2
<11> make that 0<=a
<5> HiLander, but what i don't understand is, how can the minimum of x = minimum of x^2?
<11> only over the nonnegatives.
<11> wait
<11> here's the problem
<11> it's not saying the values are equal
<11> just the value of x that gives them.
<5> ooh, so it's a different minimum that occurs at the same x
<5> since we don't care about the y of the minimum, we can ignore the difference
<11> yes. but they both have their minimums at the same value of x because the distance is nonnegative, so squaring it doesn't change that fact
<5> yeah
<5> cool
<5> it sinks in
<5> thanks
<11> np
<12> hello all
<12> how to solve this 1.56 = (1.05)^T solve for T as Time
<12> hello anyone
<12> how to solve this 1.56 = (1.05)^T solve for T as Time
<10> heya peeps
<10> http://www.lsw.uni-heidelberg.de/manuals/gsl-ref-html/gsl-ref_toc.html
<10> this may be of some use to programmer types here
<10> GNU numerical library
<10> :D
<12> hello all
<12> can anyone help me
<12> ??
<13> Maybe you meant: . v
<12> how to solve this 1.56 = (1.05)^T solve for T as Time
<14> gurbin, use a natural logarithm
<14> ln(1.56) = t ln(1.05)
<12> thanks ivan
<12> it is so quiute here - shanti shanti
<12> quite'
<15> where's
<15> chandra
<12> gone to chand (moon)
<16> ha
<15> oh i see what you did there
<12> good night all
<17> is anybody here alive?
<17> i got some question about this log "rule"
<18> I'm here
<17> why the hell does a^(log base a of b) = b?
<19> that's the definition of log_a b
<17> hmm
<17> i dont get it
<17> i get most other log rules
<17> but i cant understand this one
<17> what is it based on?
<17> log base a of b = b
<17> i get that
<17> but i dont get A ^ ( log a of b) = b
<17> wait nvm.. heh log base of a^b = b*
<17> base a of*
<17> damn.. wtf .. i wish there was some way to type log stuff in here
<17> =(
<20> ...
<18> log_a(b)
<17> so how does A^ (log_a b ) = b
<19> what's your definition of log_a b?
<17> huh?
<17> so a^(log_a(b) = b because.... ? (i dont have a def...)
<19> Because I would define log_a b = the x such that a^x = b, and then your equation follows immediately from the definition.
<19> (there are some restrictions, namely I would define that for positive real numbers a and b, with a != 1. The result is a real number.)
<17> i understand that if log_a(b) = x , then a^x = b
<19> err. ok, substitute the first equation into the second one.
<17> but i still dont get why a ^ (log_a (b) ) = b
<17> k
<17> a ^ (a^x = b) = b?
<17> huh
<18> log_a(b) = x and a^x = b
Return to
#math
or
Go to some related
logs:
is not allowed to connect ot this MySQL server
disable evms dapper
#osdev
bindtools gentoo
#css
everything is simple once you understand it
#gentoo
GOTHICIZM
perl tnet.no tech
#ldap
|
|