From 2013/10/17 04:00 to 2013/10/17 10:00 (1)

From 2013/10/17 10:00 to 2013/10/17 16:00 (4)

From 2013/10/17 16:00 to 2013/10/17 22:00 (3)

From 2013/10/17 22:00 to 2013/10/18 04:00 (15)

From 2013/10/18 04:00 to 2013/10/18 10:00 (18)

From 2013/10/18 10:00 to 2013/10/18 16:00 (25)

From 2013/10/18 16:00 to 2013/10/18 22:00 (44)

From 2013/10/18 22:00 to 2013/10/19 04:00 (1)

From 2013/10/19 04:00 to 2013/10/19 10:00 (1)

From 2013/10/19 10:00 to 2013/10/19 16:00 (2)

From 2013/10/19 16:00 to 2013/10/19 22:00 (2)

From 2013/10/19 22:00 to 2013/10/20 04:00 (2)

From 2013/10/20 04:00 to 2013/10/20 10:00 (4)

From 2013/10/20 10:00 to 2013/10/20 16:00 (3)

From 2013/10/20 16:00 to 2013/10/20 22:00 (3)

From 2013/10/20 22:00 to 2013/10/21 04:00 (5)

From 2013/10/21 04:00 to 2013/10/21 10:00 (4)

From 2013/10/21 10:00 to 2013/10/21 16:00 (9)

From 2013/10/21 16:00 to 2013/10/21 22:00 (27)

From 2013/10/21 22:00 to 2013/10/22 04:00 (6)

From 2013/10/22 04:00 to 2013/10/22 10:00 (13)

From 2013/10/22 10:00 to 2013/10/22 16:00 (24)

From 2013/10/22 16:00 to 2013/10/22 22:00 (25)

From 2013/10/22 22:00 to 2013/10/23 04:00 (52)

From 2013/10/23 04:00 to 2013/10/23 10:00 (22)

From 2013/10/23 10:00 to 2013/10/23 16:00 (19)

From 2013/10/23 16:00 to 2013/10/23 22:00 (38)

From 2013/10/23 22:00 to 2013/10/24 04:00 (36)

why do waves with longer wavelengths travel faster than waves with shorter wavelenghts?

Anyone know where I can get my hands on a dymaxion map?

I need to write a research paper for my operating systems class. So far I've done a presentation on the future of computer forensics. Just, any ideas? It can pretty much be anything computer related. I'm only used to doing papers in biology. This is something I had in mind to research about: http://www.accessdata.com/services

S, what's YOUR favourite number /sci/?

I'm bored...therefore, i start a paradox thread! Post your paradoxes, then laugh as others try to solve them if you already know the answer...or just let them find it for you if you don't... The swiss cheese paradox: The more swiss cheese you have, the more air you have. The more air you have, the less swiss cheese you have. Therefore, the more swiss cheese you have, the less swiss cheese you have!

So I have been doing my physics homework like a good engineering student like all of you seem to hate, but I have recently wandered into a question I cannot figure out. Some part of me needs rationalization for this. Why is a coulomb such a fuckton of charge? I mean, having a single coulomb of charge is an immense amount, why didn't they use a value of the coulomb that was more normal for applications, so that the applications would be easier to solve by hand? It seems like most of the SI units have been chosen as at least somewhat realistic numbers, but the coulomb seems retardedly big. Anybody know why it was picked so big? Like was it discovered as some ratio or was it just some arbitrarily large amount of charge that some dude thought was normal? Pic related, this is the fucker.

So, /sci/ do you have any input for scaling down wind currents accurately?

what animal is this

Whats the TOTYAY IQ Test?

What's the point of lectures if you have to read the textbook anyway? Unless the teacher teaches all of the material, lectures are just their ways of jewing us out of our money. They are pointless. >inb4 hurr durr you can't teach the entire subject from a lecture. Yes you fucking can. Pic unrelated

1) I am incapable of producing original useful thought. 2) My responses are limited to fundamental laws of the universe. 3) I have the ability to build a machine to simulate myself. And that is my proof that I am a turing complete simulation. (Proponents of free-will have never been able to actually prove free-will exists so it only makes sense that I am a simulation until someone can prove an effect exists without a cause (implying free-will)).

/sci/, I was wondering if I could take four values and make some sort of line equation so that I can get intermediate points at any timestep? I assume this is painfully simple calc, so apologies in advance.

I've been stuck on this shit for about 3 hours now and still have no idea what the fuck is going on, anyone able to explain what I am supposed to do?

if a power cord with aluminum taped to the end was attached to a person with water poured on them, and the wire was plugged into an outlet, would the person die?

I did this n+1((n+1)+1=((n+1)^2+n+1) But totally forgot how. It might be that I am dumb, starting to become so or it's night and my body urges me to sleep. Would someone explain me why it is how it is before I go to the college with a sleep deprived body? Please do it fast, I am already copy pasting the rest into a more organized form to send it to the teach but it still lingers in my mind and I fear this will deprive me of sleep like the time before the finals.

Suggest a Turing complete proof for proving a general argument. >pic not related

Hey /sci/, Got a task to solve a exercise about the Towers of Hanoi(3 Towers and Goal is to move the discs to Tower 2). Something like im getting an "n" which represents the number of discs (0 < n < 61) and an "k" which represents the number of moves (0 < k < 2^n). The task was to show the positions of the discs after k moves. something like in n=3 and k=4 -> first tower: nothing second Tower: Disc 3(Largest) thirde Tower: Disc 2 and Disc 1. I solved it in the end with an recursive approach to just normally solve the tower and stop the whole process when move number k was reached. as you can maybe imagine the performance was horrendous, but it solved the task so i passed. now my question is there a more performant solution to this somewehere? or some lecture about some approaches to solve this? i mean specially the task to print aut the state of the towers after k moves not a performant way to solve the towers completely.

3^2 + 4^2 = 5^2 10^2+11^2+12^2 = 13^2+14^2 you probably knew those, so lets step it up a little 21^2+22^2+23^2+24^2 = 25^2+26^2+27^2 still not enough? take this 300^2 + 301^2 + ... + 312^2 = 313^2 + ... + 324^2 666^2 + 667^2 + ... + 684^2 = 685^2 + ... + 702^2

hi guys i got stuck when doing that probability problem. any1 willing to help? there are n balls (named from 1 to n) and n (named from 1 to n) boxes. what is the probability of putting every ball in boxes, but leaving exactly 2 boxes empty? I got sth like: \binom{n}{2} ] * (n-2)! * (n-2) * (n-2) I choose 2 empty boxes at first, then put n-2 balls in the rest, so that each contain at least one, and then I put two other balls in any of n-2 boxes. Omega seems to be n^n, but I'm not sure. Any mistakes here?

hey /sci/, i am wondering if you can help me out, im currentley on vacation visiting my parents and my little brother. My brother asked me for help with some of his math work and to be honest its been so long since ive done this that i don't remember i told him to check out khan academy but he said he hasn't had much luck. These are two sample problems his teacher gave him which he doesn't know how to solve. system of equations i believe [4x + 2y = -12 , y = -2x -6] he has been told to solve this graphing, when i tried to do it i got inf many solutions but his teacher is asking him to give 3 solutions. another one is [2x + y = -1 -2y, 2x -9y = 3 + 8x] he is to solve this using elimination, once again i got inf many solutions also would this work for the 3 solutions. (1,-1) , (4,-3), (7,-5) Thanks for your time /sci/ i appreciate it :)