Does anyone know what the current status of this  is? I am very eager to try it out, but there does not seem to be any available download, nor information on which handsets/hardware to use.
I recently found out about Ubuntu for Android Multi-Core Smartphones and was digging around on the Ubuntu website as well as the Canonical website but have yet to find any information on if it available to the public yet ?  I am very interested to try it our on my Android and if it is available for the public am wondering where and how I can get a copy of "Ubuntu for Android" ?  If it is not available then perhaps someone can shed some lite on what sort of timeframe it will be until it is available to the general public?
How do I copy a file in Python?  I couldn't find anything under . For realism should I use the maximum number of Subsurf levels? I was wondering if I always need to use the maximum value of the options from the elements of "Add Modifier". For example, do I need to use the view 6 in Subdivision surface? I know it depends of what we are trying to achieve, but we all want the same. Make something look the most believable. So do you always use the maximum value Blender offers? Vieta Jumping: Related to IMO problem 6, 1988: If $ab + 1$ divides $a^2 + b^2$ then $ab + 1$ cannot be a perfect square. The famous IMO problem 6 states that if $a,b$ are positive integers, such that $ab + 1$ divides $a^2 + b^2$, then $\frac{ a^2 + b^2}{ab + 1 }$ is a perfect square, namely, $gcd(a,b)^2$.  How about a modification of this problem:    If $a,b$ are (strictly) positive integers, such that $ab + 1$ divides $a^2 + b^2$, then $ab + 1$ cannot be a perfect square.    I am looking for a proof of the claim above, or a counter-example.  One possible approach towards a proof is the following:   Suppose there is such a pair $(a,b)$ as above, then by the famous IMO problem 6 from 1988, $\frac{ a^2 + b^2}{ab + 1 } = g^2$ where $g = gcd(a,b)$. Since $ab + 1$ is a perfect square, $a^2 + b^2 = c^2$ for some integer $c$. So that $(a,b,c)$ is a Pythagorean tripple, therefore there exists positive integers $n,m,l$ with $n$ coprime to $m$, such that $a = l(n^2 - m^2)$ and $b = 2lnm$ - by Euclids formula.  Then by plugging in $a$ and $b$ in terms of $n,m,l$ into the original equation, and solving for $l$, it is possible to obtain the following:  There exists positive coprime integers $n,m$ such that   $\frac{(n^2 + m^2 + 1)(n^2 + m^2 - 1)}{2mn(n+m)(n-m)}$ is a perfect square.  If we put the quotient above into a program, as in this python code snipet:  N = 1000  for n in range(1,N):     for m in range(n+1, N):         A = (n*n + m*m + 1)*(n*n + m*m - 1)         B = 2*m*n*(n+m)*(m-n)         if A % B == 0:             print(A/B)   The quotient always is 2, regardless of whether or not $n$ and $m$ are co prime! So if the very strong implication   $2mn(n+m)(n-m) \mid (n^2 + m^2 + 1)(n^2 + m^2 - 1) \implies \frac{(n^2 + m^2 + 1)(n^2 + m^2 - 1)}{2mn(n+m)(n-m)} = 2$    holds, then the original problem will be solved. How to call gdal_translate from Python code? Is it possible to use some gdal API to call gdal_translate from Python code? I do not mean simply executing the gdal_translate.exe from the file system, but rather call it somehow in code so I do not need to know the exact directory the gdal_translate executable is in? What application launchers are available for Ubuntu? How to edit a file in vi editor (arrow keys prints letters)? I am open a file in vi:  vi index.php   Here the problem is: when I press the down arrow and it prints 'B'. Why it prints 'B'? "python" not recognized as a command Apply function conditionally What's the main difference between int.Parse() and Convert.ToInt32 What is the main difference between int.Parse() and Convert.ToInt32()? Which one is to be preferred Why is a vector space equal to its tangent space for any point? I'm self-studying Guillemin and Pollack, but I'm stuck on Problem 3 of section 2. It says that if $V$ is a vector subspace of $\mathbb{R}^N$, then $T_x(V)=V$ if $x\in V$.  If $x\in V$, then since $V$ is a manifold, there is a local parametrization $\phi: U\to V$ where $U$ is open in $\mathbb{R}^k$. Without loss of generality, we can require $\phi(0)=x$. Then $T_x(V)$ is defined to be the image of $d\phi_0$ on $\mathbb{R}^k$.   An arbitrary element of $T_x(V)$ looks like $$ d\phi_0(v)=\lim_{t\to 0}\frac{\phi(0+tv)-\phi(0)}{t}=\lim_{t\to 0}\frac{\phi(tv)-x}{t} $$  but this doesn't seem very useful to show $T_x(V)=V$. What is the right approach? FTP File Upload with HTTP Proxy Is there a way to upload a file to a FTP server when behind an HTTP proxy ?  It seems that uploading a file is not supported behind an HTTP Proxy using .Net Webclient. ().  If there is no workaround ? If not, do you know a good and free FTP library I can use ?  Edit: Unfortunately, I don't have any FTP proxy to connect to. A game called  is making rounds on social media. I am trying to determine the maximum score attainable for this game.  Let's assume WLOG that only 2s are returned (if 4s are possible the max score is doubled).  First, I'll relax some of the rules to create a game, $\mathcal{G}$, that can achieve a score at least as high as the original, 2048 game.  A run $R$  of $\mathcal{G}_n$ consists of a sequence of moves $m_1,\ldots,m_k$ which manipulate a multiset, $\mathcal{S}$ of maximum size n.  Each $m_i$ is either:   a put $p$, which inserts a 2 into $\mathcal{S}$, or a merge, $\alpha_i$, which replaces two $2^i$ elements from $\mathcal{S}$ with a single $2^{i+1}$ elt.   I allow sequential moves of the same type because 2048 allows multiple merges or no-merge turns.  The score of a position is the sum of $\mathcal{S}$.  What is the maximum score possible on a game of order n?  Note: The final position must have only unique values, else a merge and put would be possible in increase score.  I claim it is $\sum_{i=1}^{n} 2^i$, but couldn't come up with any good induction arguments.  It's pretty easy to prove that an element $2^k$ is producible in a game $\mathcal{G}_k$, but proving an upper bound for production got a bit hairy, and also doesn't cover the full space. Do images uploaded to imgur.com have any backup? Is redirecting homepage to a page with keyword it's targeting helps in SEO? Integral inequality with a strange condition Let $f$ be a continuously differentiable real valued function on $[0,1]$.  It is given that $\displaystyle \int_{\frac{1}{3}}^{\frac{2}{3}}f(x) dx=0$     Find the minimum value of $\dfrac{\int_{0}^{1} (f'(x))^2 dx}{\left( \int_{0}^{1} f(x) dx \right)^2}$   I tried to use Cauchy-Schwarz to show that  $$\frac{\int_{0}^{1} (f'(x))^2 dx}{\left( \int_0^1 f(x) dx \right)^2} \ge \frac{\left( \int_0^1 \bigl| f(x)f'(x) \bigr| dx \right)^2}{ \left( \int_0^1 f(x) dx \right)^2} \ge \frac{ f(1)^2 - f(0)^2}{2 \left( \int_0^1 f^2 (x) dx \right)^2}$$ But I can't proceed from here.  Also, I don't know how to use the condition  $\int_{1/3}^{2/3}f(x) dx=0$ $\text{Let }y=\sqrt{5+\sqrt{5-\sqrt{5+\sqrt{5-...}}}} $, what is the nearest value of $y^2 - y$? I found this question somewhere and have been unable to solve it. It is a modification of a very common algebra question.          $\text{Let }y=\sqrt{5+\sqrt{5-\sqrt{5+\sqrt{5-...}}}} $,  what is the     nearest value of $y^2 - y$?          $\textbf {(1) } 1 \qquad \textbf {(2) } \sqrt5 \qquad \textbf {(3) } 4 \qquad \textbf {(4) } 2\sqrt5$      I worked the problem and got $$y^2 - y = 5+ \sqrt{5-\sqrt{5+\sqrt{5-...}}} -\sqrt{5+\sqrt{5-\sqrt{5+\sqrt{5-...}}}} \\ = 5+ \sqrt{5-y} - y = 5-y + \sqrt{5-y}$$ What do I do next? LWJGL Eclipse Resource Deployment I'm still experimenting with some OpenGL in LWJGL, and as I get to know more and more about OpenGL, I start to do more complicated things like multi texturing, shadowmapping and more. Now, right now I'm using the src folder (src/res) for my resources, and use src/resourcename in my code. When I export it, this won't work on another location as the relative path is ofcourse incorrect. What would be the best way of deploying your game with all the resources in one file? Maybe put the files in the jar?  I would like to hear from a few people how they store and deploy their project with resources, thanks! How to change plot style or other options after it was created What does kill 0 do actually? In the man page, it says:  kill [ -s signal | -p ] [ -a ] [ -- ] pid ...  pid... Specify the list of processes that kill should signal.  Each pid can be one of five things:           0      All processes in the current process group are signaled   And I tried like this in bash:  $ man kill &amp; [1] 15247 $ [1]+  Stopped                 man kill $ kill 0 $ ps 15247 pts/41   00:00:00 man   Here 0 is used as pid. As I understood, kill 0 will kill all processes in the current process, which includes pid15247. However, it didn't do anything in this example. Does anyone have ideas about how to use it? On-screen keyboard popping up whenever I touch screen I'm in 17.10. Whenever I touch the screen, whether to change windows/apps, scroll within a browser, or press a button, the stupid little keyboard pops up in the bottom left corner.  I have never left Screen Keyboard enabled in Universal Access, but if I toggle it on, that's the same keyboard popping up in the bottom left corner.    In this screenshot, I'm simply touching the screen in a full-screen youtube video. You can see the menu pop up on the right, under the point where I'm touching.  I don't have a before pic, but it was similar look/color keyboard, but it was smaller, maybe half as wide, and only in the bottom left section of the screen, as opposed to stretching across the entire width. This change from little left-hand keyboard to full-width keyboard happened after following @pomsky 's advice below.    This is a . You can mark yourself affected by it to hopefully increase its received attention.