I tried to ask this question before, but I don't think I was clear. I replaced my recessed lighting with recessed dimmable LED fixtures.  The bulbs are contained in the fixture, and I don't believe they can be changed. Perhaps I'm wrong about that. They are from Commercial Electric, Model T61.  They are 6" recessed LED swivel fixtures and I really don't think there's any way to change the bulbs inside. If I'm wrong and you know a way to change them, I'd so appreciate it.  They are labeled "soft white", but they are bright and harsh.  They are dimmable, but even at the lowest setting they are pretty bright. So are there photo gels or some other way to "warm up" the lighting to more closely match my old halogens which were just beautiful.
I recently bought  white LED reading lamp. I like it a lot, but the "white" light produced is significantly blue; I'll guess its  is about 5000K.  I've noticed that, when this is the only source of light, printed text appears slightly fuzzy, and is more difficult to read than with a standard incandescent reading lamp. My guess is that this is  causing color fringing in my eyes, making it harder to read with this new lamp.  Is there a way to make this lamp less blue using some sort of transparent/translucent filter over the lens? This could filter out some of the blue end of the spectrum, or include a  to convert some of the blue to yellow (as  do). The fluorescence idea would be better, as there'd be less light lost. I don't want to go too far, though; a strongly yellow lamp might be worse for reading than this currently blueish lamp.
Clear Android Market Search History? Any thoughts on how one might clear the Android Marketplace search history? For instance, if I recently searched for an android app in the marketplace, the marketplace search maintains a history list of which apps/keywords that I have recently looked for.    Thanks in advance! D'Alemberts Principle to solve a Classical Mechanics problem I found this question on this very site and was curious on how to solve it using D'Alembert's Principle  .I already know how to do it by balancing the torque about toppling point so please don't post the latter as an answer . My attempt was to displace the upper sphere by $d\theta$ which gives its virtual displacement as  $rd{\theta}cos(\theta)$j(notice we are only interested in the y component becuz the only component of the applied force which is gravity in this case is the y component in the dot product the other components vanish) similarly the cylinder is also displaced $r'd{\phi}cos(\phi)$ where r' is the distance from the point of toppling of the center of mass. $r'cos(\phi)=H/2=r(1+sin(\theta))$ ,$r'sin(\phi)=R=r(1+cos(\theta))$ and $tan(\phi)=H/2R$ the equation coming from D'Alemberts principle is $mgrcos(\theta)d\theta=Mgr'cos(\phi)\phi$ I tried solving this but couldn't arrive at the right answer. Any help would be appreciated! Why can we always drop any constant term in a Lagrangian density in quantum field theory?  This issue is somehow related to the constant term being some kind of cosmological constant.  Can you please explain this issue? Mac turns off randomly and has lines on screen For some reason my iMac keeps turning off around 5 to 10 minutes into boot.  Also just recently it turns on but has shaded lines going down the screen. I have not installed any weird programs and i have not used it in around 3 months.   Any ideas on what the issue is, i don't have any other information about the issue besides whats happening when i use it.  The image i'm showing you was found on google but this looks exactly like mine does.  The model of my imac is the late 2011 model. Impact of denied entry to Croatia on trying to enter a Schengen country with a valid visa How do I find a command if I don't know its name? Is there an elementary proof that $\sum \limits_{k=1}^n \frac1k$ is never an integer? If $n&gt;1$ is an integer, then $\sum \limits_{k=1}^n \frac1k$ is not an integer.  If you know , then you know there must be a prime $p$ between $n/2$ and $n$, so $\frac 1p$ appears in the sum, but $\frac{1}{2p}$ does not. Aside from $\frac 1p$, every other term $\frac 1k$ has $k$ divisible only by primes smaller than $p$. We can combine all those terms to get $\sum_{k=1}^n\frac 1k = \frac 1p + \frac ab$, where $b$ is not divisible by $p$. If this were an integer, then (multiplying by $b$) $\frac bp +a$ would also be an integer, which it isn't since $b$ isn't divisible by $p$.  Does anybody know an elementary proof of this which doesn't rely on Bertrand's Postulate? For a while, I was convinced I'd seen one, but now I'm starting to suspect whatever argument I saw was wrong. In Bash, suppose I visit a directory, and then another directory. I would like to copy a file from the first directory to the second directory, but without specifying the long pathnames of them. Is it possible?   My temporary solution is to use /tmp as a temporary place to store a copy of the file. cp myfile /tmp when I am in the first directory, and then cp /tmp/myfile . when I am in the second directory. But I may check if the file will overwrite anything in /tmp.  Is there something similar to a clipboard for copying and pasting a file? In computer science we discuss an abstract machine called a "deterministic finite automaton". The standard initialism for this term is "DFA". This makes sense in the singular usage of the initialism.  However, the pluralization of the word "automaton" is "automata". One speaks of "an automaton" or "many automata". Consequently, it seems intuitive to form an initialism of the phrase "deterministic finite automata" as "DFA".   This does not seem correct, as "DFA" could be either plural or singular. On the other hand, "DFAs" also does not seem correct because it would seem to expand to "deterministic finite automatons", a phrase which no self-respecting computer scientist would ever utter.   This appears to be a duplicate of the question here   But that question was never clearly resolved. What to do? How do you install Google Chrome on Ubuntu? Prove that $1+\frac{1}{3}+\frac{1\cdot 3}{3\cdot 6}+\frac{1\cdot 3\cdot 5}{3\cdot 6 \cdot 9}+.........=\sqrt{3}$ Prove that $$1+\frac{1}{3}+\frac{1\cdot 3}{3\cdot 6}+\frac{1\cdot 3\cdot 5}{3\cdot 6 \cdot 9}+.........=\sqrt{3}$$   $\bf{My\; Try::}$ Using Binomial expansion of  $$(1-x)^{-n} = 1+nx+\frac{n(n+1)}{2}x^2+\frac{n(n+1)(n+2)}{6}x^3+.......$$  So we get $$nx=\frac{1}{3}$$ and $$\frac{nx(nx+x)}{2}=\frac{1}{3}\cdot \frac{3}{6}$$  We get $$\frac{1}{3}\left(\frac{1}{3}+x\right)=\frac{1}{3}\Rightarrow x=\frac{2}{3}$$  So we get $$n=\frac{1}{2}$$  So our series sum is $$(1-x)^{-n} = \left(1-\frac{2}{3}\right)^{-\frac{1}{2}} = \sqrt{3}$$  Although I know that this is the simplest proof, can we solve it any other way someting like defining $a_{n}$ and then use Telescopic sum.  Thanks. Cardinality of a totally ordered union Let $(X_{\alpha})_{\alpha \in A}, (Y_{\alpha})_{\alpha \in A}$ be families of sets such that for $\{X_{\alpha} \mid \alpha \in A \}$ and $\{Y_{\alpha} \mid \alpha \in A \}$ are totally ordered by inclusion. We have $(X_{\alpha},Y_{\alpha}) \neq (X_{\beta},Y_{\beta})$ for $\alpha \neq \beta$. Suppose that $|X_{\alpha}| \leq |Y_{\alpha}|$ for any $\alpha \in A$. It is true that $|\bigcup_{\alpha} X_{\alpha}| \leq |\bigcup_{\alpha} Y_{\alpha}|$? Finding the distribution of sum of Lognormal Random Variables I am trying to find the distribution of sum of 2 lognormal random variables. I referred the literature available on Cross validated, Stack overflow and few papers before posting this.   I used convolution to find the distribution of sum of 2 lognormal rvs. The approximation works for difference. But, not for sum. I am getting a nasty kink at 0 in both CDF and PDF. I could not recognize the reason. With few tweaks, the shape of the distribution comes right. But, I am not sure what I was doing is right.   Can somebody guide me here? Why does my procedure run slowly until I update statistics? How do I disable search-as-you-type text in Ubuntu 17.10 and later? I cannot find enable-interactive-search in    gsettings set org.gnome.nautilus.preferences enable-interactive-search true.     I searched using    gsettings list-recursively | grep search     and    gsettings list-recursively | grep interactive     but no such option.  Can you help me disable this in Ubuntu 17.10 and later? How can I make a macOS Mojave bootable USB installer in Windows 10? I have downloaded and saved macOS Mojave installation file from the Mac App Store into my external hard drive. Unfortunately, macOS has crashed on my Mac and now I need to install it again. I have used a software named TransMac to make a installation USB in windows following the steps in the link below:    But the provided USB drive after all these steps doesn't show up in my MacBook pro. Considering that I have saved Install macOS Mojave.app on my external hard drive, and I don't have access to any other Mac computers, How can I fix this issue and build a USB for installing Mojave? Symmetrical twin paradox in a closed universe Take the following gedankenexperiment in which two astronauts meet each other again and again in a perfectly symmetrical setting - a hyperspherical (3-manifold) universe in which the 3 dimensions are curved into the 4. dimension so that they can travel without acceleration in straight opposite directions and yet meet each other time after time.  On the one hand this situation is perfectly symmetrical - even in terms of homotopy and winding number. On the other hand the Lorentz invariance should break down according to , so that one frame is preferred - but which one?  So the question is: Who will be older? And why?  And even if there is one prefered inertial frame - the frame of the other astronaut should be identical with respect to all relevant parameters so that both get older at the same rate. Which again seems to be a violation of SRT in which the other twin seems to be getting older faster/slower...  How should one find out what the preferred frame is when everything is symmetrical - even in terms of GRT?  And if we are back to a situation with a preferred frame: what is the difference to the classical Galilean transform? Don't we get all the problems back that seemed to be solved by RT - e.g. the speed limit of light, because if there was a preferred frame you should be allowed to classically add velocities and therefore also get speeds bigger than c ?!? (I know  is only a local theory but I don't understand why the global preferred frame should not 'override' the local one).  Could anyone please enlighten me (please in a not too technical way because otherwise I wouldn't understand!)  EDIT Because there are still things that are unclear to me I posted a follow-up question: What is the difference between "accumulative" and "cumulative"? I'm having a hard time understanding the real distinction between  and .  accumulative     adjective         tending to accumulate or arising from accumulation; cumulative.   tending to accumulate wealth; acquisitive.      cumulative     adjective         increasing or growing by accumulation or successive additions: the cumulative effect of one rejection after another.   formed by or resulting from accumulation or the addition of successive parts or elements.   of or pertaining to interest or dividends that, if not paid when due, become a prior claim for payment in the future: cumulative preferred stocks.      These definitions (and those from other dictionaries as well) say different things but I can't understand how they aren't really meaning the same thing.  Yet, when thinking about it, it seems there are some cases where it is distinctly more correct to use one or the other.  What's the difference, practically? The temperature and pressure everywhere inside the Sun reach the critical point to start nuclear reactions - there is no reason for it to take such a long time to complete the reaction process.  Just like a nuclear bomb will complete all the reaction within $10^{-6}$seconds.  Why does most of the hydrogen of the Sun still not react even though it reaches the critical point, and why take stars billions of years to run out of fuel? How fill face between irregular curves? Hello Blender Stack Exchange,  I am trying to fill a face between 4 surfaces. Two are straight edges and two are a curved line made up of short vertices that came from a SketchUp export.  The problem: I select the vertices on the top and bottom and fill the hole. It creates a strange face that ruins the curve. I would prefer it create some sort of complex curve. I want it to be smooth.  Images attached to better explain.