Is it just me, or is this an obvious way to see in an instant whether or not a post to review is a test?
Review audit ignores closereason filter
Prove Inverses not need be Unique if Associativity fails Let $M=\{x, y, z\}$ be a set and let $\circ$ be a binary operation on $M$ such that the identity element is $x$ and $y \circ y = x = y \circ z$. Prove that inverses need not be unique if associativity fails given the multiplication table below.  $x \circ x = x, x \circ y = y, x \circ z = z$  $y \circ x = y, y \circ y = x, y \circ z = x$  $z \circ x = z, z \circ y = x, z \circ z = x$ $ d = \gcd(a,b)\Rightarrow\ \gcd(a/d,b/d) = 1$ Could someone please help me with this proof?     Suppose that $a, b \in N$, and $d = \gcd(a, b)$. Since $d$ divides $a$, we have $a = de$ for some integer $e,$ and similarly $b = df$ for some integer $f$. Prove that $\gcd(e, f) = 1$.   I understand why it works. Since d is all the common factors of $a$ and $b, e$ and $f$ had no common factors, therefore the $\gcd(e,f) = 1$. But how do I prove this?  Thanks in advance. Is there a difference between Therefor and Therefore? The process substitution &lt;(cat) doesn't work. Why?  head &lt;(cat)  cat: -: Input/output error   I can use an extra file descriptor, but I don't understand why the above doesn't work.  # Using file descriptor 3 to reroute the input (head &lt;(cat &lt;&amp;3)) 3&lt;&amp;0 Famous puzzle: Girl/Boy proportion problem (Sum of infinite series) I've got a couple of URL autocomplete suggestions where Chrome suggests the wrong URL consistently.   How can I delete the incorrect entry from the address bar's suggestion list? The page I want shows up too but it's never the first result. What is the best place for storing binary files that are related to data in your database? Should you:   Store in the database with a blob Store on the filesystem with a link in the database Store in the filesystem but rename to a hash of the contents and store the hash on the database Something I've not thought of   The advantages of (1) are (among others) that atomicity of transactions is preserved. The cost is that you might dramatically increase storage (and associated streaming/backup) requirements  The goal of (3) is to preserve atomicity to some degree - if you can enforce that the filesystem you are writing to does not allow files to be changed or deleted, and always has the correct hash as filename. The idea would be to write the file to the filesystem before permitting the insert/update referencing the hash - if this transaction fails after the filesystem write but before the database DML, that is fine because the filesystem is 'faking' being the repository of all possible files and hashes - it doesn't matter if there are some files in there that are not being pointed to (and you could clean them up periodically if you are careful)  EDIT:  It looks like some RDBMSs have this covered in their individual ways - I'd be interested to know how others do it - and particularly in a solution for postgres How to put a brace on the right, not left, to group cases? If $\sum a_n b_n <\infty$ for all $(b_n)\in \ell^2$ then $(a_n) \in \ell^2$ I'm trying to prove the following:     If $(a_n)$ is a sequence of positive numbers such that $\sum_{n=1}^\infty a_n b_n&lt;\infty$ for all sequences of positive numbers $(b_n)$ such that $\sum_{n=1}^\infty b_n^2&lt;\infty$, then $\sum_{n=1}^\infty a_n^2 &lt;\infty$.   The context here is functional analysis homework, in the subject of Hilbert spaces.  Here's what I've thought:  Let $f=(a_n)&gt;0$. Then the problem reads: if $\int f\overline{g}&lt;\infty$ for all $g&gt;0,g\in \ell^2$, then $f\in \ell^2$. This brings the problem into the realm of $\ell^p$ spaces.  I know the inner product is defined only in $\ell^2$, but it's sort of like saying: if $\langle f,g\rangle &lt;\infty$ for all $g&gt;0,g\in \ell^2$ then $f\in \ell^2$.  I read this as: "to check a positive sequence is in $\ell^2$, just check its inner product with any positive sequence in $\ell^2$ is finite, then you're done", which I find nice, but I can't prove it :P  From there, I don't know what else to do. I thought of Hölder's inequality which in this context states: $$\sum_{n=1}^\infty a_nb_n \leq \left( \sum_{n=1}^\infty a_n^2 \right)^{1/2} \left( \sum_{n=1}^\infty b_n^2 \right)^{1/2}$$  but it's not useful here. Normalising Constant for exponentiated function What would the normalising  constant be of the following, or atleast an approximation? I would like to avoid sampling.  $$f(\theta)=\exp(-k_1e^{-k_2\theta^2}-\theta^2)\qquad\theta\in(-\infty,\infty), \quad k_1,k_2&gt;0$$  In the event that its not possible, what would be a valid polynomial lower bound on $\log(f(\theta))$, that would take into account $k_1$  For anyone, who is interested, I end up with this expresssion because I place a Gaussian prior over (a squared exponential) kernel parameters, and trying to use variational bayes (hence, a lower bound). How to overload __init__ method based on argument type? What should I do to avoid ear pain when flying? I always feel a pain in my ears when flying. Specially when descending. The last time I had extreme pain, feeling it inclusive around my eye balls. It felt like someone was touching the eye and pulling it from the inside. I really had to focus, close my eyes and hold to avoid screaming. I am not sure but I think both things might be related. Such a severe situation only happened once.  I just heard that with a cold the ear pain gets worse. I am bit worried that I might go through that situation again. I have a cold and I am going to fly soon.  What can I do to improve this?  I see that some consider this a duplicate of the question "best way to make my ears pop" but after reading the answers I think my question goes a bit beyond that since my pain is more extreme and I think it goes beyond just popping the ears. I also want to know if other methods, like using earplugs, might be effective. Challenges with Key with Gaps? I have an issue which I could not solve, although I tried and I got some help on R forum.  I am trying to calculate Mahalanobis distances on a data.frame, where I have several hundreds of groups and several hundreds of variables. Whatever I do, I get the system is computationally singular: reciprocal condition number error.   It is clear that it is singular, but is there any way to get rid of it and run Mahalanobis? Should I forget solve this using another approach? If yes, then what else to use?  I have uploaded the data file to my :  It is a tab delimited txt file with no headers.  I was working with the R StatMatch Mahalanobis (also tried stats Mahalanobis) function. I have a deadline for this project (not a homework!), and I could always use this function, so I thought I will be able to keep the calculations short, but now I am lost.  Migrated . Find the value of $\int_{-\infty}^{\infty} \frac{e^{-x^2}}{1+x^2} dx$ . Find the value of $\int_{-\infty}^{\infty} \frac{e^{-x^2}}{1+x^2} dx$     My attempt  First, I know the existence of this integral since $$ \mid \int_{-a}^{a} \frac{e^{-x^2}}{1+x^2} dx \mid \;\; \leq\;\;  \mid \int_{-a}^{a} \frac{1}{1+x^2} dx \mid$$  Next, let $R &gt;0 $ be an arbitrary and $\gamma_1(t) = -R(1-t) + Rt , \;\; 0 \leq t \leq1$ and $\gamma_2(t)= Re^{i\pi (t-1)}, \;\; 1 \leq t \leq 2 $.  So, take $f(z) = \frac{e^{-z^2}}{1+z^2}$.   I tried to find the value or upper bound of norm of $$\int_{\gamma_2} \frac{e^{-z^2}}{1+z^2} dz$$.  However, $$ \lvert\int_{\gamma_2} \frac{e^{-z^2}}{1+z^2} dz\rvert \leq  \frac{\text{max}\lvert e^{-z^2}\rvert}{R^2-1}\pi R = \frac{e^{R^2}}{R^2-1}\pi R $$ So, I can't proceed this.  May I ask you how to solve this? Determining application path in a Python EXE generated by pyInstaller I have an application that resides in a single .py file.  I've been able to get pyInstaller to bundle it successfully into an EXE for Windows.  The problem is, the application requires a .cfg file that always sits directly beside the application in the same directory.  Normally, I build the path using the following code:  import os config_name = 'myapp.cfg' config_path = os.path.join(sys.path[0], config_name)   However, it seems the sys.path is blank when its called from an EXE generated by pyInstaller.  This same behaviour occurs when you run the python interactive command line and try to fetch sys.path[0].  Is there a more concrete way of getting the path of the currently running application so that I can find files that are relative to it? prove that : $ i = \sqrt {-1}\ $ i have a pretty nasty question. i was glancing through a few olympiad papers and stumbled upon this question:  prove that  $ i = \sqrt {-1}\ $.  i tried the conventional methods namely euler's formula  but could not figure what to do next. how do you actually proceed further? i have checked a few books and a proof is not available.are there any proof available for this How to Convert Persian Digits in variable to English Digits Using Culture? 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: How do I create a sparse file programmatically, in C, on Mac OS X? I'd like to create a sparse file such that all-zero blocks don't take up actual disk space until I write data to them.  Is it possible?