A powerful opponent made a long speech criticizing John. This speech was so powerful that it threatened John's political career. John decided to try to change his rival's opinion of him. To do this, he sent a letter to him asking for a favor.   Instead of using "try to change", can I use this expression "try changing"? Does it sound awkward? Grammatically wrong?
Is there any differences between      Try to do   And     Try doing   Thank you in advence.
The search parameter isanswered ignores acceptances The SE definition of "answered" question is: has an answer that is either accepted or has positive score. But the search parameter isanswered appears to ignore the "accepted" clause: when set to "no" it still returns questions with an accepted answer, as long as it has 0 score.    to reproduce the bug (unless meta effect kicks in and the answers get upvotes).     By the way, it seems that isanswered works only when is:question is present, but I'm not complaining about that... yet.   Also, this parameter is not listed on the , but I'm not complaining about that either... yet. Is there a problem with Beamer in the latest MiKTeX update? This is about MiKTeX Revision 2.9.6360.  Immediately after the latest MiKTeX update, my Beamer files stopped compiling.  When i tried to compile a file that had been working fine I got a Package installation popup saying:  tex\latex\beamer\beamerbasemodes.sty  Is missing.  It is part of the following package  beamer   So i clicked to have it installed.  All that achieved is that i got an error message  ! LaTeX error: File 'beamerbasemodes.sty' not found   I repeated this a few times with minor changes to the file, and then went to the MiKTeX Package Manager to see what parts of Beamer are installed.  It said none were.  Either the update had removed Beamer, or the attempt to install beamerbasemodes on the fly had done it.  So I reinstalled it by hand.  In fact i did this several times in various ways.  It made one difference.  Sometimes the problem package was identified as  translator.sty  In case it would help, I ran Update FNDB and restarted my machine.  Each time I installed Beamer, the Package Manager then reported that Beamer was installed.    But when I tried to compile the file, the same things happened all over.   And when i went back to the MiKTeX Package Manager it reported Beamer is not installed.   Is Beamer now out of date?  Or is this a problem on the new update?  Is there a simple fix i can use? Compare using Thread.Sleep and Timer for delayed execution I have a method which should be delayed running for a specified amount of time.  Should I use  Thread thread = new Thread(() =&gt; {     Thread.Sleep(millisecond);     action(); }); thread.IsBackground = true; thread.Start();   Or  Timer timer = new Timer(o =&gt; action(), null, millisecond, -1);   I had read some  about using Thread.Sleep is bad design. But I don't really understand why.  But for using Timer, Timer has dispose method. Since the execution is delayed, I don't know how to dispose Timer. Do you have any suggestions?  Or if you have alternative codes for delayed execution are also appreciate. I can't play Pokemon GO! What's wrong? Pokemon GO isn't working at all for me right now. I'm in one of the following circumstances and can't do anything:   My game is displaying a "Try Again" message I'm stuck on the Loading Screen When I sign in I get a message that the servers are experiencing problems. I see the map but nothing is loaded, and my team color is wrong The "loading" Pokeball just ends up spinning and I can't catch or interact with things When I try to catch a Pokemon, the Pokeball just sits on my screen doing nothing Gym opponents will drop to 1 HP and won't take any more damage or attack When I open a pokestop, the pokestop image and the name of the pokestop does not load.   What's causing this? Is there a way to fix it? List changes unexpectedly after assignment. Why is this and how to prevent it? I was wondering about the reason of the choose of the X as symbol used to represents the "Close application" operation. Huge close votes review queue on Stack Overflow Today, the size of the close-votes queue is 55k questions and growing. Is that a problem?   Which action could be taken to clean it up? It seems to be growing faster than Stack&nbsp;Overflow members are capable to handle it. Any data for average number of papers per year at different career stages? Affiliate Ads Are Coming To The Network Some time ago, we announced that . This has gone well and we're extremely thankful to everyone for their support and feedback. Because it has been successful so far, we're going to be extending the program to the majority of our graduated sites. Well, we've pretty much already done that, but there are quite a few sites that have ads enabled, yet still display nothing. The thing is, we don't really have an abundance of clients offering products that a  would find relevant, but Amazon has stand mixers, a selection of super fine chinois, deliciously sharp cutlery and enough cast iron to fill the Gulf Of Mexico with . Beginning as early as this week (week of 5 February 2018), our ad team is going to be hand selecting affiliate ads to be displayed on select sites. The use of inventory will of course depend on the availability of relevant ads to display which means:  Some sites might see very few, if any ads. Some topics simply don't come remotely close to orbiting anything worth advertising. Furthermore, while graduated, some sites simply don't have enough activity for ads to make sense.  Since these are hand-selected, it could take a while for ads to appear initially.  These would of course yield to inventory from clients if clients had products that were relevant to any given topic.   Nothing changes when it comes to the . If you're used to occasionally seeing a community promotion ad, you'll just notice that you'll also occasionally see an ad for something that is likely to be of interest to someone interested in the topic that your site covers. In fact, to be clear, this is simply a continuation of the announcement we made in November of 2016. We just wanted folks to know that we're going to be continuing the program where there's good potential to show relevant advertisements, even if we don't have clients lined up with a demand for it. Where can I give feedback about a certain ad on [site]? Open a meta post on your per-site meta and let us know. Please remember, the bulk of advertisements are an effort to get something small back from folks that hit the sites through search engines and are extremely unlikely to ever become contributors. Their soufflé stopped falling, and we'll probably never see them again. Maybe we can get a few bucks once they realized that copper ions help egg whites stiffen properly and buy a bowl or a proper bloom whisk. However, you're the experts on these topics and we're very likely going to listen to you. What sites, specifically? Are any sites exempt? If you're a former Stack Exchange 1.0 site and / or subsequently joined the network under a special charter, nothing changes - don't panic :) For the rest, we're just extending what we're currently doing with ads on graduated sites to also include those where there's an opportunity to make sensible use of affiliate ads. If a site has less than 15k (average) daily visits, or fewer than roughly 50k combined total posts - it might not yet be time to invest in selecting ads to be shown there. But, part of this exercise is also seeing what works best. I don't really have feedback, just some suggestions Ads aren't just an opportunity to sell stuff, they're an opportunity to really show people that we understand a given topic. That, of course, makes suggestions from people that do that stuff every day quite valuable. Post on your per-site meta and our community / ad critters will take a look. Questions? Comments? Kvetches? Let us know in an answer or comment below. If anything about the plan changes, we'll update this post to let folks know. Find the smallest value of $c$ such that $(1-x)\ln(1-x)+(1+x)\ln(1+x)\leq c x^2$ holds for $0&lt;x&lt;1$.   I saw the curve and realized this is true for $c=2$. How can I prove it? What is the smallest $c$ that still makes the inequality valid?  I think we should use the Taylor expansions of the $\ln$s. How to find the limit of a sequence? Question:  If $0 &lt; x &lt; \frac{\pi}{2}$ and $f_k(x) = \tan(x)+\frac{1}{2}\tan(x/2)+ ...+\frac{1}{2^k}\tan(x/2^k)$.  In Sigma Notation: $$f_k(x) = \sum_{n=0}^k \frac{1}{2^n}\tan\frac{x}{2^n}$$  Find $$\lim_{k\to \infty}f_k(x)$$  I'm not quite sure how to take the limit of a sequence, I've never seen this before, If someone could help me solve this it would be greatly appreciated. Show that $f$ is differentiable on $(−1, 1)$. Let $f$ be a function defined on the interval $(−1, 1)$ such that for all $x, y \in (−1, 1)$, $$f(x + y) = \frac{{f(x) + f(y)}}{{1 - f(x)f(y)}}.$$ Suppose that $f$ is differentiable at $x = 0$, show that $f$ is differentiable on $(−1, 1)$.  Need your kind guidance and help. Thanks in advance! Ignoring accented letters in string comparison I need to compare 2 strings in C# and treat accented letters the same as non-accented letters. For example:  string s1 = "hello"; string s2 = "héllo";  s1.Equals(s2, StringComparison.InvariantCultureIgnoreCase); s1.Equals(s2, StringComparison.OrdinalIgnoreCase);   These 2 strings need to be the same (as far as my application is concerned), but both of these statements evaluate to false. Is there a way in C# to do this? Which command should I use for displayed equations? A number of related questions have already been asked about this issue:       and even    But I'm still confused by the conflicting suggestions that have been given so far. So I'm trying again.  Which should be the preferred command to produce a displayed equation in my LaTeX documents?  So far the suggestions indicate that one should use \[ ... \], maybe \begin{equation*} ... \end{equation*}, or maybe even the gather* or align* environments from amsmath.  And one should definitely avoid using either $$...$$ or the eqnarray environment.  Now I have to say that, from a language perspective, I have a strong preference for the equation* environment because it is less cryptic than the \[ ... \] notation and it is  the most accurate.  So, is it fine to use equation*? Maybe only after loading amsmath? Or should the equation/equation* environment be redefined to something else so that spacing, package support, or whatever is improved? Converting string to tuple and adding to tuple I am generating one report where I need to use background image. But I found that image always starts leaving some margin space to left side.    \documentclass{article} \usepackage{wallpaper} \usepackage{mdframed} \usepackage[top=2cm, bottom=2cm, outer=0cm, inner=0cm]{geometry} \begin{document}  Some content \ThisLRCornerWallPaper{1.0}{image.jpg} \end{document}    How can I use background image covering whole page? I have just updated Windows 7 to Windows 10.  My touchpad scolling (right-side) is not working anymore.    I have no idea how to fix this in Windows 10.  I have hit the start button and typed "synaptic", but have found nothing useful.  I used to have an icon on the taskbar that showed where I was touching the touchpad.  I used to be able to right-click that icon to change settings, but Windows 10 has not brought that icon over.  Also, the asus website has no synaptic touchpad drivers available for Windows 10.  I have tried the enaltech drivers, but upon the installation atempt I am told that my hardware is not correct. If N and every subgroup of N is normal in G then G/N is abelian . Let $N$ be a normal subgroup of a group $G$ such that every subgroup of $N$ is normal in $G$ and $C_G(N)\subseteq N $. Prove that $G/N$ is abelian.   Here, as usual, $C_G\left(N\right)$ means the centralizer of $N$ in $G$ (i.e., those elements of $G$ that commute with everything in $N$).  I think we need to use that every subgroup of $N$ is normal in $G$ but i can't use .Please help me with Hints. How do I find out which repository a package comes from? Is there a method or command which can tell from which repository a package is coming from? I've found in Wikipedia the formula for calculating an individual row in Pascal's Triangle: $$v_c = v_{c-1}\left(\frac{r-c}{c}\right).$$ where $r = \mathrm{row}+1$, $c$ is the column starting from $0$ on left and $v_0 = 1$.  Now, I've tried to do by hand and it works,  but I don't understand how to find this magic formula when I don't have access to Wikipedia...:)