Somehow I changed the setting from the default double click to single click which makes the right click open the file when I want the right click menu. So I need to know where I did it so I can reverse it.  I've spent the whole night trying to remember how I did it, Please help, Thanks  The setting altered both sides, Solved thanks guys!
I have Ubuntu 13.1 installed with the default window manager and DE.   I am trying to enable single click so I can open files and folders with only one click. I tried googling and all results said to open files, then go to preferences from top bar but my top bar has no options.  picture of desktop:
How to solve the diffencial equation for power series $(1+x²)y'' - 6xy=0$ in $x_{0}=0$ I have tried for the power series but when suppose the solution is $y(x)=\sum _{n=0}^\infty a_nx^n$ appeared sums dependents of $a_n$,  $a_{n+2}$ and $a_{n-1}$ and this is not possible. Quantum teleportation and no-communication theorem According to the Wikipedia article for the :     In very rough terms, the theorem describes a situation that is analogous to two people, each with a radio receiver, listening to a common radio station: it is impossible for one of the listeners to use their radio receiver to send messages to the other listener. This analogy is imprecise, because quantum entanglement suggests that perhaps a message could have been conveyed; the theorem replies 'no, this is not possible'.   According to the Jet Propulsion's recent article on quantum teleportation:   they can effect an entangled photon (B) with another photon (A) to change the state of the other entangled photon.  Doesn't this contradict what the no-communication theorem states ? Building where clause based upon parameters Why does Stack Overflow only allow one @User per comment?  This restriction lead me to a non-comment like :     @MiMo - seem my previous comment (Only one @ user per comment)   Which left me wondering why Stack Overflow is blocking me from notifying two users of a response.  I am sure there is a reason for this, can some one share it with me? Is save data from previous Dragon Age games used in Inquisition? Does Dragon Age Inquisition make use of save data from previous games in the series?  If so, what benefits does this provide? How to generate a random integer number from within a range Why are there hexagonal holes in my donut? I'm currently making a donut using blender gurus tutorial. I have no idea why, but there are holes in my icing. Does anyone know what could be causing it? Thanks for any help. Hat duplicates when info is expanded It seems like there is a bug that is causing a duplicate hat to appear when I expand info, like pressing &quot;(more)&quot; on a suggested edit. This bug does not seem to be specific to the suggested edits review queue though, as others have reported seeing this bug in other places, like code snippet expansion. Steps to repro:  Put on a hat. Navigate to one of your own suggested edits. (You can just also open the Suggested Edits review queue and go to a random suggestion, but there is no guarantee any of those users will be wearing a hat.) Click the &quot;(more)&quot; button to expand the top box.  What should happen: Hat should shift down with the rest of the content. What happens: All the content shifts down, but a duplicate hat remains in the initial place. Before expansion:  After expansion with duplicate hat: Noise in JPEG file after processing RAW file in photoshop Recently i started shooting in RAW after understanding its advantages over JPEG format.   While processing the RAW file there is an option to reduce noise in a captured picture. It works great when i am working on RAW file. But as soon as I save file in JPEG format, noise comes back.  I understand that while converting from RAW to JPEG compression techniques will be applied. But how can i handle this situation (while doing post processing)? A matrix $M$ that commutes with any matrix is of the form $M=\alpha I$ How can we print line numbers to the log in java How do I bulkify queries for directly or indirectly related records? This is a canonical question and answer developed by the community to help address common questions. If you've been directed here, or your question has been closed as a duplicate, please look through the resources here and use them to shape more specific questions. To browse all canonical questions and answers, navigate to the  tag. This question and answer is owned by the community! If you can improve it and make it more useful, you're welcome to edit it. I have a collection of records, like a List&lt;sObject&gt; or the Trigger.new context variable. I need to query other records that are related to these records either directly or indirectly, and I want to use the related data to make further updates. When I write a query in a loop, like for (Account a : Trigger.new) {     Account parent = [SELECT Name FROM Account WHERE Id = :a.ParentId];     // ... }  I keep hitting Salesforce query limits, and I know this is not best practice. What can I do to avoid this problem and bulkify my code? What does --shell-escape do? I stumbled upon an example, which needed to be compiled with the additional option --shell-escape. Using this option it worked just fine, but I'm curious:     Why or when is this option needed and what does it actually do? I have a solid understanding of most OOP theory but the one thing that confuses me a lot is virtual destructors. I thought that the destructor always gets called no matter what and for every object in the chain. When are you meant to make them virtual and why? Problem: Evaluate $$ L=\displaystyle \lim_{n \to \infty} \frac{1}{n} \sum_{k=1}^{n} \left(  \left\lfloor \frac{2n}{k} \right\rfloor -2\left\lfloor \frac{n}{k}\right \rfloor \right).$$  Please help me with this one.  I tried using the sandwich theorem by first constructing the following  $$ 2 \geq \left\lfloor \frac{2n}{k} \right\rfloor -2\left\lfloor \frac{n}{k} \right\rfloor \geq -1 $$ and then summing over. But the limit of the two bounds are different so sandwich theorem doesn't help!. Is it possible to construct sharper bounds?  Also I observed that if we ignore question of continuity, etc. then we can write,  $L= \displaystyle \int ^{1}_{0}\left\lfloor \frac{2}{x} \right\rfloor -2\left\lfloor \frac{1}{x} \right\rfloor dx$  Now I am able to compute the above integral. But is the above process correct? If then how can make it rigorous? Or if any other approach is possible, please tell. In my object record type i have created formula field. Now i want my formula field to work as below.  If Basement__c = NA and Property__r.Basement__c = NA OR  Basement__c = Crawl and Property__r.Basement__c = Crawl OR  Basement__c = Slab and Property__r.Basement__c = Slab Then it will return Type__c(formula field) = "MAtch"  And (Another rule) Basement__c DOES NOT contain any of the following "N/A,Crawl,Slab,None and Property__r.Basement__c Does not contain any of this then formula field will return "HAs basement"  How can i achieve this? Please help. How can I replace a relay with a MOSFET Transistor? I have this working         &ndash; Schematic created using   An Arduino commute both relays and a power adapter charge each battery at a time.  I would like to replace each relay by a MOSFET. How can I do that?  I think the solution bellow will not work because DRAIN is always connected to SOURCE and this will short circuit batteries. MOSFETS only isolate from SOURCE to DRAIN.  When the D9 is HIGH, D10 will be LOW so the power adapter will never be charging both batteries simultaneously.          Sorry for the messy schematic.  Thank you very much. Suppose we have a set of primes $p_1,\dots,p_t$. Prove that  $\log p_1,\dots,\log p_t$ is linear independent over $\mathbb{Q}$. Now, this implies $ \sum_{j=1}^{t}x_j\log(p_j)=0 \iff x_1=\dots=x_t=0$.  I think I have to use that fact that every $q\in\mathbb{Q}$ can be written as $\prod_{\mathcal{P}}$, where $n_p$ is a unique sequence ($n_2$,$n_3$,$\dots$) with domain $\mathbb{Z}$. Here, $\mathcal{P}$ denotes the set of all integers.  Now how can I use this to prove the linear independency? jQuery If DIV Doesn't Have Class "x" Which choice of line-breaking parameters gives the minimum number of lines