not such file or directory is found
How can I install a .bin file?
How to search a string in the list of answers added by me on Stack Overflow? I am able to view all the answers given by me and questions asked by me, but not able to search a string in them?  Currently I have no other choice than clicking each ques/ans link manually (very hectic) ? Is Bezout's lemma enough to confirm the GCD of a number. Is Bezout's lemma enough to confirm the GCD of a number?  So suppose we have $$ax+by=z$$ does this mean $$\gcd(a,b)=z$$ A maximal ideal among those avoiding a multiplicative set is prime Let $S$ be a multiplicatively closed subset of a ring $R$, and let $I$ be an ideal of $R$ which is maximal among ideals disjoint from $S$. Show that $I$ is prime. If $R$ is an integral domain, explain briefly how one may construct a field $F$ together with a ring homomorphism $R\to F$. Deduce that if $R$ is an arbitrary ring, $I$ an ideal of $R$, and $S$ a multiplicatively closed subset disjoint from $I$, then there exists a ring homomorphism $f\colon R\to F$, where $F$ is a field, such that $f(x)=0$ for all $x\in I$ and $f(y)\neq 0$ for all $y\in S$.   [You may assume that if $T$ is a multiplicatively closed subset of a ring, and $0\notin T$, then there exists an ideal which is maximal among ideals disjoint from $T$.]  Here is a question I need to answer. For the first part I can show if $x, y$ are not in $I$ then nor does $xy$. The second part is just the field of fractions.   For the third part, I think I need to find an ideal $J$ containing $I$ such $J$ is prime, so that $R/J$ is an integral domain, and use the second part. To find $J$ prime, I think as suggested by the hint, I should go for a maximal ideal disjoint from $S$ containing $I$, but how can I do that? Finding Maximum value of consecutive positive integers with constraints Let, $x,y,z$ be consecutive positive integers such that $\frac{1}{x} + \frac{1}{y} + \frac{1}{z} &gt; \frac{1}{10}$ I need to find the maximum value of $x+y+z$ ?  My attempt:  I tried guessing first, To maximise $x+y+z$ it is necessary to have high value for $x$, But not too high which will contradict the constrain of the problem. As we can roughly split the $0.1$ into three parts so I started with numbers closer to $30$ with trial an error I got that for $x=29$ we get the optimum and final result would be 90 (=max. value of $x+y+z$).   Is there any way to arrive at this conclusion with using inequalities? Any hints will be appreciated... Correlations with unordered categorical variables What methods can I use to create balance and consistency between a group of differing logos? A regular challenge that I face is balancing two (or more) logos. Whether they need to be equal or one needs to be given priority. Some logos however might be squares, others rectangles, circles, etc...   As a quick sample I snagged a nice high resolution photo from  and pretend its going to be an advertisement that needs to show some footwear brand logos on it. In this case I used Adidas and Saucony.  This is certainly not balanced even though they're height is the same:    Likewise this is not balanced even though they're width is the same:    So then the question becomes when are they in balance, is this balance:    Maybe a little more adjustment, is this balance:    And in these examples I'm only working with two Black Logos. Factor in color and it can get even more difficult to balance. Another issue being when there's tiny text as part of the logo.  So the question is, other than estimating / eye-balling it, what tips, methods or even tools are there to balance different sized logos? Why there's no article with 'Mexican' and 'an' with American in sentence: "She’s Mexican. But she’s married to an American."   (Pimsleur English course) I want to hit enemy's axe to break it. How this is properly played in D&amp;D 5e? And what about shield or armor? Can I attack these items to break it? Issue in evaluating the performance of my "clustering algorithm" using NMI, ARI when the "ground truth" is available? I want to create a   How can I create a formfield with N fields, each 5 mm wide with separations like in the picture?    At the moment I use a workaround with a for loop, but this renders the code hard to maintain. Finally I need a function \formline{N}{cellwidth}{label}{value} to create the complete formfield and fill it with an optional value:   The following code is available on .   \documentclass[a4paper,11pt]{article} \usepackage[utf8]{inputenc} \usepackage{tikz} \usetikzlibrary{shapes}  \thispagestyle{empty} % no pagenumber. The form should be a stand alone macro... later.  \definecolor{SEPAOrange}{RGB}{254,213,161} \definecolor{SEPADOrange}{RGB}{253,185,19} \definecolor{SEPABlindcolor}{RGB}{255,0,0} \begin{document} \begin{tikzpicture}[x=1 mm, y=-1mm] \pgfmathsetmacro{\yh}{4.2333} % y heigth step defined as 1/6 inch =&gt; 1/6 * 25.4 mm = 4.2333 mm \pgfmathsetmacro{\xs}{9} % x start (own definition) \pgfmathsetmacro{\xe}{141.5} % x end (own definition) \pgfmathsetmacro{\widefield}{4.9859} % def: 134.62 mm / 27 \pgfmathsetmacro{\narrowfiels}{3.9594} % def: 134.62 mm/ 34  \filldraw[draw=black,color=SEPAOrange] (7.62, 4.5*\yh) rectangle (149.86-7.62,105.83-1); %orange background  \filldraw[draw=black,color=white] (\xs, 5*\yh) rectangle (\xe, 6.5*\yh -1.5); %Recepient 27 Char \foreach \x in {1,...,26} {  \draw[color=SEPAOrange, line width=0.3mm] (7.62 + \x*\widefield, 5*\yh ) -- (7.62 + \x*\widefield, 6.5*\yh);  \draw[color=SEPAOrange, line width=0.7mm] (7.62 + \x*\widefield, 5.8*\yh ) -- (7.62 + \x*\widefield, 6.5*\yh); }  \filldraw[draw=black,color=white] (\xs, 7*\yh) rectangle (\xe, 8.5*\yh -1.5); %IBAN 34 Char \foreach \x in {1,...,33}  \draw[color=SEPAOrange, line width=0.3mm] (7.62 + \x*4, 7*\yh ) -- (7.62 + \x*4, 8.5*\yh);  \filldraw[draw=black,color=white] (\xs, 9*\yh) rectangle (\xe, 10.5*\yh -1.5); %BIC \filldraw[draw=black,color=white] (\xe-12*5, 11*\yh) rectangle (\xe, 12.5*\yh -1.5); %Value 12 Char  \filldraw[draw=black,color=white] (\xs, 13*\yh) rectangle (\xe, 14.5*\yh -1.5); %Subject1 \filldraw[draw=black,color=white] (\xs, 15*\yh) rectangle (\xe, 16.5*\yh -1.5); %Subject2 \filldraw[draw=black,color=white] (\xs, 17*\yh) rectangle (\xe, 18.5*\yh -1.5); %Subject3  \filldraw[draw=black,color=white] (\xs, 19*\yh) rectangle (\xs+22*5, 20.5*\yh -1.5); % IBAN 22 Char  \filldraw[draw=black,color=white] (149.86-17.59, 19* \yh) rectangle (\xe, 20.5*\yh -1.5); % counter \filldraw[draw=black,color=white] (\xs, 21* \yh) rectangle (42.52, 24.5*\yh); % date \filldraw[draw=black,color=white] (42.52+5, 21*\yh) rectangle (149.86-17.59, 24.5*\yh); % signature  \draw[color=SEPADOrange] (0, 4.5 *\yh) --(149.86, 4.5*\yh); upper dark orange line \draw[color=SEPADOrange] (0, 20.5 *\yh) --(149.86, 20.5*\yh); lower dark orange line \draw[draw=black,color=black, line width=0.3mm] (0,0) rectangle (149.86,105.83); % black border %\draw[align=left] at (\yh,\yh) {SEPA-Überweisung};  \end{tikzpicture} \end{document} "Neither Michael nor Albert is correct" or "Neither Michael nor Albert are correct"? What is the correct sentence?  Neither Michael nor Albert is correct.   Neither Michael nor Albert are correct. Perfect set without rationals How to install and configure Wine? I am looking for a step by step instruction to guide me in the ways of installing, configuring and debugging many of the issues new users have when dealing with Wine in Ubuntu.  What is the recommended way of installing Wine, some of the key issues that it has and how to solve them?  If I have a specific problem with an App in Wine, how do I go about solving it? What are the recommended steps to ensure that I can fix a problem related to an app I wish to use? MySQL single table static and dynamic pivot I have a table that looks like this:  +----------------------------------------+ |Name                | kode      | jum   | +----------------------------------------+ | aman               |kode1      | 2     | | aman               |kode2      | 1     | | jhon               |kode1      | 4     | | amir               |kode2      | 4     | +--------------------+-----------+-------+   How can I make a view like this with MySQL?                      kode1    kode2     count aman                  2         1        3   jhon                  0         4        4 amir                  0         4        4 I have a JavaScript widget which provides standard extension points. One of them is the beforecreate function. It should return false to prevent an item from being created.   I've added an Ajax call into this function using jQuery:  beforecreate: function (node, targetNode, type, to) {   jQuery.get('http://example.com/catalog/create/' + targetNode.id + '?name=' + encode(to.inp[0].value),    function (result) {     if (result.isOk == false)          alert(result.message);   }); }   But I want to prevent my widget from creating the item, so I should return false in the mother-function, not in the callback. Is there a way to perform a synchronous AJAX request using jQuery or any other in-browser API? Predicate Calculus Practice I've been doing some practice questions in the textbook for an upcoming predicate calculus lecture and I think I've managed to get A and B (possibly C) correct but I am clueless on how I can manage D and E.   For A I got: ∃x(R(x)∧¬B)  For B I got: ∀x(¬R(x)∧B)  For C I got: ∃x(R(x)∧(x=y))   - Not sure if this is even remotely correct    R(X) : ”X is rich”  X = Y : ”X equals Y”  B : ”Bill Gates”  a) Someone besides Bill Gates is rich.  b) Bill Gates alone is rich.  c) At least two people are rich.  d) Exactly one person is rich.  e) Exactly two persons are rich.  The universe of discourse is the set of all people. I have a LAMP server with following configuration.  CPU : Intel(R) Xeon(R) CPU   RAM : 32 GB  HDD : 80 GB  Running on virtual environment.  All the things in the server are running smoothly. But I have noticed that the RAM usage is the server is increasing each day without any reason.   This is the current memory usage on my server.  # free -g              total       used       free     shared    buffers     cached Mem:            31         13         17          0          0         10 -/+ buffers/cache:          1         29 Swap:            2          0          2   And you can see the last 8 weeks memory usage below.   And i have executed the following command to find how much memory each process is consuming.  # ps -eo size,pid,user,command --sort -size | awk '{ hr=$1/1024 ; printf("%13.2f Mb ",hr) } { for ( x=4 ; x&lt;=NF ; x++ ) { printf("%s ",$x) } print "" }'          0.00 Mb COMMAND        2253.62 Mb /usr/libexec/mysqld --basedir=/usr --datadir=/var/lib/mysql --user=mysql --pid-file=/var/run/mysqld/mysqld.pid --skip-external-locking --socket=/var/lib/mysql/mysql.sock        1171.66 Mb java -jar /etc/vmagent/bin/VMAgent.jar         138.27 Mb /sbin/audispd         127.75 Mb /usr/sbin/named -u named -c /etc/named.conf -u named -t /var/named/run-root          74.29 Mb auditd          73.03 Mb automount          43.14 Mb /usr/bin/spamd --username=popuser --daemonize --nouser-config --helper-home-dir=/var/qmail --max-children 5 --create-prefs --virtual-config-dir=/var/qmail/mailnames/%d/%l/.spamassassin --pidfile=/var/run/spamd/spamd_full.pid --socketpath=/tmp/spamd_full.sock          43.14 Mb spamd child          43.14 Mb spamd child          37.13 Mb /usr/sbin/httpd          37.02 Mb /usr/sbin/httpd          36.52 Mb /usr/sbin/httpd          36.46 Mb /usr/sbin/httpd          36.23 Mb /usr/sbin/httpd ................   For troubleshooting , i have restarted the MySQL and APACHE servers. But the result was same. Restarting the entire server will fix the issue, but i want to know what is the real issue.  Let me know if you have any idea about this issue.  Thanks,  Arun S Find the value of : $\lim_{n\to\infty}\prod_{k=1}^n\cos\left(\frac{ka}{n\sqrt{n}}\right)$ How to prove that the sum and product of two algebraic numbers is algebraic? Suppose $E/F$ is a field extension and $\alpha, \beta \in E$ are algebraic over $F$. Then it is not too hard to see that when $\alpha$ is nonzero, $1/\alpha$ is also algebraic. If $a_0 + a_1\alpha + \cdots + a_n \alpha^n = 0$, then dividing by $\alpha^{n}$ gives $$a_0\frac{1}{\alpha^n} + a_1\frac{1}{\alpha^{n-1}} + \cdots + a_n = 0.$$     Is there a similar elementary way to show that $\alpha + \beta$ and $\alpha \beta$ are also algebraic (i.e. finding an explicit formula for a polynomial that has $\alpha + \beta$ or $\alpha\beta$ as its root)?    The only proof I know for this fact is the one where you show that $F(\alpha, \beta) / F$ is a finite field extension and thus an algebraic extension. Recently the keyboard and trackpad on my 2015 13" MacBook Pro have stopped working. This is the second laptop to do this, the same issue happened about 6 months ago and Apple gave me a new one when they could not figure it out.  The issue usually starts with force touch not working then progresses to the keyboard and trackpad not being recognized at all. Currently the power button works and force touch works but all other keys and the trackpad don't work.  When this happens there are a lot of errors in the console regarding the AppleHSSPIController.  4/21/16 6:56:47.000 AM  kernel[0]   Error: AppleHSSPIDevice::start failed to get device descriptor 4/21/16 6:56:47.000 AM  kernel[0]   Error: AppleHSSPIController::_enumerateDevice Start failed 4/21/16 6:56:47.000 AM  kernel[0]   Error: AppleHSSPIController::_handleEnumerationFailureGated Giving up on device   You can see the full log here: