Recent content by Floating Info

So, I'm trying (keyword trying) to learn a bit of special relativity on my own via the Stanford lectures on Youtube by Leonard Susskind, but I'm running into a problem. According to the lectures, for two different reference frames with co-ordinates marked (x, t) and (x', t'), the latter...

It does help. I put this in Pre-Calc since I didn't know the difficulty of it, just the difficulty of stating it. I suspected the proof was simple.

Two questions: 1. What exactly do you mean by eliminate the modulo? 2. Instead of if y being prime, do you mean if x and y are coprime? The equation would still apply, and, assuming that the b can be used for something, it would prove a vastly more general result.

Homework Statement Prove or disprove that: \frac{{\sum_{i=0}^{ord_N (2) - 1}} (2^i \bmod N)}{N} Is equal to the number of odd residue classes of 2^x \bmod N for all odd numbers N greater than 1. Homework Equations Residue Classes are the residues that are generated by a function...

In Big O Notation, that would be simply O(n!) I believe, factorial time. The sum group amounts to (n - 2)! with a coefficient 2 + 1.5 + 0.6666 +... which is discarded (so is the -2), and the n - 1 grows so slow relative to the rest that it can be discarded to.

Is there any website that has or is a database of the current known computational complexity of mathematical operations?

(I am not sure if this is the right section for this). This question probably is extremely trivial and silly, but I haven't been able to find the answer to it despite going through quite a bit of The Internet. So, it appears that each Quantum Logic Gate corresponds to a matrix. Ones that...

(This is my first post.) I can't seem to find a good way of solving this sort of congruence for x: x^2 / 3 + 11 \equiv 5 (mod x) Through trial and error it appears at least 3 and 6 are answers, but how can you reach them regularly? (I'm heard conflicting things about fractions being...