:  You'll remove most of the wax and residue by rinsing the apple under cool water  Is this true? Ideally, I'd like for some actual scientific research that compares various methods for washing/cleaning apples.
I love apples. I like to eat them with skin as it has plenty of fiber in the skin. But apples are famous for wax and pesticides on the skin which I don’t want to ingest. I have read many articles on the web and suggestions for removing the wax from the surface.   These suggestions include soaking in vinegar or hot water and other methods. They suggest that soaking apples in vinegar removes the wax that can be seen in the vinegar. I have done that, but never seen any residue of wax in the vinegar.   So I have set aside a new kitchen sink Scotch-Brite scrubber for this purpose and been scrubbing the apple skin under running water before eating. I think this method should remove most of the wax and pesticides. I would like to hear your input.
Is there a general formula for finding all subgroups of dihedral groups? How to install Windows on GPT disk without UEFI BIOS? Steam Install Error on 14.04 Ubuntu 64bit So, for example, when I type man ls I see LS(1). But if I type man apachectl I see APACHECTL(8) and if I type man cd I end up with cd(n).  I'm wondering what the significance of the numbers in the parentheses are, if they have any. No Indian (and Bengali) keyboard layout in Ubuntu 17.04? I've upgraded from Ubuntu 16.10 to 17.04 today. I'm from Bangladesh, and Bengali is my native language. There was an option to set keyboard layout to Bengali in all previous Ubuntu versions I've used. But there's no such option in 17.04, strangely. I can use Bengali by installing the package ibus-m17n,  so I thought maybe there was some problem during my upgrade. But then I checked my friend's PC which runs ubuntu 16.10 and found that ibus-m17n was not installed in 16.10 but there's option for Bengali keyboard layout. So is Bengali keyboard support really removed from 17.04, or was there a problem during my upgrade? Find the sum to n terms as well as the sum to infinity of the series: Find the sum to $n$ terms as well as the sum to infinity of the series:  $$\frac{1}{3} + \frac{1}{4\cdot 2!} + \frac{1}{5\cdot 3!} +\cdots.$$  I was trying this question many times but I didn't get the answer. I was using geometric series formula, but it was not applicable here...I don't know where I have to start, and I don't know any hint about this series....  If anybody helps me, I would be very thankful to him. If I have an IEnumerable like:  string[] items = new string[] { "a", "b", "c", "d" };   I would like to loop thru all the pairs of consecutive items (sliding window of size 2). Which would be   ("a","b"), ("b", "c"), ("c", "d")   My solution was is this       public static IEnumerable&lt;Pair&lt;T, T&gt;&gt; Pairs(IEnumerable&lt;T&gt; enumerable) {         IEnumerator&lt;T&gt; e = enumerable.GetEnumerator(); e.MoveNext();         T current = e.Current;         while ( e.MoveNext() ) {             T next = e.Current;             yield return new Pair&lt;T, T&gt;(current, next);             current = next;         }     }   // used like this :  foreach (Pair&lt;String,String&gt; pair in IterTools&lt;String&gt;.Pairs(items)) {     System.Out.PrintLine("{0}, {1}", pair.First, pair.Second)  }   When I wrote this code, I wondered if there are already functions in the .NET framework that do the same thing and do it not just for pairs but for any size tuples.  IMHO there should be a nice way to do this kind of sliding window operations.  I use C# 2.0 and I can imagine that with C# 3.0 (w/ LINQ) there are more (and nicer) ways to do this, but I'm primarily interested in C# 2.0 solutions. Though, I will also appreciate C# 3.0 solutions. Package repository down, how to relocate? I would like to use the function of TeXnicCenter 1.0, where is automatically downloads missing packages used. The problem is, that the repository it wants to download from does not exist anymore (the one on piotrkosoft.net).  How do I get TeXnicCenter to try with another repository? elementary ring proof with composition of functions and addition of functions as operations Consider the set $\mathcal{F}=\lbrace f\mid \mathcal{f}:\Bbb{R}\to\Bbb{R}\rbrace$, in which an additive group is defined by addition of functions and a second operation defined as composition of functions. The question asks to verify that the resulting structure does not satisfy the ring properties.     This is the question 24.10 from Modern Algebra, by Durbin, 4th edition.  So what I have so far is that all of the properties for the additive group (with addition of functions as the operation here) hold, associativity of the composition of functions hold, and that the failure must come from the distributive laws.  My proof of my claim, so far;  $$1\,\,\,\,\,[(\mathcal{f}\circ\mathcal{g})+\mathcal{h}](\mathcal{x})=\cdots=\mathcal{f}(\mathcal{g}(\mathcal{x}))+\mathcal{f}(\mathcal{h}(\mathcal{x})).$$ ...but,  $$2\,\,[(\mathcal{f}\circ\mathcal{g})+\mathcal{h}](\mathcal{x})=$$ $$3\,\,(\mathcal{f}\circ\mathcal{g})(\mathcal{x})+\mathcal{h}(\mathcal{x})=$$ $$4\,\,\,\mathcal{f}(\mathcal{g}(\mathcal{x}))+\mathcal{h}(\mathcal{x}).$$ ...which brings me to my contradiction of the properties of rings that;  $$5\,\,\,[\mathcal{f}\circ(\mathcal{g}+\mathcal{h})](\mathcal{x})\neq[(\mathcal{f}\circ\mathcal{g})+\mathcal{h}](\mathcal{x}).$$  So my question is, is this the correct path to showing the distributive laws are not obeyed when composition is taken as an operation on $\mathcal{F}$? particularly my proceeding from 2 to 3 to 4 is what i feel uncomfortable about, like i may be missing a step in there.  thanks Is there any reason to use this-> I am programming in C++ for many years, still I have doubt about one thing. In many places in other people code I see something like:  void Classx::memberfunction() {     this-&gt;doSomething(); }   If I need to import/use that code, I simply remove the this-> part, and I have never seen anything broken or having some side-effects.  void Classx::memberfunction() {     doSomething(); }   So, do you know of any reason to use such construct?  EDIT: Please note that I'm talking about member functions here, not variables. I understand it can be used when you want to make a distinction between a member variable and function parameter.  EDIT: apparent duplicate: Bluetooth headset never gives me sound options I know people prefer using CorelDraw or Adobe Illustrator, but I want to know if there is a technique I can follow to use Adobe Photoshop to make vector Images. I bought my kids a PC and installed 12.04 (Unity) on it.  The bottom line is, I want my children to use the computer unsupervised while I have confidence they cannot access anything inappropriate.  What I have looked at:  I was looking at Scrubit a tool which allows me configure my wifi router to block content and this solution would also protect my other PC and mobile devices.  This may be overkill as I just want the solution to work on one PC.    I also did some Google searches and came across the application called .  My experience of OSS is that the best solutions frequently never appear first on a Google search list and in this case I need to trust the methods therefore my question is very specific.   I want to leverage your knowledge and experience to understand What is the best way to restrict adult content on 12.04 LTS as this is important to me.  It maybe a combination of things so please don't answer this question "try this or that", then give me some PPA unless you can share your experience of how good it is and of course if there are any constraints. I am buing assamble self PC for playing games.  I am wondering, all the drivers, which are most likely for Windows, can i just use them on Ubuntu?  So if i understand you right, it will automaticaly detect the drivers, no need for installs ? or it find custom drivers for ubuntu.  This is the setup, will there be any problem with it? How much can a grappler with reach move a grappled creature inside its reach? If $n$ is a natural number $\ge 2$ how do I prove that any graph with $n$ vertices has at least two vertices of the same degree? Any help would be appreciated.  If $n$ is a natural number $\ge 2$ how do I prove that any graph with $n$ vertices has at least two vertices of the same degree? Can apostrophe 's' be used with 'etc.'? Forced to Quit PhD although the hard and proved work For positive real numbers $a,b,c$ with $abc = 8$ prove that   $$ \frac{a^2}{\sqrt{(1+a^3)(1+b^3)}} + \frac{b^2}{\sqrt{(1+b^3)(1+c^3)}} + \frac{c^2}{\sqrt{(1+c^3)(1+a^3)}} \geq \frac{4}{3}. $$   Can we prove this by Cauchy-Schwarz or Jensen's inequality? If not how? Expected prediction error - derivation