Let $f$ be an entire function. And assume $f(z)$ is real on $Im(z)=0$ and $Im(z)=\pi$ lines. Show $f$ is $2\pi i$ periodic. No clue how to start this problem. I was thinking of maybe equating it to some iteration of $e^z$ but that got me nowhere.
Show that if $f(z)$ is an entire function such that it takes real values on the lines $Im(z)=0$ and $Im(z)=a$ (for some $a \in \mathbb{R}_{\neq 0})$, then $f$ is periodic with period $2 i a$.    So here is my thought process: First of all by reflection principle $f(\bar{z})=\overline{f(z)}$ so if our function $f$ is given in the strip $0 \leq Im(z) \leq a$, then its values on $-a \leq Im(z) \leq a$ follow by reflection principle. Then by imposing $f(z)=f(z+2 ia)$ we can intuitively see that this will define an entire function by looking at how the strips $na \leq Im(z) \leq 2na$ seamlessly stack on top of each other. Is this logical? And how would one prove this analytically?
Make terminal use pageup/pagedown instead of shift-pageup/shift-pagedown? I've grown quite weary of shift-pgup to page up in gnome terminal, the command line, terminator, and guake, etc.  Any way to easily make these apps use the straight page-up and page-down keys for paging around? How to stop fluid inflow? I have fluid simulation with an inflow object. I want the inflow to go for 2 seconds, then have the inflow stop (so no more fluid is added) but keep the simulation going  (so the existing fluid sloshes around).  However, I do not see any way to set start and ending values on my inflow object.  How do I stop inflow at a certain frame/time in my simulation? We all know some curves can be described by $y=f(x)$ and some surfaces can be described by $z=f(x,y)$ However, there exists curves and surfaces which cannot be described by those, such as a circle and a sphere. Therefore, we introduce parameterized vector equations, which can describe them. For example, circle: $\vec r(t)=r\cos(t)\hat i+r\sin(t)\hat j$ sphere: $\vec r(u,v)=\rho\cos(u)\sin(v)\hat i+\rho\sin(u)\sin(v)\hat j+\rho\cos(v)\hat k$ However, all curves described by $y=f(x)$ and  $z=f(x,y)$ can be parameterized. For curves, $$\vec r(t)=t\hat i+f(t)\hat j$$ For surfaces, $$\vec r(u,v)=u\hat i+v\hat j+f(u,v)\hat k$$ Therefore, I think this suggests the set of all parameterized surfaces (or curves) is the super-set of the set of all surfaces (or curves) described by $z=f(x,y)$ (or $y=f(x)$). Is that correct? Now, here comes the the real challenge. A curve can also be described by an implicit function $f(x,y)=0$ and a surface can also be described by an implicit function $f(x,y,z)=0$ I have 3 questions regarding this.   Can all surfaces (curves) described by an implicit function be parameterized? (If yes, then what is the general way?) Can all surfaces (curves) described by parametric vector equations be represented using implicit function? (If yes, then what is the general way?) Compare the set of all parameterized surfaces (curves) and the set of all surfaces (curves) represented by implicit function. (which is which super-set?)   Sorry for the use of nontechnical terms. I use them because I don't know the technical ones. I have only started learning vector calculus last year in university.  EDIT: I think my question is not too clear, so I will give an example of writing the surface $f(x,y,z)=0$ into $\vec r(u,v)$ We want to parameterize a sphere. $$x^2+y^2+z^2-\rho^2=0$$ Let $x=\rho\cos(u)\sin(v)$, $y=\rho\sin(u)\sin(v)$, $z=\rho\cos(v)$, $$\rho^2\cos^2(u)\sin^2(v)+\rho^2\sin^2(u)\sin^2(v)+\rho^2\cos^2(v)-\rho^2$$ $$=\rho^2\sin^2(v)(\cos^2(u)+\sin^2(u))+\rho^2\cos^2(v)-\rho^2=\rho^2-\rho^2=0$$ I want to know if there is a general way of finding $x=x(u,v)$, $y=y(u,v)$ and $z=z(u,v)$ for any given $f(x,y,z)=0$ when calling SCP in PuTTY on my Win7 box, it doesn't let me use C:/, but I also have no idea where on my local machine it will look for files by default. None of program directory or user directory worked. For example, I saved file.txt next to PuTTY.exe, and also in C:\Users\Me but calling SCP file.txt file.txt in PuTTY failed both times with      cp: cannot stat 'file.txt'   So, how do I transfer a file to my server using PuTTY?  EDIT: Also, calling SCP file.txt myserver:file.txt gives a similar error: file.txt: No such file or directory What would be the quickest way to construct a Python binding to a C or C++ library?  (I am using Windows if this matters.) I'm looking for a story that was probably written somewhere from the 1940s to the 1960s. I think I read it in an anthology, possibly in the 1970s.  A group of human explorers landed on a planet with primitive aliens, living in hunter-gatherer villages. They hoped to make a profit from trading our goods for—well, I'm not clear on what they wanted from the aliens.  The native people learned the human language before the explorers could learn theirs. Then the natives suddenly started producing technological innovations far beyond what they originally used. I remember that wooden sailing ships suddenly replaced their canoes. All the natives had to do was hear a story once from the explorers before copying the technology in the story.  Finally, the explorers realized that the natives were much, much smarter than us and that Earth faced a serious problem.  I'm fairly certain that it wasn't a Heinlein story, but I remember that it had some qualities similar to his work. Let $f:\mathbb{C} \rightarrow \mathbb{C}$ be a entire function. Suppose that there are $M$, $r&gt;0$ and $n\in \mathbb{N}$ such that $\left|f(z)\right|&lt;M\left|z\right|^n$ for all $z \in \mathbb{C}$ with $\left|z\right|\geq r$.  Show that $f$  polynomial of degree at most $n$.  Remark: I tried to follow the proof of Liuville's Theorem but I have complications with the condition  $\left|z\right|\geq r$.. Why is conservation of angular momentum considered a law? We know that angular momentum is defined as the cross product of position and linear momentum. By taking the time derivative, we can deduce that the time rate of change of the angular momentum equals the net torque.  Then why is the conservation of angular momentum considered a law, when we can easily show it is conserved when no net torque is applied, by using Newton's laws?  It truly confuses me. Recently I had a bunch of my own scripts for the thumbnails in Nautilus: , , office documents and so on.  Seems like either I’m doing something wrong (thumbnail generation behavior changed), or custom thumbnailes don’t work in latest GNOME at all, even my previous scripts, which worked smoothly on previous versions of Ubuntu.  I’ve done some research, tried to run a simple script (see below) and it didn’t work out.  My test thumbnailer in /usr/share/thumbnailers/z.thumbnailer:  [Thumbnailer Entry] Exec=/home/maximal/thumb.sh %s %i %u %o MimeType=image/webp;image/x-webp   Where /home/maximal/thumb.sh is:  #!/bin/bash echo $0 &gt;&gt; /home/maximal/thumb.log echo $1 &gt;&gt; /home/maximal/thumb.log echo $2 &gt;&gt; /home/maximal/thumb.log echo $3 &gt;&gt; /home/maximal/thumb.log echo $4 &gt;&gt; /home/maximal/thumb.log   Then, when I remove thumbnail cache rm -rf ~/.cache/thumbnails and restart Nautilus nautilus -q, my log file doesn’t contain anything and ~/.cache/thumbnails/fail/gnome-thumbnail-factory contains all the failed thumbs (looks like corrupted/empty PNGs):    So, apparently, Nautilus even didn’t try to execute my thumbnailer script. When I try to run thumb command itself, it works perfectly. For example convert through cwebp|dwebp package:  convert -thumbnail 256x256 file.webp png:file.webp.png   When I wrap this command to a thumbnailer, it looks like it wasn’t even requested to run by Nautilus.  [Thumbnailer Entry] Exec=convert -thumbnail %sx%s %i png:%o MimeType=image/webp;image/x-webp;   Exactly the same situation occurs with other my thumbnailers: audio waveforms, office documents, photoshop files and so on.  Could anyone help? Computing the Galois group of polynomials $x^n-a \in \mathbb{Q}[x]$ I have some problems with this exercise. I don't know if it can be done. Consider the polynomial $ x^n - a \in \mathbb{Q} $ Can I compute the Galois group of this over $\mathbb{Q}$? Maybe having a nice "basis.  The splitting field is given by $\mathbb{Q}(\zeta_n,\alpha)$ , where $\zeta_n$ is a primitive root of unity , and $\alpha$ is some number such that $\alpha^n = a $. Well first of all, I want a $\underline{"good basis"}$ for the splitting field. In the sense that the minimal polynomials, of the adjoined elements, are different (in this case the computation of the galois group is very simple).  For example one easy case, it's when $a&gt;0$, then $(a)^{\frac{1}{n}} \in \mathbb{R}$ , so clearly the minimal polynomial of $(a)^{\frac{1}{n}} , \zeta_n$ are distincs, and I'm done. If $n$ is odd then , it's also easy, since one root it's also real, for example $x^3-3 $, the real root is $ \root 3 \of { - 3}  =  - \root 3 \of 3  $ , so I can consider the splitting field as $\mathbb{Q}(-\root 3 \of 3 , \zeta_3 )=\mathbb{Q}(\root 3 \of 3 , \zeta_3 )$. The difficult case is when $n$ is even and $a&lt;0$ , for example  $x^8+20$ or $x^4+20$ in some cases as in the second, there are particular cases since there exist algorithms for the Galois group of quartics, but in general. It can be done?  $\underline{Remark}$ I'm searching a $\underline{"good basis"}$ for the splitting field. In the sense that the minimal polynomials, of the adjoined elements, are different since in this case the computation of the galois group is very simple. Injection from $\mathbb{N}\to\{0,1\}$ to the set of all monotonic decreasing functions from $\mathbb{N}\to\mathbb{Z}$ How do I find my follower if and when they leave me? I had parked my follower at an inn with a bunch of valuable items that I didn't want to carry. I guess I have been out a bit too long as this message appears:      Your follower tires of waiting and leaves.    There have been other situations where my follower has mysteriously disappeared as well.  How can I find my follower when they get up and leave or disappear into thin air? What are the rules for splitting words at the end of a line? What are the rules in English language to split words at the end of a line?   Where exactly must the hyphen split the word? The isomorphism $\mathbb{Z}[i]/(a+bi) \cong \Bbb Z/(a^2+b^2)\Bbb Z$ is , when the integers $a$ and $b$ are coprime. But what happens when they are not coprime, say $(a,b)=d&gt;1$?      — For instance if $p$ is prime (which is not coprime with $0$) then $$\mathbb{Z}[i]/(p) \cong \mathbb{F}_p[X]/(X^2+1) \cong \begin{cases} \mathbb{F}_{p^2} &amp;\text{if } p \equiv 3 \pmod 4\\ \mathbb{F}_{p} \times \mathbb{F}_{p} &amp;\text{if } p \equiv 1 \pmod 4 \end{cases}$$ (because $-1$ is a square mod $p$ iff $(-1)^{(p-1)/2}=1$).  — More generally, if $n=p_1^{r_1} \cdots p_m^{r_m} \in \Bbb N$, then  each pair of integers $p_j^{r_j}$ are coprime, so that by CRT we get $$\mathbb{Z}[i]/(n) \cong \mathbb{Z}[i]/(p_1^{r_1}) \times \cdots \times \mathbb{Z}[i]/(p_m^{r_m})$$  I was not sure how to find the structure of $\mathbb{Z}[i]/(p^{r}) \cong (\Bbb Z/p^r \Bbb Z)[X] \,/\, (X^2+1)$ when $p$ is prime and $r&gt;1$.  — Even more generally, in order to determine the structure of $\mathbb{Z}[i]/(a+bi)$ with $a+bi=d(x+iy)$ and $(x,y)=1$, we could try to use the CRT, provided that $d$ is coprime with $x+iy$ in $\Bbb Z[i]$. But this is not always true: for $d=13$ and $x+iy=2+3i$, we can't find Gauss integers $u$ and $v$ such that $du + (x+iy)v=1$, because this would mean that $(2+3i)[(2-3i)u+v]=1$, i.e. $2+3i$ is a unit in $\Bbb Z[i]$ which is not because its norm is $13 \neq ±1$.  — I was not able to go further. I recall that my general question is to known what $\mathbb{Z}[i]/(a+bi)$ is isomorphic to, when $a$ and $b$ are integers which are not coprime (for instance $a=p^r,b=0$ or $d=(a,b) = a^2+b^2&gt;1$).  Thank you for your help! I am trying to really understand why the gradient of a function gives the direction of steepest ascent intuitively.  Assuming that the function is differentiable at the point in question, a) I had a look at a few resources online and also looked at this   , a popular question on this stackexchange site. The accepted answer basically says that we multiply the gradient with an arbitrary vector and then say that the product is maximum when the vector points in the same direction as the gradient? This to me really does not answer the question, but it has 31 upvotes so can someone please point out what I am obviously missing?  b) Does the gradient of a function tell us a way to reach the maxima or minima? if yes, then how and which one - maxima or minima or both? Edit: I read the gradient descent algorithm and that answers this part of my question.  c) Since gradient is a feature of the function at some particular point - am I right in assuming that it can only point to the local maxima or minima? How can you sync Blender configs between multiple machines? Say I have a metric space $(X, d)$ and a set $A\in X$.  I want to prove that if $a \in \overline{A}$ then there is a convergent sequence $\{x_n\}$ that converges to $a$. Could I have any help? Neutron decay and electron anti neutrino $n\to p + e + \bar{\nu}_e$ Why do we need neutrino to explain neutron ? Is there any evidence regarding existence neutrinos in the context of $n\to p + e + \bar{\nu}_e$? Google Mobile Friendly test shows "other error" for resource loads I get the error "Couldn't load 23 page resources" when doing the mobile friendly test at     However, the error message is (the rather unfriendly) "Other error."  When I visit the site in Chrome using Developer Tools and setting the device toolbar to "Responsive," it works fine with no errors, and when I go the Google Search Console and do Crawl->Fetch As Google, I get no errors. ACPI error when trying to make dual boot with Ubuntu 18.04 and Windows 10