I meet my friend every day. I meet to my friend every day. I meet with my friend every day.   Is "meet" a transitive, or intransitive, or both?  I'd appreciate your help.
What is the difference between "meet" and "meet with"?  For example, which of these should I say?        I met my boss yesterday    I met with my boss yesterday   I'm meeting my friends tonight    I'm meeting with my friends tonight
Proof that the irrational numbers are uncountable Can someone point me to a proof that the set of irrational numbers is uncountable? I know how to show that the set $\mathbb{Q}$ of rational numbers is countable, but how would you show that the irrationals are uncountable? How to prove this result involving the quotient maps and connectedness? Given topological spaces $X$ and $Y$, where $Y$ is connected, let $p \colon X \to Y$ be a quotient map. If, for each point $y \in Y$, the set $p^{-1}(\{y\})$ is connected, then how to prove that $X$ is connected also?   By the map $p$ being a quotient map is meant the following:   The map $p$ is surjective, and, for any subset $V$ of $Y$, the set $V$ is open in $Y$ if and only if $p^{-1}(V)$ is open in $X$. i know that|$S_n$|=$n!$ and |$A_n$|= $\frac{n!}{2}$ but i'm not sure where to go from there. Thanks. Why is there one P in "hoping" and two P's in "hopping"? Hoping is the present participle of hope. hopping is the present participle of hop. Hoping has only one p while hopping has two. What difference does it make? Why is hoping not hopping?  Edit: I changed mop to hop because of a comment by Kat.  Kat: Why would you compare hope to mop instead of hope to hop (in which case I think your answer will become obvious)? How much sleep do adults actually need? The common consensus is that most adults should get 8 hours of sleep a night.  However, sleep needs are highly variable, with some people needing more to function properly, and some gaining little benefit past just a few hours. I'm trying to learn more about the statistics here.  I'd imagine sleep needs would fit a normal distribution, with a median of around 8 hours and a standard deviation of around an hour. The  would then put 68% of adults in the 7-9 hour range, 95% in the 6-10 hour range, and 99.7% in the 5-11 hour range, but that's just a guess.  Has this distribution been studied, and where? Autoexpand UITextView height dynamically in ios Current  enables one to upgrade to macOS Mojave from a stable release, but I want to try out a fresh installation instead of upgrading with previous data, so that I can assess it better.  I've downloaded an application named "macOS Mojave Beta" from the App Store, and running it would presumably result in an upgrade. Now I wonder what to do next. Would  and booting from it be a good idea, when I'm working with a Beta version? How to get BSD FTP and Telnet back in 10.13 (High Sierra)? There are  with not having ftp and telnet present in 10.13 now as per Apple's dictate.  Has anyone found a solid way to bring BSD ftp and telnet back to macOS vs using inetutils? I have a DVD I was trying to rip, and handbrake froze up when scanning it.  I tried to eject the DVD by dragging and dropping it to the trash, which trashed the icon, but didn't eject the DVD.  I then forced Handbrake to quit, but without an icon on my desktop to select, how can I eject the DVD? Any questions relating to status updates, or asking if anything is going to be patched for these vulnerabilities should be closed as duplicates of this question.    are in the news right now and sound pretty severe. I don't see any security updates from Ubuntu that cover these vulnerabilities.  What is Ubuntu doing about these vulnerabilities, and what should Ubuntu users be doing?  These are CVE-2017-5753, CVE-2017-5715 and CVE-2017-5754. Title tag different from title appearing in Google? Validate/verify PDF files integrity How to format hard disk in Ubuntu 14.04? How to calculate $$\int_{0}^{\pi/2}{\{\tan(x)\}dx}$$ where $\{x\}$ means the fractional part of $x$. I mentioned the zero points of $\{\tan(x)\}$. $\{\tan(x)\}$ equals to 0 iff $x=\arctan(k)$, $k$ is an integer. I tried to separate it into$$\sum_{k=0}^{\infty}{\int_{\arctan(k)}^{\arctan(k+1)}{(\tan(x)}-k)dx}$$ Then I found it hard to continue. I don't think I am on the right way. Show a,b,c congruences when $a^2+b^2=c^2$ i would like to know how to prove that if $a^2+b^2=c^2$ then   a) $3|a$ or $3|b$  b) $5|a$ or $5|b$ or $5|c$  c) $4|a$ or $4|b$   Also that $a^2+b^2+c^2+1$ can't be divisible by 8  Thank you very much! How does evolving relate to CP? I'm bugged by the following that's summarized on p. 109 of .     False theorem: All horses are the same color.      Proof by induction:      $\fbox{$P(n)$ is the statement: In every set of horses of size $n$, all $n$ horses are the same color.}$   $\fbox{Base Case or $P(1)$:}$ One horse is the same color as itself. This is true by inspection.   $\fbox{Induction Step:}$ Assume $P(k)$ for some $k \geq 1$.   $\fbox{Proof of $P(k + 1) :$}$   Since $\{H_1, H_2, ... , H_n\}$ is a set of $n$ horses, the induction hypothesis applies to this set. Thus, all the horses in this set are the same color.   Since $\{H_2, H_3, ... , H_{n+1}\}$ is also a set of $n$ horses, the induction step likewise holds for this set. Thus, all the horses in this set are the same color too.         Therefore, all $n +1$ horses in $\{H_1, H_2, H_3, ... , H_n , H_{n+1}\}$ are the same color. QED.   The issue the instructor was trying to point out is clearly valid. For the case $n = 1$, there is only ${H_1}$. So this case says nothing about possible overlapping elements of each set of $(n + 1)$, for instance $H_2$ in the above proof.    But it was proposed in the class discussion that this was the only problem. Had you been able to prove $P(2)$ true, then a proof of the above format would have been fine.    My interpretation is that yes, you could prove all horses are the same color, if you can prove that any set of two horses will be the same color. But this format would not work.  Why not? The problem I see is that the above proof is for the existence of at least one particular pair of sets of horses of sizes $n$ and $n + 1$, such that in each set, all horses are the same color.  Particularly when the set of size $n$ is a subset of the set of size $n + 1$.  In order to prove the induction step, don't you need to prove that sets of sizes $n$ and $n + 1$, do not necessarily contain the same, overlapping elements?  You could prove that any horse can be added to a set of 2 horses.  Take the last two, and they must be the same color, and so on.  Wwhatever color the first two happen to be, all other horses must thus be the same color.    Am I misinterpreting the example, or am I making a logical error? Thanks in advance. Can you use an alias in the WHERE clause in mysql? I need to use an alias in the WHERE clause, but It keeps telling me that its an unknown column. Is there any way to get around this issue? I need to select records that have a rating higher than x. Rating is calculated as the following alias:  sum(reviews.rev_rating)/count(reviews.rev_id) as avg_rating I have a huge text file (~1GB) and sadly the text editor I use won't read such a large file.  However, if I can just split it into two or three parts I'll be fine, so, as an exercise I wanted to write a program in python to do it.    What I think I want the program to do is to find the size of a file, divide that number into parts, and for each part, read up to that point in chunks, writing to a filename.nnn output file, then read up-to the next line-break and write that, then close the output file, etc.  Obviously the last output file just copies to the end of the input file.  Can you help me with the key filesystem related parts: filesize, reading and writing in chunks and reading to a line-break?  I'll be writing this code test-first, so there's no need to give me a complete answer, unless its a one-liner ;-) For example, in the past, links to www.example.com wouldn't have meant Google would pass any value to say, forum.example.com. What is the current status of this? (Please provide a reference if possible).