I have computer A in which I run "xclock" program. I want to forward it's graphical interface to my pc, not directly but through computer B. Is it possible? I'm running xming on my pc.  Resuming: A runs xclock > A forwards to B > B forwards to my PC. Is it possible?
I have a machine running Ubuntu which I SSH to from my Fedora 14 machine. I want to forward X from the Ubuntu machine back to Fedora so I can run graphical programs remotely. Both machines are on a LAN.  I know that the -X option enables X11 forwarding in SSH, but I feel like I am missing some of the steps.  What are the required steps to forward X from a Ubuntu machine to Fedora over SSH?
I am a Swedish citizen traveling to Kyrgyzstan via Russia. Do I need a transit visa while waiting for my flight iin 24 hours? Write $\frac 11 + \frac12 + ...\frac1{(p-1)} =$ $\frac ab$.Such that $(a,b)=1$. Show that $p^2 \mid a$ $\text{if}$ $p\geq 5$.  I was trying to apply something with prime modulus, but I am unsure how exactly to go about it. For a given inner product space $V$, I would like to prove the inequality $$\|\mathbf{x}+\mathbf{y}\|^2 + \|\mathbf{x}-\mathbf{y}\|^2 = 2(\|\mathbf{x}\|^2 + \|\mathbf{y}\|^2).$$  We see that $$\|\mathbf{x}+\mathbf{y}\|^2 + \|\mathbf{x}-\mathbf{y}\|^2 = \langle\mathbf{x}+\mathbf{y},\mathbf{x}+\mathbf{y}\rangle + \langle\mathbf{x}-\mathbf{y},\mathbf{x}-\mathbf{y}\rangle,$$  which by linearity $$=\langle\mathbf{x},\mathbf{x}+\mathbf{y}\rangle + \langle\mathbf{y},\mathbf{x}+\mathbf{y}\rangle + \langle\mathbf{x},\mathbf{x}-\mathbf{y}\rangle - \langle\mathbf{y},\mathbf{x}-\mathbf{y}\rangle.$$  I've been trying to figure out how to go about this proof using linearity in the second argument of an inner product, but my textbook does not say that linearity necessarily holds in the second component. If it does, how would I go about the rest of this proof? If not, should I be potentially using some aspect of conjugate symmetry to prove this statement? Derivative (or differential) of symmetric square root of a matrix Let A be a square, symmetric, positive-definite matrix.  Let S be its symmetric square root found by a singular value decomposition.  Let vech() be the half-vectorization operator.  Is there a convenient expression for the derivative (or differential) of vech(S) with respect to vech(A)?  I know the expression for an inverse, which is sort of like a matrix version of the power rule.  Would this approach work for a symmetric square root as well (i.e., (1/2)S^(-1/2))? Prove $g$ is a generator if $g^q=1 \pmod p$ Let $p$ be an odd prime and let $q=\frac{p-1}{2}$. If $g^q=-1\pmod p$ and $q$ is a prime, show that $g$ is a primitive root mod $p$.  I want to show $\{g,g^1,...,g^{p-1}\}=\{1,2,...p-1\}$. I argue by contradiction that if there're $x,y\in \{1,2,...p-1\},x&lt;y,g^x=g^y\pmod p$. Then $g^{y-x}=1\pmod p$. I don't know how to use the fact that $q$ is prime to lead to a contradiction. Whenever I try to Get then Install any app from the App Store, I get this message:     We could not complete your purchase.  cancelled   I did some searching online, but barely found any useful hits. What is this about?! Which are the safety recommendations for soldering? My PC has both Ubuntu and Windows 7 installed. I have installed all my drivers in Windows like Nvidia graphics, motherboard etc. Shall I install them in Ubuntu too?  I looked on the web for my Nvidia drivers and I have found a .run file. How could I install it on my Ubuntu? I want to create a circuit that can detect audio frequencies and flash RGB LEDs different colors depending on the detected frequency. The frequency range will be from 20 Hz to 12 kHz, after looking at the chart below.   (source: )    So my question is: what circuit design should I choose to make a good frequency detector? I suppose I would need    Preamp for the microphone (is it necessary for the ADC?) Band pass filters (active or passive?) A microcontroller with an onboard ADC that has a sampling rate of at least 24 kHz.   Before I get too excited, are there any circuits out there that already do this? Why does the "Unanswered Questions" tab show questions that have answers? What does % do to strings in Python? What is the value of $1^i$? $\,$ Present-perfect-tense vs. Simple-past-tense Do I keep my Windows installation if I install Ubuntu with Wubi, the Windows installer? I am trying to understand the derivation of the stars and bars formula. I understand how a problem can be converted to the stars and bars format, but I am confused about how the problem of choosing all the different ways to put k stars in n sections can be written as ${n+k-1 \choose k}$. Generally "n choose k" is for counting the number of combinations of k objects we can get given n distinct objects right? That I understand since we're doing permutation divided by the number of orderings for each group since order doesn't matter. I need help figuring out how stars and bars fits into this. Is it possible to construct an (asymmetric) encryption scheme from a signature scheme?  If the signature scheme is deterministic and allows  (e.g. ), then the answer is yes (create a forgery (m, sig); encrypt plaintexts using  with sig as the key; send m in clear to the signer along with ciphertexts, who can then compute sig and decrypt these ciphertexts) .  I am interested in similar reductions for probabilistic signature schemes.  What should the properties of a probabilistic signature scheme be so that it can be used for encryption? How to find (and delete) duplicate files I have a largish music collection and there are some duplicates in there. Is there any way to find duplicate files. At a minimum by doing a hash and seeing if two files have the same hash.  Bonus points for also finding files with the same name apart from the extension - I think I have some songs with both mp3 and ogg format versions.  I'm happy using the command line if that is the easiest way. Change the Ubuntu program that runs when a command can't be found Irreducible polynomial in field extension I have this problem      Let $L/K$ be a finite field extension and $|L:K|=m$. Let $f(x)$ be an irreducible polynomial of degree $n$ in $K[x]$ and $\gcd(m,n)=1$. Prove that $f$ is irreducible over $L$.   I'm just a beginner so I'm really confused with the $\gcd(m,n)=1$, I don't know how to use it. So help me with this problem. Thank you Animation Cycles rendering remains incredible slow