I'm using a Moto G(2014) model. I recently upgraded my android to 6.0 and I noticed my computer doesnt display my files when I connect via USB. I changed the USB notification option to MTP and now I can view my internal storage files but my SD card is still showing an empty folder. How do I fix this?   Edit: I tried to copy files onto my SD card and they transferred without any problem but I can't view the existing files on my SD card.
When my phone MOTOROLA G3(2015) is updated to Marshmallow, its not showing files when connected to PC. While connecting, it shows options as charing only, PTP, MTP, MIDI. When I select MTP, it shows the external card, but not showing the contents, where as internal memory is detected and all files are shown.
What are the most common pitfalls awaiting new users? I am able to solve simple differential equations like :  $$\dfrac{dy}{dx} = 3x^2 + 2x$$  We simply bring $dx$ to other site and integrate.  But how do we find solutions of differential equations like :  $$\frac{d^2x}{dt^2} + \dfrac{kx}{m} = 0$$  ?  We have been told the solution is $x(t) = A\cos ( \omega t + \phi_o)$ where $\omega\ =\sqrt{\dfrac{k}{m}}$  but how do we actually find it? Triple integral limits over pyramid Curve Object Deformed by Curve - Distortions (Artefacts) Shaping curve object by curve (modifier) results in a terrible shape with cracked surface. Here is an extreme situation, but good visible issue.  Perspective   Top   How can I curve it smootly without adding more control points or remeshing? Why is my variable local in one 'while read' loop, but not in another seemingly similar loop? Why do I get different values for $x from the snippets below?  #!/bin/bash  x=1 echo fred &gt; junk ; while read var ; do x=55 ; done &lt; junk echo x=$x  #    x=55 .. I'd expect this result  x=1 cat junk | while read var ; do x=55 ; done echo x=$x  #    x=1 .. but why?  x=1 echo fred | while read var ; do x=55 ; done echo x=$x  #    x=1  .. but why? Write a number with two decimal places SQL Server How to find out who called a method? Is there way to enable more than 4 GB RAM in 32-bit Windows OS? I upgraded my PC to 4 GB RAM and I get only 3 GB. Windows 7 32-Bit consider that I've 4 GB RAM but didn't use more than 3 GB.  Someone told me that MS Windows 32-bit doesn't support RAM larger than 3 GB.  So please is there any way to make my OS "Windows 7 32-Bit" support more than 3 GB RAM ?  *`Note: I can't move to 64-bit because I've many program doesn't work with a 64-bit OS.  Edit::  I tried what Mr. Wonsungi advised me but whenever I check this option:      Enable support for 4 GB of RAM   I get the following error:      'Cannot access to the registry key   HKEY_CLASSES_ROOT\CLSID\{E88DCCE0-11d1-A9F0-00AA0060FA31}.'   There is no "CLSID" in my registry, I don't know why!. How to understand the combination formula? I'm reading an algorithm book. In which it mentioned:     Imagine (once again) you have n people lined up to see a movie, but   there are only k places left in  the theater. How many possible   subsets of size k could possibly get in? That’s exactly $C(n,k)$, of   course,  and the metaphor may do some work for us here. We already   know that we have $n!$ possible orderings of  the entire line. What if   we just count all these possibilities and let in the first $k$? The only   problem then is  that we’ve counted the subsets too many times. A   certain group of k friends could stand at the head of  the line in a   lot of the permutations; in fact, we could allow these friends to   stand in any of their $k!$  possible permutations, and the remainder of   the line could stand in any of their $(n–k)!$ possible  permutations   without affecting who’s getting in. Aaaand this gives us the answer!       $$C(n,k)= \frac{n!}{k!(n −k)!}$$      This formula just counts all possible permutations of the line (n!),   and divides by the number of  times we count each “winning subset,” as   explained.   I'm not quite understand why the reminder can in any $(n-k)!$ permutation, if he stands at the end of the queue, won't he let all these people in?  And why I should use $n!$ to divide by $k!(n-k)!$ ? Didn't see that consequence from the metaphor.  If you have better ideas to explain this formula, you can use them of course. Square roots -- positive and negative It is perhaps a bit embarrassing that while doing higher-level math, I have forgot some more fundamental concepts. I would like to ask whether the square root of a number includes both the positive and the negative square roots.  I know that for an equation $x^2 = 9$, the solution is $x = \pm 3$. But if simply given $\sqrt{9}$, does one assume that to mean only the positive root? And when simply talking about the square root of a number in general, would one be referring to both roots or just the positive one, when neither is specified? Nicely force 66 characters per line biblatex, authoryear style: In-text citations display first name initials for certain bibliography entries Version of the app: 1.0.51. (It is up to date at the time of writing according to Google Play.)  This started happening after the network problem that happened earlier this morning. Both my tablet and my phone are popping up notifications for events (comments, and probably edits too) that happened prior to the network issue. I had received notifications for these events already and had already cleared them before the network issue happened.  The repeated notifications do not show up in the bar displayed at the top of the Stack Exchange sites. In other words, I get notified again in Android but do not get notified again on the SE web sites. I have a ~23000 line SQL dump containing several databases worth of data. I need to extract a certain section of this file (i.e. the data for a single database) and place it in a new file. I know both the start and end line numbers of the data that I want.  Does anyone know a Unix command (or series of commands) to extract all lines from a file between say line 16224 and 16482 and then redirect them into a new file? Are there concerns with doing a generalized additive model with a smoothing term of multiple variables? In R, usually one performs a generalized additive model like so:  library(mgcv) x &lt;- gam(depvar ~ s(indvar1) + s(indvar2) + parametricvar)   Say I want to explore the non-parametric interaction of indvar1 and indvar2.  Is the following kosher?  x &lt;- gam(depvar ~ s(indvar,indvar2) + parametricvar) In the  question one of the answers had the following code snippet:  IEnumerable&lt;object&gt; FilteredList() {     foreach(object item in FullList)     {         if(IsItemInPartialList(item))             yield return item;     } }   What does the yield keyword do there?  I've seen it referenced in a couple places, and one other question, but I haven't quite figured out what it actually does.  I'm used to thinking of yield in the sense of one thread yielding to another, but that doesn't seem relevant here. Why is "high" pronounced "hiy" but is not spelled that way? Android app should send edits to edit queue if necessary rather than rejecting them I edited a question, on Stack overflow and when submitting preview, got red bar telling me my account isn't allowed to make suggested edits.  On the Sandbox android question it works fine, but that is editing an answer to my question.   The message I receive is:     Account is not allowed to suggest edits   Are the rules for suggested edits different for Android app? How to control your iPad with your Mac remotely? I would like to know, is there a way to control your iPad with your Mac remotely (be able to see and manipulate iPad's desktop on your Mac)? I know that with the TeamViewer or other programs you can control your Mac with your iPad but not vice versa. Sanity check question about correlation between log-normal random variables Recently I came across the following result in a paper, which I can't seem to find right.  Anyway the authors had cited  by Johnson &amp; Kotz, page 20 as the source. Since I do not have access to this book I am unable to check on the derivation of this result. I was hoping someone could shed some light on how to prove this.  Let $X$ and $Y$ denote a pair of bivariate log normal random variables with their means and variances given by the ordered pairs $(\zeta_{X}, \eta_{X})$ and $(\zeta_{Y}, \eta_{Y})$ and with correlation coefficient $\rho_{(X, Y)}$, derived from the bivariate normal with marginal distributions having parameters $(\xi_{X}, \nu_{X}^2)$ and $(\xi_{Y}, \nu_{Y}^2)$ and correlation coefficient $\rho_{N}$.  The expression for $\rho_{(X, Y)}$ is given as \begin{equation} \rho_{(X, Y)} = \dfrac{\mathrm e^{(\rho_{N} \nu_{X} \nu_{Y})} - 1}{\sqrt {(\mathrm e^{\nu_{X}^2} - 1)(\mathrm e^{\nu_{Y}^2} - 1)}} \end{equation}  The below is a manipulation I came up with, any error in that would be completely mine.  Upon rearranging we get \begin{equation}\begin{aligned} \rho_N &amp;= \dfrac{\ln (1 + \rho_{(X, Y)} \sqrt {(\mathrm e^{\nu_{X}^2} - 1)(\mathrm e^{\nu_{Y}^2} - 1)})}{\nu_{X}\nu_{Y}}\\ &amp;= \dfrac{\ln (1 + \rho_{(X, Y)} \frac{\eta_{X}\eta_{Y}}{\zeta{X}\zeta{Y}})}{\sqrt {\ln ((\frac{\eta_{X}}{\zeta_{X}})^2 + 1)\ln ((\frac{\eta_{Y}}{\zeta_{Y}})^2 + 1)}}. \end{aligned} \end{equation}  I am very interested in learning if this result would hold true between $X$ and $Y$'s correlations if we had a quad-variate situation as in there were 2 more random variables which are also correlated with $X$ and $Y$ would this result still be true ? I suspect it should be, but I am newbie and due to lack of a credible source I was wondering if some one would be kind to confirm it.