What tablet android devices are even supported? I have a Pantech Element (P4100)
With the announcement of the Ubuntu Phone OS I'd like to know what phone (and tablet) models are supported at this time.  Note from foss &amp; Oli: We are making this the master question for all future "Will this work on &lt;insert random tablet/phone/device here&gt;?!" questions
Clerical mistake in UK visa application: should I make a pen-and-ink correction or electronically edit the PDF? I've gone through all similar questions but I believe my specific question doesn't have an answer yet.  I've applied for a Standard Visitor visa. After I completed the application, made an appointment and paid the fee, I noticed that the way I spelled my name on the application differs from how it is spelled in the passport by 1 letter (this is partially because of myself being an idiot, but mainly because my new passport has an incorrect transliteration of my name, whereas my old passport and any other document in my life has the correct one).  So here are the options I see:   Print the application and make a pen-and-ink correction with a black ballpoint pen by crossing the printed name/letter and writing the correct one - as answers to other similar questions suggests. Edit the PDF electronically and print it so that there are no visible corrections. However, as the form is saved at their end, there will be a discrepance between the printed form and saved form with no visible signs of correction.   Which way has better chance for me to have my application accepted?  Also (probably doesn't matter much but still): if it's the pen-and-ink correction, is it better to cross-out the whole name or only the wrong letter? How does order-preserving encryption work? Order-preserving encryption (OPE) is, apparently, a method of encrypting data so that it's possible to make efficient inequality comparisons on the encrypted items without decrypting them.  I've been coming across this term in various places (including ) lately, but I have no idea how such encryption schemes are supposed to work.  Any obvious methods I can think of to allow such comparisons on encrypted data would result in catastrophic security failure.  Certainly, I assume that OPE must involve some kind of security tradeoff compared to traditional encryption, but given that it seems to be actively  and , it seems that it must be possible to implement in a way that retains at least some level of useful security.  I just don't see how.  Given that  didn't turn up any convenient Wikipedia articles or other popular summaries of OPE, I figured I'd try asking for one here before diving into the academic literature.  (At worst, I may try to answer my own question later, if nobody else beats me to it.)  So, to summarize, my question is: How does order-preserving encryption work, and what security properties does it provide? How will learning about philosophy impact real-life? Examining the practical, impactful, real-life benefits of getting a degree in philosophy It is often asked, &quot;What is the practical use of philosophy?&quot; or &quot;How will learning about philosophy impact real-life?&quot; It is easy to see why there is such mystery surrounding the topic. Most schools up through high school may only offer 1 or 2 courses on it, if any. It is also often talked about in general conversation as a &quot;wishy-washy&quot; subject, often negatively, as though it contains no answers but only raises an endless series of questions. To add to this, those who hear of the subject but know very little of it may be surprised to see it offered at their university as a major. It is clear to most why some people would want to major in Computer science, Mathematics, or Physics. But what would a degree in philosophy get you? Proving $\sum_{k=1}^n{k^2}=\frac{n(n+1)(2n+1)}{6}$ without induction I was looking at: $$\sum_{k=1}^n{k^2}=\frac{n(n+1)(2n+1)}{6}$$  It's pretty easy proving the above using induction, but I was wondering what is the actual way of getting this equation? Functions that are their Own nth Derivatives for Real $n$ $a,b,c$ are real numbers $>0$. If $a+b+c=1$, show that $(a+\frac{1}{a})^2+(b+\frac{1}{b})^2+(c+\frac{1}{c})^2\ge\frac{100}{3}$ What are Vertex and Pixel shaders? CPU Emulation and locking to a specific clock speed If you had read my other , you'll know I've spent this weekend putting together a 6502 CPU emulator as a programming exercise.  The CPU emulator is mostly complete, and seems to be fairly accurate from my limited testing, however it is running incredibly fast, and I want to throttle it down to the actual clock speed of the machine.  My current test loop is this:      // Just loop infinitely.     while (1 == 1)     {                         CPU.ClockCyclesBeforeNext--;          if (CPU.ClockCyclesBeforeNext &lt;= 0)         {             // Find out how many clock cycles this instruction will take             CPU.ClockCyclesBeforeNext = CPU.OpcodeMapper.Map[CPU.Memory[CPU.PC]].CpuCycles;              // Run the instruction             CPU.ExecuteInstruction(CPU.Memory[CPU.PC]);              // Debugging Info             CPU.DumpDebug();             Console.WriteLine(CPU.OpcodeMapper.Map[CPU.Memory[CPU.PC]].ArgumentLength);              // Move to next instruction             CPU.PC += 1 + CPU.OpcodeMapper.Map[CPU.Memory[CPU.PC]].ArgumentLength;                                                 }     }   As you can tell, each opcode takes a specific amount of time to complete, so I do not run the next instruction until I count down the CPU Cycle clock. This provides proper timing between opcodes, its just that the entire thing runs way to fast.  The targeted CPU speed is 1.79mhz, however I'd like whatever solution to the clock issue to keep the speed at 1.79mhz even as I add complexity, so I don't have to adjust it up.  Any ideas? insert code keywords inline What is the command to insert inline code words into the text like this?   I know there are packages for inserting snippets into the code, but I need to insert keywords within the main text. I was wondering if there is a more convenient way to do that. Are there sets $A$ and $B$ such that $A \in B$ and $B \in A$? I think that the question is clear from the title:     Are there sets $A$ and $B$ such that $A \in B$ and $B \in A$?   My feeling is that the definition of any two such sets will be circular (we can't define $B$ till we define $A$ and we can't define $A$ till we define $B$), and hence will be excluded by some axiom.  On the other hand, I can't see an inherent contradiction, though I wouldn't be surprised if some form of Russell's paradox pops up, pushed behind one more set of braces. Why does Microsoft Word 2010 show an error for the following sentence?     1.&nbsp;Where should this car be parked?   Word 2010 also suggests changing the sentence to     2.&nbsp;Where this car should be parked?   Is the sentence (1) wrong? If yes, why? What about sentence (2)? $|p(z)| \leq M$ for $|z| \leq 1$ Show that $|p(z)| \leq M|z|^n$ for $|z| \geq 1$ Let $p(z)= \sum_{k=0}^n a_k z^k$ ,  $a_n \neq 0$ , be a polynomial of degree $n$ such that $|p(z)| \leq M$ for $|z| \leq 1$.  Show that $|p(z)| \leq M|z|^n$ for $|z| \geq 1$  This was an exam question. Part (a) of this question asked the converse: if $|p(z)| \leq M|z|^n$ and $|z|$ is sufficiently large, then $p(z)$ is a polynomial. This question came straight out of Ahlfors' Complex Analysis, which I solved by showing, using the Cauchy Estimate,  $|p^n (z)|  \leq \frac{n!M|z|^k}{R^n} = 0$ as $R \to \infty$.   I would like to work backwards with this.   May I do this, or similar:   $p(z) = \frac{1}{2\pi i} \int_{c} \frac{f(\zeta)d\zeta}{\zeta-z}$  $\Rightarrow  |p(z)| \leq \frac{2\pi M|z|^n}{1(2\pi)}= M|z|^n$ In version 5.2 of Apple's Pages app for OS X (Mavericks), how do I change the page layout? Why are .goutputstream-xxxxx files created in home folder? I find a lot of files with names of the like  .goutputstream-xxxxx   where xxxxx are some alphanumeric characters.  Here is a screenshot of the home folder    Any idea why I should keep these or can I remove and also stop further creation? How to print only last column? echo -e 'one two three\nfour five six\nseven eight nine' one two three four five six seven eight nine   how can I do some "MAGIC" do get this output?:  three six nine   UPDATE: I don't need it in this specific way, I need a general solution so that no matter how many columns are in a row, e.g.: awk always displays the last column. How are "needs to be washed," "needs washing," and the regional variant "needs washed" to be distinguished"? Can I use my powers for good? Chance of objects going against greater entropy? My book uses the argument that the multiplicities of a few macrostates in a macroscopic object take up an extraordinarily large share of all possible microstates, such that even over the entire lifetime of the universe, if each microstate had an equal chance of being accessed, fluctuations away from equilibrium would never occur.  My question to this statistical proof is this: In the real world, is there really an infinitesimal but nonzero chance that macroscopic systems could access some of the more unlikely macrostates (e.g. heat transfer from a cold object to a hot object)? 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? If $Var(X)=0$ then is $X$ a constant? We know that the variance of a constant is $0$. Is the converse also true? Can we say that if the variance of some random variable is $0$ it is a constant?