My device is stuck in bootloop and my USB debugging is disabled. When I type adb devices in CMD, it says adb is not recognized as an internal or external command operable program or batch file. Please help
When it comes to , I often read recommendations like "Use adb logcat to find some more details". Looking for a good way to backup all my apps including their data,  refers to adb backup and adb restore. In several places one can find ways to remotely do on an Android device with the use of , such as transferring files using adb push or adb pull, accessing the  via adb shell, and more. So ADB seems to be a good thing to have for an Android user.  But how to get this "ADB thingy" on my computer? Not being a developer, installing the entire  seems a bit overkill. Is there a more minimalistic approach available?
Should I use exit() or just return statements in main()? Personally I favor the return statements because I feel it's like reading any other function and the flow control when I'm reading the code is smooth (in my opinion). And even if I want to refactor the main() function, having return seems like a better choice than exit().  Does exit() do anything special that return doesn't? The times they are a-changin' How do I show that:  $$\frac{1}{\sin^{2}\frac{\pi}{14}} + \frac{1}{\sin^{2}\frac{3\pi}{14}} + \frac{1}{\sin^{2}\frac{5\pi}{14}} = 24$$  This is actually problem B $4371$ given at this . Looks like a very interesting problem.   My attempts: Well, I have been thinking about this for the whole day, and I have got some insights. I don't believe my insights will lead me to a $\text{complete}$ solution.   First, I wrote $\sin\frac{5\pi}{14}$ as $\sin\frac{9 \pi}{14}$ so that if I put $A = \frac{\pi}{14}$ so that the given equation becomes, $$\frac{1}{\sin^{2}{A}} + \frac{1}{\sin^{2}{3A}} + \frac{1}{\sin^{2}{9A}} =24$$ Then I tried working with this by taking $\text{lcm}$ and multiplying and doing something, which appeared futile. Next, I actually didn't work it out, but I think we have to look for a equation which has roots as $\sin$ and then use $\text{sum of roots}$ formulas to get $24$. I think I haven't explained this clearly.         $\text{Thirdly, is there a trick proving such type of identities using Gauss sums ?}$ One post related to this is:  I don't know how this will help as I haven't studied anything yet regarding Gauss sums. What are the recommended textbooks for introductory calculus? I've already taken my calculus sequence and I'm interested in brushing up and staying sharp on the basics. So far, my calculus background is limited to single-variable calculus, which I applied in my physics sequence and engineering statistics. I learned a little bit of vector math in physics as well, but I'm not strong in it. My mathematical strengths lie in the discrete mathematics.  I'm particularly interested in studying for my IEEE Certified Software Development Associate exam - 10% of the exam is mathematics (calculus, differential equations, and statistics). Calculus is one of the mathematics knowledge areas that a software engineer should be competent in, so I'm looking for not only solidifying the courses that I've already taken, but moving forward with slightly more advanced topics, at an undergraduate mathematics level.  I'm currently using the textbook from my calculus sequence, but I'm interested to know what books other people used to learn calculus and if the book is potentially worth checking out.  What books are available to help me? I am wondering whether there is a bulletproof way to know if one is successful in decrypting a file.   As an example, say I encrypt a text file and protect it with a 3 letter password. I use brute force to decrypt it, but two different passwords lead to a file that contains English intelligible text. Is there a way for me to know which one is the original one? In other words, is there an infallible way to know I've entered the password correctly? How do JavaScript closures work? How would you explain JavaScript closures to someone with a knowledge of the concepts they consist of (for example functions, variables and the like), but does not understand closures themselves?  I have seen  given on Wikipedia, but unfortunately it did not help. Childrens fantasy, blind monk leading boy who can control the elements "EOL while scanning single-quoted string"? (backslash in string) How to set selected Dialog values to TextViews in Fragment Loopy integral $\int xe^x\sin(x)$ Get the real width and height of an image with JavaScript? (in Safari/Chrome) Redefining "cited on" string (and others) in biblatex I'm trying to modify the strings biblatex uses to set the "cited on" string used in the bibliography to identify the pages where a given references has been cited.    What I gather from the biblatex documentation (e.g., § 4.9.2.16) is that something like   \renewbibmacro{backrefpage}{&lt;newtext&gt;} \renewbibmacro{backrefpages}{&lt;newtext&gt;}   ought to work, but they have no effect for me (I'd also like to get this working for the "visited on" string, urlseen).  My MWE is unchanged from , with the addition of these (and related lines) just about anywhere. I installed Opera 12.16 from a .deb for reasons. Just assume that I need this specific browser of this specific version and that there’s no alternative.  However, that deb depends on packages (such as the gstreamer0.10 series) which are not in my distribution anymore (Debian testing). This makes apt fail on every operation except apt remove opera with dependency errors:  # apt install cli-common Reading package lists... Done Building dependency tree        Reading state information... Done You might want to run 'apt --fix-broken install' to correct these. The following packages have unmet dependencies:  opera : Depends: gstreamer0.10-plugins-good but it is not installable          Recommends: flashplugin-nonfree but it is not going to be installed E: Unmet dependencies. Try 'apt --fix-broken install' with no packages (or specify a solution).   apt --fix-broken install will just propose to remove opera:  # apt --fix-broken install Reading package lists... Done Building dependency tree        Reading state information... Done Correcting dependencies... Done The following packages will be REMOVED:   opera 0 upgraded, 0 newly installed, 1 to remove and 92 not upgraded. 1 not fully installed or removed. After this operation, 46.6 MB disk space will be freed. Do you want to continue? [Y/n]   Currently, my workaround is to install Opera when I need it, and remove it as soon as anything else needs to be done with apt. This is annoying.  Any suggestions? Ideally, I’d like to make apt ignore the dependencies of opera forever, since it works well-enough for my purposes. How deterministic is floating point inaccuracy? Since arrays and hashes can only contain scalars in Perl, why do you have to use the $ to tell the interpreter that the value is a scalar when accessing array or hash elements? In other words, assuming you have an array @myarray and a hash %myhash, why do you need to do:  $x = $myarray[1]; $y = $myhash{'foo'};   instead of just doing :  $x = myarray[1]; $y = myhash{'foo'};   Why are the above ambiguous?   Wouldn't it be illegal Perl code if it was anything but a $ in that place? For example, aren't all of the following illegal in Perl?  @var[0]; @var{'key'}; %var[0]; %var{'key'}; Ensure a burned DVD will work any dvd player? Let $\mu(\Omega)$ be a probability measure (i.e. $\mu(\Omega) = 1$), and let $f,g$ be non-negative measurable functions on $\Omega$ such that $fg \geq 1$. Show that $1 \leq (\int f^p )(\int g^p)$ for all $0 &lt; p &lt; \infty$   I'm a bit at a loss of what to do. I know that since $fg \geq 1$, we may obtain:  $$\int_{\Omega} d\mu = \mu(\Omega) = 1 \leq \int_{\Omega} fg = \int_{\Omega} |fg|$$ The right-most integral is true since $fg$ is positive and it is equal to $||fg||_1$.  By Hölder's inequality, we obtain:  $$1 \leq \int |fg| \leq ||f||_p ||g||_q = (\int f^p)^\frac{1}{p}(\int g^q)^\frac{1}{q}$$  where $p$ and $q$ satisfy $\frac{1}{p} + \frac{1}{q} = 1$. Raising the left-most and right-most sides of this inequality to the power $p$, I may obtain:  $$1 \leq (\int f^p)(\int g^q)^\frac{p}{q}$$  I now wish to show that $(\int g^q)^\frac{p}{q} \leq \int g^p$, but I've been at a loss of how to do it. Any tips or hints would be greatly appreciated. How to choose the default gcc and g++ version? Interpreting the end of Inception Sorry for the vague title--I don't want the title to be a spoiler.  I've seen the movie three times, and the last two times I looked specifically for clues to this question, but found none.  The final scene in  shows       Cobb's top spinning, as he goes off to be reunited with his children.  The top continues to spin, then the movie ends, without telling us if the top topples--and therefore revealing whether he's in the "real world" or still in a dream. Do we know if he was in a dream at the end of the movie?   I'm assuming the answer is that we simply cannot know.  But did I miss anything?  Were there clues that I missed? What are the advantages of 10-bit monitors? To support 10-bit color the following are needed:   A monitor supporting it. A GPU supporting it (only AMD FirePro and NVIDIA Quadro support this?). Compatible software. Unless I am mistaken there are very few programs out there supporting 10-bit color. Photoshop is a notable example.   The questions are about how 10-bit monitors perform in comparison with 8-bit monitors:   In which situations would a 10-bit monitor give a noticeable advantage over an 8-bit monitor (say, for professional photography)? Have 10-bit monitors been compared against 8-bit monitors based on subjective or objective tests? What were the results? Human eyes can see only 10m colors, so would using a monitor with 1b colors make a difference?