I have tiny plants that I would like to photograph.    As shown in the test photo, I'm able to focus on the plants in the foreground, but not the background.  Do cameras exist that can focus on multiple macro depths (both the foreground and the background)?  Apologies if this question is amateurish. I do not have a background in photography.
I own a Nikon D40X and just the kit lens and I'm considering buying either a macro lens or some extension tubes.  I don't necessarily want to do true 1:1 macro, just some close ups of bugs, fungi and flowers.
At the end of the game, how are medals awarded?   As a secondary, what is the relation between bronze silver and gold medals, and how much experience do they reward? Prove if $|z| < 1$ and $ |w| < 1$, then $|1-zw^*| \neq 0$ and $| {{z-w} \over {1-zw^*}}| < 1$ Prove if $|z| &lt; 1$ and  $ |w| &lt; 1$, then $|1-zw^*| \neq 0$ and $| {{z-w} \over {1-zw^*}}| &lt; 1$Given that $|1-zw^*|^2 - |z-w|^2 = (1-|z|^2)(1-|w|^2)$I think the first part can be proven by saying $|1-zw^*| = 0$ if and only if $zw^*$ = 1.  And given the conditions that cannot be true. However I don't know if this part is right. I've just answered .  After accepting the answer, the OP then changed his question to another problem - which I know I shouldn't have answered (I should have requested as new question) but I updated my answer anyway.  The OP has now edited his question to remove the essence of either the original or new problem, and instead has a statement saying that the problem has been fixed.  What is the correct thing to do here?  Roll the question back so it's in its original state? Roll it back to the "new problem" state? Leave it and let him continue to get downvoted and/or closed by people who didn't see the original question? How is double negation interpreted in English? In my native language, double negations "cancel out". I have been trying to learn English using movies and such things, but double negation confuses me. I see instances when double negation cancels out, and some when they do not.  For example, "I haven't got no money" is interpreted as "I have no money." "There wasn't anyone who didn't enjoy the party" is interpreted as "Everyone enjoyed the party."  Is this context dependent? If so, how does one decide which interpretation is correct? Can we search posts by number of comments? Why does an conditionally convergent infinite series, when deranged, have a different limit? $\sum u_n = 1-\frac{1}{2}+\frac{1}{3}-\frac{1}{4}+\dots$ conditionally converges to $\log 2$; and, when deranged to $\sum u'_n = 1-\frac{1}{2}-\frac{1}{4}+\frac{1}{3}-\frac{1}{6}-\frac{1}{8}+\dots,$ converges to $\frac{1}{2}\log 2$. Why does a deranged conditionally convergent series have a different limit? First Course in Math Anal, p.93, by Burkill, explains that the sums $s_n, t_n$ of the first n terms of the two series are different functions of $n$. This reasoning is incomplete, because different functions of $n$ can converge to the same limit; for example, let $r_n$ be the first $2n$ terms of $\sum u_n$, then $s_n$ and $r_n$ are different functions; besides, by differently defining terms, i.e. clustering pieces of a series, e.g. \begin{align*} 1-\tfrac{1}{2}-\tfrac{1}{4}+\tfrac{1}{3}-\tfrac{1}{6}-\tfrac{1}{8}+\dots = \left(1-\tfrac{1}{2}-\tfrac{1}{4}\right)+\left(\tfrac{1}{3}-\tfrac{1}{6}-\tfrac{1}{8}\right)+\dots \\ = \left(1-\tfrac{1}{2}-\tfrac{1}{4}+\tfrac{1}{3}-\tfrac{1}{6}-\tfrac{1}{8}\right)+\dots,\\ 1-1+1-1+\dots = (1-1)+(1-1)+\dots \\ =(1-1+1-1)+\dots,\\ 1+1+1+1+\dots = (1+1)+(1+1)+\dots \\ = (1+1+1+1)+\dots, \end{align*} one gets the sum of first n terms as different functions, but the series's limit remains. One could view a changed limit from the perspective of the changed number of terms, Denote 'countably many', the size of natural number, as $\lvert\mathbb{N}\rvert$, then $\lvert\mathbb{N}\rvert = \lvert k\mathbb{N}\rvert = \lvert\mathbb{N}\times\mathbb{N}\rvert$. Then two series with different numbers (e.g. $\lvert \mathbb{N}\rvert$, $\lvert k\mathbb{N}\rvert$) of terms– and so having different limits– paradoxically have same number of terms–and so are possibly formed by the same terms. The paradox could be the fundamental reason. Are there other explanations? Is the use here of 'countably many' is proper? "Most importantly" or "more importantly"? Which of the following two sentences is more correct?   "A picture says a thousand words, more importantly in a fraction of a second"    OR   "A picture says a thousand words, most importantly in a fraction of a second"   Nothing important, just my own quotes! Do also suggest, if I can put it in a better way to express what I want to. Similar matrices and field extensions What is the difference between POST and PUT in HTTP? According to , POST is used to create a resource:  The POST method is used to request that the origin server accept the entity enclosed in the request as a new subordinate of the resource identified by the Request-URI in the Request-Line.  According to , PUT is used to create or replace a resource:  The PUT method requests that the enclosed entity be stored under the supplied Request-URI. If the Request-URI refers to an already existing resource, the enclosed entity SHOULD be considered as a modified version of the one residing on the origin server. If the Request-URI does not point to an existing resource, and that URI is capable of being defined as a new resource by the requesting user agent, the origin server can create the resource with that URI.  So which HTTP method should be used to create a resource? Or should both be supported? How to capture text from the operating system in a practical and simple way? Sometimes we can't select the text to copy &amp; paste, such as dialog boxes.  Sometimes it's just not practical, such as 100 files inside a folder.  Is there any practical and simple way to capture those text from the system into a text file?  I'd wish to know both in OS X and Windows. Maybe it just can't be done today... Is FFmpeg missing from the official repositories in 14.04? polar decomposition of a square A when A is not full rank/invertible Theorem numbering How do the Hat Dash points work? Proving an infinite number of primes of the form 6n+1 The proofs given on other sites weren't that clear and used different methods that I have yet to learn.    Prove that there are an infinite number of primes of the form 6n+1.  The hint that was given was: Let p = p1, p2, ..., pk + 1, where p1 = 2, p2 = 3,...pk are the first k primes.  Show that p is prime.  (p1 means p sub 1, p2 means p sub 2, and pk is p sub k.  Wasn't sure how to write it on this.)    Can someone explain this hint on how they came about of p1 = 2, p2=3, etc, and prove this please?    Also, how would the proof change if the form changed?  ("Prove that there are infinite number of primes of the form....") Chirp Transform and Convolution I was reading about the discrete fourier transform from the CLR algorithms book and I came upon an exercise whose hint confuses me. The exercise reads as follows:  The chirp transform of a vector $a=(a_0,a_1,\ldots,a_n)$ is a vector $y=(y_0,y_1,\ldots,y_n)$, where $y_k=\sum_{j=0}^{n-1}a_j (z^{k})^j$ and $z$ is any complex number. The DFT is therefore a special case of the chirp transform, obtained by taking $z=\omega_n$. Prove that the chirp transform can be evaluated in time $O(n\lg n)$ for any complex number $z$. (Hint: use the equation $$y_k = z^{k^2/2}\sum_{j=0}^{n-1}(a_j z^{j^2/2})(z^{-(k-j)^2/2})$$ to view the chirp transform as a convolution.  My question is about what is a convolution. I am familiar with taking two vectors $a=(a_0,a_1,\ldots,a_n)$ and $b=(b_0,b_1,\ldots,b_n)$ and forming the convolution $c=(c_0,c_1,\ldots,c_n)$ where $c_k = \sum_{j=0}^k a_j b_{k-j}$. Here the index of $j$ runs from $0$ to $k$ unlike in the hint given above where the index runs from $0$ to $n-1$. In what sense is the hint above a convolution? Prevent Adobe Reader from switching to "Fit Page" zoom when bookmark is clicked Google spreadsheet sorting messes up cell comments I'm running into this weird problem with Google spreadsheets: if the cells have comments on them and I sort the spreadsheet, the rows sort but the comments stay in the same position, and don't move with the cells they're attached to.  In other words, the cells look like this:  A C  &lt;-- comment on this cell B   and then I sort by this column:  A B  &lt;-- comment remains on this cell (stays in position) C  &lt;-- comment should have remained attached to this cell   This means that sorting is completely broken and I can't use it at all, because I clearly need the cell comments to stay with the cell they're attached to.  Is this a bad bug in Google Spreadsheets, or am I missing something here? Testing for linear dependence among the columns of a matrix I have a correlation matrix of security returns whose determinant is zero. (This is a bit surprising since the sample correlation matrix and the corresponding covariance matrix should theoretically be positive definite.)  My hypothesis is that at least one security is linearly dependent on other securities. Is there a function in R that sequentially tests each column a matrix for linear dependence?  For example, one approach would be to build up a correlation matrix one security at a time and calculate the determinant at each step. When the determinant = 0 then stop as you have identified the security who is a linear combination of other securities.  Any other techniques to identify linear dependence in such a matrix are appreciated. What is the easiest way to update/upgrade an offline Ubuntu machine with the help of a Windows machine that has internet access?  This question also applies to installing new packages offline and not only updates/upgrades.  The Linux system shall remain completely cut off from the Windows machine, meaning there should be no ethernet connection or the likes between the two computers.  Update:  Please have patience, since I haven't updated this since two weeks. There are some complications getting apt-offline to work properly on Lubuntu and all other methods seem to be too old and deprecated:  AptOff - last update 2006 AptMedium - last update 2007 Keryx - last update 2011, looks like this project was discontinued  I hope I will be able to somehow update the offline machine, finally.  While I was still not able to update/upgrade the offline system due to authentication errors, I accepted an answer, because it's taking too long.