I have this device that has to be setup as a USB Host.  Normally, my laptop is a USB Host, how do I connect to such a device? When I plug the USB cable into my laptop, I don't see a tty being assigned (ttyUSB0/ttyACM0).
Some applications simulate a virtual USB or CD Rom drive as if a USB drive is attached to the computer.  Is there any configuration or application that provides a virtual USB drive, not for the the operating system itself, but for other equipments which accept USB drive, through a USB port.  So I'll have a virtual hard disk (e.g. a *.vdi file) in the computer, which is connected, through a USB socket, as a USB drive to some other equipment (e.g. a cell phone or a laptop).
Is there a way to show that $\sqrt{p_{n}} < n$? Is there a way to show that $\sqrt{p_{n}} &lt; n$?  In , I show that $f_{2}(x)=\frac{x}{ln(x)} - \sqrt{x}$ is ascending, for $\forall x\geq e^{2}$. As a result, $\forall n \geq 3$ $$\frac{p_{n}}{ln(p_{n})} - \sqrt{p_{n}}\leq \frac{p_{n+1}}{ln(p_{n+1})} - \sqrt{p_{n+1}}$$ Also (and as a result), $\forall n \geq 3$ $$ \frac{p_{n}}{ln(p_{n})} - \sqrt{p_{n}} &gt; 0$$ Or $$ \frac{\pi (p_{n})}{p_{n}/ln(p_{n})} &lt; \frac{\pi (p_{n})}{\sqrt{p_{n}}}$$  According to  $$\displaystyle\smash{\lim_{n \to \infty }}\frac{\pi (p_{n})}{p_{n}/ln(p_{n})}=1$$ Or, $\forall \varepsilon &gt;0$, $\exists N(\varepsilon )$: $\forall n&gt;N(\varepsilon )$ $$1- \varepsilon &lt; \frac{\pi (p_{n})}{p_{n}/ln(p_{n})} &lt; 1+ \varepsilon$$ Or $$1- \varepsilon &lt; \frac{\pi (p_{n})}{p_{n}/ln(p_{n})} &lt; \frac{\pi (p_{n})}{\sqrt{p_{n}}}$$ As a result $\forall \varepsilon &gt;0$, $\exists N(\varepsilon )$: $\forall n&gt;N(\varepsilon )$ $$(1 - \varepsilon ) \cdot  \sqrt{p_{n}} &lt; \pi (p_{n}) = n$$  But this is not enough.  Interestingly,  is true iff function $f_{4}(x)=\pi (x) - \sqrt{x}$ is strictly ascending ($x &lt; y \Rightarrow f(x) &lt; f(y)$) for prime arguments.  If $f_{4}(p_{n}) &lt; f_{4}(p_{n+1})$ then $$\pi (p_{n}) - \sqrt{p_{n}} &lt; \pi (p_{n+1}) - \sqrt{p_{n+1}}$$ Or $$\sqrt{p_{n+1}} - \sqrt{p_{n}} &lt; \pi (p_{n+1}) - \pi (p_{n}) =1$$  And vice-versa, if $$\sqrt{p_{n+1}} - \sqrt{p_{n}} &lt; 1$$ Then $$-\sqrt{p_{n}} &lt; -\sqrt{p_{n+1}} + 1$$ Or $$\pi (p_{n})-\sqrt{p_{n}} &lt; \pi (p_{n}) + 1 -\sqrt{p_{n+1}} = \pi (p_{n+1}) -\sqrt{p_{n+1}}$$  So, if Andrica's conjecture is true then $\forall n \geq 3$ $$\pi (p_{n})-\sqrt{p_{n}} &gt; 0$$ Or $$\sqrt{p_{n}} &lt; \pi (p_{n})= n$$ How can I prove $n - 2\sqrt{n} = \Theta(n)$ Let $M$ be a smooth manifold and let $N$ be a manifold with boundary. If $dF_{p}$ is an isomorphism, then $F\left(p\right)\in\mbox{int}M $. Let $M$ be a smooth manifold and let $N$ be a manifold with boundary, both with the same dimension $n$. If $dF_{p}$ is an isomorphism, then $F\left(p\right)\in\mbox{int}N  $.  I am trying to prove this theorem to prove a result about smooth embeddings.  Here is how I am thinking the problem could be solved. Assume thet $F(p)$ is a boundary point of $N$. Then there exists a chart $(V,\psi)$ at $F(p)$ such that $\psi(V) $ is an open subset of the upper half space $\mathbb{H}^{n}$. I guess we have to use some fact about $M$ having no boundary and the the fact that $dF_p$ is an isomorphism to show that there is a contradiction, but I cannot figure that out. Stored Procedures, MySQL and PHP The question is a fairly open one. I've been using Stored Procs with MS SQLServer for some time with classic ASP and ASP.net and love them, lots.  I have a small hobby project I'm working on and for various reasons have gone the LAMP route. Any hints/tricks/traps or good starting points to get into using stored procedures with MySQL and PHP5? My version of MySQL supports Stored Procedures. Some compound words are written without hyphens (nonaggression, nonbeliever), some with hyphens (well-intentioned), and others with spaces (post office).  Is there a rule or good guide as to which option should be used? Will Find my iPhone Lost Mode be useful if stolen phone as shows Offline? My phone was stolen last night. I made sure it was in Lost Mode in iCloud and it was immediately in Offline status when I open iCloud. I am positive the thief switched it off. Now I am 100% certain the Find my iPhone option was turned on on my iPhone, but will the "Lost Mode" be of any help if it was not turned on on the iPhone? Would it be showing "Offline" if I did not turn on the option? How can I detect if my apple device supports Bluetooth Low Energy How to run Unix shell script from Java code? It is quite simple to run a Unix command from Java.   Runtime.getRuntime().exec(myCommand);   But is it possible to run a Unix shell script from Java code? If yes, would it be a good practice to run a shell script from within Java code? Sorry for the title, its hard to put the problem into proper words.  Basically, in Firefox or Chrome, I try to navigate to stackoverflow.com.  The request fails and the URL I see in the navigation bar is:  http://d2e24t2jgcnor2.webhostoid.com/Secure/Error?URL=http%3A%2F%2Fstackoverflow.com%2F&amp;ResponseCode=504&amp;user_id=5b5033d3-3543-4b7c-9844-055afde93841&amp;uc=20140915&amp;subid=20140915&amp;source=browsersafeguard-rockettab-spigot&amp;version=1.0.5370.12627&amp;implementation_id=browsersafeguard-rockettab-spigot%20&amp;block_host=False&amp;reg=False&amp;redirectms=True   This looks shady and my internet seems slower lately. I have a few questions:   Why is my request going through this strange URL? Do the query parameters reveal my identity? How can I stop this?   I use my cell phone’s 3G network and tether it to my laptop. Automatically add vertical space /only/ between two sequential paragraphs I am using KOMA-script scrreprt class.  I know I can use \usepackage{parskip} or \setlength{\parskip}{12pt}, but both of these also affect headings.  Adding \vspace{12pt} manually between all two sequential paragraphs seems to work, but that's anything but convenient. Is there a way to automate it? What is the difference between data mining, statistics, machine learning and AI?  Would it be accurate to say that they are 4 fields attempting to solve very similar problems but with different approaches? What exactly do they have in common and where do they differ? If there is some kind of hierarchy between them, what would it be?  Similar questions have been asked previously but I still don't get it: Is it possible to transfer Minecraft PE worlds to Minecraft PC? I have a really cool Minecraft PE world, and I would like to also have it on my Computer. Is there a way to move a Minecraft PE world onto the PC Edition?  My tablet is Android and my Computer is Windows 7. Thanks! How do you end with a single quote followed by a double quote? I have a paragraph as follows:  ``This is a quote. `Here is a quote within a quote.'''   But the formatting works out to be a double quote (") followed by a single quote (') instead of the other way around. How can I solve this problem? Java - Screen turns black, when setting a JFrame to Fullscreen 18.04.01 Not available for server Notification for reviews shows way too many Sum of real numbers that multiply to 1 I've seen a question in my math book with this explanation above it: "If the product of n positive real numbers is 1, then the sum of these numbers must be more than n". I was wondering if this is correct, and if it is, could someone give an explanation or a proof for it? Function in Table Motivation for Kolmogorov distance between distributions There are many ways to measure how similar two probability distributions are.  Among methods which are popular (in different circles) are:   the Kolmogorov distance: the sup-distance between the distribution functions; the Kantorovich-Rubinstein distance: the maximum difference between the expectations w.r.t. the two distributions of functions with Lipschitz constant $1$, which also turns out to be the $L^1$ distance between the distribution functions; the bounded-Lipschitz distance: like the K-R distance but the functions are also required to have absolute value at most $1$.   These have different advantages and disadvantages.  Only convergence in the sense of 3. actually corresponds precisely to convergence in distribution; convergence in the sense of 1. or 2. is slightly stronger in general.  (In particular, if $X_n=\frac{1}{n}$ with probability $1$, then $X_n$ converges to $0$ in distribution, but not in the Kolmogorov distance. However, if the limit distribution is continuous then this pathology doesn't occur.)   From the perspective of elementary probability or measure theory, 1. is very natural because it compares the probabilities of being in some set. A more sophisticated probabilistic perspective, on the other hand, tends to focus more on expectations than probabilities. Also, from the perspective of functional analysis, distances like 2. or 3. based on duality with some function space are very appealing, because there is a large set of mathematical tools for working with such things.  However, my impression (correct me if I'm wrong!) is that in statistics, the Kolmogorov distance is the usually preferred way of measuring similarity of distributions.  I can guess one reason: if one of the distributions is discrete with finite support -- in particular, if it is the distribution of some real-world data -- then the Kolmogorov distance to a model distribution is easy to compute.  (The K-R distance would be slightly harder to compute, and the B-L distance would probably be impossible in practical terms.)  So my question (finally) is, are there other reasons, either practical or theoretical, to favor the Kolmogorov distance (or some other distance) for statistical purposes? I am looking to use Java to get the MD5 checksum of a file.  I was really surprised but I haven't been able to find anything that shows how to get the MD5 checksum of a file.  How is it done?