Let $f$ be an entire function on $\Bbb{C}$ such that $|f(z)|\le 100 \ln |z|$ for $|z|\ge 2$ and if $f(i)=2i$, then what is $f(1)$?   I think $f$ will be constant i.e. $f(1)=2i$, but I'm unable to use liouville's theorem or any theorem which proves $f$ is constant.
Let $f$ be an entire function with $|f(z)|\le 100\log|z|,\forall |z|\ge 2,f(i)=2i, \text{ Then} f(1)=?$  I have no idea how to solve this one!  $g(z)={f(z)\over \log|z|}$ Then Can I say $g$ is constant by Liouville Theorem?
Brace expansion not working in a script Accessing my Windows 7 files from my Ubuntu account I have just installed Ubuntu on my computer and I have windows 7 as my other operating system. is there a way that I can access my windows 7 files from my Ubuntu installation? Area of a weird ellipse shape. A propeller has the shape shown below. The boundary of the internal hole is given by $r = a + b\cos(4α)$ where $a &gt; b &gt;0$. The external boundary of the propeller is given by $r = c + d\cos(3α)$ where $c - d &gt; a + b$ and $d &gt; 0$.  Calculate the total area of the propeller as shown by the shaded region and calculate the average temperature of the propeller, given by $T (r, α) = C/r$, where $C$ is a constant.     Have absolutely no idea how to solve this. real memory usage Wrong ordering in generated table in jpa Does every Abelian group admit a ring structure? Can I update an Mac App purchased by a different Apple ID? When I entered the -al attribute with the  command, I got the following:  anupam@JAZZ:~/blog$ ls -al total 76 drwxrwxr-x 13 anupam anupam 4096 Aug 28 21:45 . drwxr-xr-x 34 anupam anupam 4096 Aug 28 20:52 .. drwxrwxr-x  8 anupam anupam 4096 Aug 28 12:19 app drwxr-xr-x  2 anupam anupam 4096 Aug 28 12:19 bin drwxrwxr-x  5 anupam anupam 4096 Aug 28 12:19 config -rw-rw-r--  1 anupam anupam  154 Aug 28 12:19 config.ru drwxrwxr-x  3 anupam anupam 4096 Aug 28 12:37 db -rw-rw-r--  1 anupam anupam 1339 Aug 28 12:19 Gemfile -rw-rw-r--  1 anupam anupam 2871 Aug 28 12:19 Gemfile.lock drwxrwxr-x  7 anupam anupam 4096 Aug 28 21:45 .git -rw-rw-r--  1 anupam anupam  466 Aug 28 12:19 .gitignore drwxrwxr-x  4 anupam anupam 4096 Aug 28 12:19 lib drwxrwxr-x  2 anupam anupam 4096 Aug 28 12:29 log drwxrwxr-x  2 anupam anupam 4096 Aug 28 12:19 public -rw-rw-r--  1 anupam anupam  249 Aug 28 12:19 Rakefile -rw-rw-r--  1 anupam anupam  478 Aug 28 12:19 README.rdoc drwxrwxr-x  8 anupam anupam 4096 Aug 28 12:19 test drwxrwxr-x  6 anupam anupam 4096 Aug 28 12:33 tmp drwxrwxr-x  3 anupam anupam 4096 Aug 28 12:19 vendor   What does each column mean, and what does the total 76 signify here? Java; String replace (using regular expressions)? As part of a project for school, I need to replace a string from the form:  5 * x^3 - 6 * x^1 + 1   to something like:  5x&lt;sup&gt;3&lt;/sup&gt; - 6x&lt;sup&gt;1&lt;/sup&gt; + 1   I believe this can be done with regular expressions, but I don't know how to do it yet.  Can you lend me a hand?   P.S. The actual assignment is to implement a Polynomial Processing Java application, and I'm using this to pass polynomial.toString() from the model to the view, and I want do display it using html tags in a pretty way. Join lines from two files What's the best way to generate a tag cloud from an array using h1 through h6 for sizing? Lat/Long co-ordinates are not plotting onto EPSG:3857 OSM basemap correctly Excuse me if this is a stupid question, but I've honestly tried to find the answer in a few threads here on SE, and I cannot seem to follow the suggested steps correctly.    Project is in  (WGS 84 / Pseudo-Mercator) BaseMap (OpenStreetMap) layer is set to EPSG:3857 Vector data has been imported from CSV, and has Lat/Long coordinates, set to EPSG:3857.    The layer appears right in the middle of the map, around 0,0 obviously.   Why is this, what am I doing wrong? How to sum a variable by group I am trying to (partially) reproduce the algorithm displayed in Figure 4 from   My problem is with the multi-line conditions present in the "IFs". I want them to be indented, but \Indp does not seem to take effect if a new line \\ is not present in the same line.  This is what I tried:  \begin{algorithm}[htb]     \SetAlgoNoLine%     \SetNoFillComment     \SetKwIF{If}{ElseIf}{Else}{if}{:}{elif}{else:}{}%      \If{(SYNs from both hosts and \\             \Indp SYNs in earliest NFs of both hosts and \\             \Indp hosts' earliest packets differ)}{         Host with earliest NF is originator      }     \If{(SYN only from one host and \\         \Indp SYN is in connection's earliest NF)}{     Host is originator     }     \If{one host uses port 20 (ftp-data)}{     Host is originator     }     \If{only one host uses a well-known port}{     Host is responder     }     \If{start of hosts' first packets differ}{     Host with earliest NF is originator     }     Arbitrarily choose originator     \caption{Pseudo code for determining connection server side}     \label{algo:serverside2} \end{algorithm}   For instance, the line "SYNs in earliest NFs of both hosts and" is indented correctly, but "hosts' earliest packets differ" is not. Living potato clock? Solve $x^2+5x+6 \equiv 0 \pmod{\!11\cdot 17}$ Solve $x^2+5x+6 \equiv 187 \mod 187$ Solution $$x^2+5x+6 \equiv 187 \mod 187$$ $$ (x+\frac{5}{2})^2 \equiv \frac{1}{4}$$ $$ 4(x+\frac{5}{2})^2 \equiv 1$$ $$ y:= x+\frac{5}{2} $$ $$ 4y^2 \equiv 1 \mod 11 \wedge 4y^2 \equiv 1 \mod 17  $$ $$ ( 2y \equiv 1 \mod 11 \vee 2y \equiv 10 \mod 11 ) \wedge ( 2y \equiv 1 \mod 17  \vee 2y \equiv 13 \mod 17)  $$ $$ ( y \equiv 6 \mod 11 \vee y \equiv 5 \mod 11 ) \wedge ( y \equiv 9 \mod 17  \vee y \equiv 15 \mod 17)  $$ Combining that from CRT I got: $$ y \in \left\{49, 60,83,94 \right\} $$ and for example: $$ x+\frac{5}{2}  \equiv 94 \mod 187$$ $$ 2x  \equiv 183 \mod 187$$ some calculus and get... $$x \equiv 185 $$ And the same thing for each other case. Question Is there any faster (or smarter) way to solve equations like that? Explanation of finite correction factor Are there strange attractors whose coordinates are "almost integers"? How to get week number in Python? Let $x_1 = 2$, and define $$x_{n+1} = \frac{1}{2} \left(x_n + \frac{2}{x_n}\right).$$ Show that $x_n^2$ is always greater than or equal to $2$, and then use this to prove that $x_n − x_{n+1} ≥ 0$. Conclude that $\lim x_n = \sqrt2$.   My question:  So I know how to do this problem but I don't know how to prove that $x_n &gt;0$ for all $n\in \mathbb{N}$.