Is there a way to disable this "often used with" prompt on an iPhone?
Remove suggested apps option in iOS 10
What's the simplest way to call Http GET url using Delphi? There's a web services I want to call in my application, I can use it with importing the WSDL or by just use "HTTP GET" with the URL and parameters, so I prefer the later because it's simple thing.  I know I can use indy idhttp.get, to do the job, but this is very simple thing and I don't want to add complex indy code to my application.  UPDATE: sorry if I was not clear, I meant by "not to add complex indy code", that I don't want add indy components for just this simple task, and prefer more lighter way for that. If $0 &lt; \alpha &lt; 1$, then       $$ (x + y)^{\alpha} &lt; x^{\alpha} + y^{\alpha} $$      for $x$, $y$ positive.   Is this inequality true in general?  I tried using Young's Inequality: For $z,t &gt; 0$, and for $n$, $m$ such that $n+m=1$, then   $$ z^n + t^m \leq nz + mt $$  So, using this we have   $$ (x+y)^{\alpha} \cdot 1^{1 - \alpha} \leq \alpha(x+y) + (1-\alpha) = \alpha x + \alpha y + (1-\alpha)$$  which is not as tight as I want. Find the area of largest rectangle that can be inscribed in an ellipse The actual problem reads:      Find the area of the largest rectangle that can be inscribed in the ellipse    $$\frac{x^2}{a^2} + \frac{y^2}{b^2} = 1.$$   I got as far as coming up with the equation for the area to be $A=4xy$ but then when trying to find the derivative I don't think I'm doing it right. I play several games on Steam and I love the achievement system. It would be great to get an overview of all the achievements ever gained in Steam games. Does Steam support this? I haven't found such an overview.  If such a feature does not exist, I would already be happy with an easy way to calculate the sum of all my achievements automatically.  Edit: I stumbled upon an interesting website called  today. Unfortunately it only works for XBox-Achievements. Does anyone know of a similar service for Steam? This would solve my question right away. Implementing my own solution based on the links posted in the answers didn't work because the APIs are not sufficient for my needs. How check with SOQL if a picklist value is available or not for a specified record type How check if a picklist value is available or not for a specified record type ( through SOQL)? Thanks in advance There are several ideas on hard determinism, but the core seems to be that in an interconnected existence, there can be no "actions" (free will), but only "reactions" (determinism). An action of free will would have to be a separate entity outside of existence, so we'd say it can't occur.   Now fast forward to Joe Schmo the robbing/murdering/rapist.  Joe wasn't born in some infinite bliss utopia, then decided one day to invent the concept of scumbaggery.  He's a product of an incomprehensible number of variables - maybe some are apparent like his dad was a violent alcoholic or whatever, but most likely it's far more complicated than that.    So that's fine - I get all that - but if that's the case, then how can you ethically deal with people like that?  You can't hardly let them do what they please at the expense of society, but then how can you get medieval on them when they're basically riding a wave?  I think that's a big reason why people fight concepts of determinism that mitigate or eradicate the concept of free will - now everyone has a license to do what they want and how can you punish them, it's not their fault!  How would/could/should you consolidate hard determinism with responding to criminal acts? Is this sentence grammatically correct?  Anyone who loves the English language should have a copy of this book in their bookcase.  or should it be:  Anyone who loves the English language should have a copy of this book in his or her bookcase. This is really two questions.   Is there a definition of the principal $n$th root of a complex number? I can't find it anywhere. Presumably, the usual definition is $[r\exp(i\theta)]^{1/n} = r^{1/n}\exp(i\theta/n)$ for $\theta \in [0,2\pi)$, but I have yet to see this anywhere. Is this because it has bad properties? For instance, according to this definition is it true that for all complex $z$ it holds that $(z^{1/a})^b = (z^b)^{1/a}$? If ${n \choose 3} + {n+3-1 \choose 3} = (n)_3$, compute $n$.  Just making sure I am on the right track...  Do I expand each piece out and solve algebraically? How to prove that $E[Y]=E[E[E[Y|X_1, X_2]]]$ ?  PS. I don't see how $E[E(Y|X_{1},X_{2})|X_{1}]=Y[Y|X_{1}]$ and $E[Y]=E[E(Y|X_{1})]$ can be used here. But it feels close. Please help, I'm stuck PPS. Thanks @Deep North. Let's consider the case when X1 is independent of X2 How to remove `t=canonical` from Firefox browser searches made on DuckDuckGo? In Ubuntu 14.04, when I do a search in Firefox using either the address bar or the search bar, the system always adds t=canonical to my searches. So the full string becomes: https://duckduckgo.com/?q=cat+cooking+salmon&amp;t=canonical.  However, if I perform the same search by going directly to the search engine, i.e. typing the search engine name and doing the search from the presented search box, this does not happen. In this case the string is: https://duckduckgo.com/?q=cat+cooking+salmon.    How do I stop Ubuntu/Firefox from adding t=canonical to my search queries? And, why is this behavior there in the first place? The refraction through hot air around a candle flame Why the intensity of light is more around the region of hot air around the flame of candle in the shadow cast by the light from the collimated source ?    Most of the articles mention it is due to the refraction of light through hot air around the candle's flame. But I'm unable to understand how refraction make this happen. Series with denominator that is square of product of consecutive numbers Evaluate $\sum_{k=1}^{\infty} \frac{1}{k^2(k+1)^2}$.   I've tried to use a telescoping approach, but it doesn't seem to work. It doesn't also seem to converge to a "pretty" value as well. What is the name of this kind of character illustration? This is a very simple question but I believe it's nontrivial.  I would like to know if the following is true:      If $R$ and $S$ are rings and $R[x]$ and $S[x]$ are isomorphic as rings, then $R$ and $S$ are isomorphic.    Thanks!  If there isn't a proof (or disproof) of the general result, I would be interested to know if there are particular cases when this claim is true. Creating Network Flow Diagram using QGIS I have a Telecom cable network in Geopackage format. How do I create a Network flow diagram from which to represent the relationship between Fiber distribution hub to Network access point? Finite abelian group contains an element with order equal to the lcm of the orders of its elements I will quote a question from my textbook, to prevent misinterpretation:     Let $G$ be a finite abelian group and let $m$ be the least common multiple of the orders of its elements. Prove that $G$ contains an element of order $m$.   I figured that, if $|G|=n$, then I should interpret the part with the least common multiple as $lcm(|x_1|,\dots,|x_n|)=m$, where $x_i\in G$ for $0\leq i\leq n$, thus, for all such $x_i$, $\exists a_i\in\mathbb{N}$ such that $m=|x_i|a_i$. I guess I should use the fact that $|x_i|$ divides $|G|$, so $\exists k\in \mathbb{N}$ such that $|G|=k|x_i|$ for all $x_i\in G$. I'm not really sure how to go from here, in particular how I should use the fact that $G$ is abelian. Hint proving this $\sum_{k=0}^{n}\binom{2n}{k}k=n2^{2n-1}$ I need hint proving this $$\sum_{k=0}^{n}\binom{2n}{k}k=n2^{2n-1}$$ So i was solving exercises in propositional logic lately and stumbled upon a puzzle, that goes like this:     Each inhabitant of a remote village always tells the truth or always lies. A villager will only give a "Yes" or a "No" response to a question a tourist asks. Suppose you are a tourist visiting this area and come to a fork in the road.    One branch leads to the ruins you want to visit; the other branch leads deep into the jungle. A villager is standing at the fork in the road. What one question can you ask the villager to determine which branch to take?    I intuitively guessed the answer is "If I asked you this path leads to the ruins, would you say yes?". So my questions are:   What is the name and/or source of this logical riddle? How can i corroborate my answer with mathematical rigor? I have just started special theory of relativity. The limiting speed known as speed of light fascinated me most. I asked my teacher:      Consider two massless objects moving in the same direction at the speed of light. What would be their relative velocity w.r.t each other?   My teacher tells me that their relative velocity would be zero. But then the speed of light is universal constant regardless of the motion of its frame of reference, so shouldn't their relative velocity be $c$? What is their relative velocity and how? Do objects moving at the speed of light obey law of addition of velocities?