I have a question about drawing logic circuits. How to draw these dots and two lines from the dot to nand logic gate?    I just need the part of code where you draw simple line dot line with easy solution to connect between logic gates not the whole code generating this image.  \draw (A |- (nand.input 1) %dot% -- (nand.input1);
I just wrote code for this, and I got it a little bit ugly. Can you help me to fix this. And how to change those nands for not, like it is on nand 3,4,5? Please help!  PS. What I mean by these nands for not or whatever this is
Is there a way to crack the password on an Excel VBA Project? Is it acceptable to begin a declarative sentence with "Am"? I am given this problem: Suppose you have a complete graph with $n$ edges. How many vertices does your graph have?  I have this math figured out so far: We know that a complete graph has $m$ vertices, with $m-1$ edges connected to each. This makes the sum of the total number of degrees $m(m-1)$. Then, since this sum is twice the number of edges, the number of edges is $\frac{m(m-1)}{2}$.  But I don't think that is the answer. I think I am missing a piece of the math, but I can't figure out what else I need to do. Can anyone help me with what I'm missing or doing wrong? Proving that the general linear group is a differentiable manifold We know that the the general linear group is defined as the set $\{A\in M_n(R): \det A \neq 0\}$. I have a homework on how to prove that it is a smooth manifold. So far my only idea is that we can think of each matrix, say $A$, in that group as an $n^2-$dimensional vector. So i guess that every neighborhood of $A$ is homeomorphic to an open ball in $\mathbb{R}^{n^2}$ (However, i don't know how to prove this.)  Now, I'm asking for help if anyone could give me a hint on how to prove that the general linear group is a smooth manifold since I really don't have an idea on how to do this. (By the way, honestly, I don't really understand what a $C^{\infty}-$smooth structure means which is essential to the definition of a smooth manifold.) Your help will be greatly appreciated. :) Find the limit of $\frac{\log(n+1)}{\log(n)}$ where $n\rightarrow\infty$. Here $n$ is a natural number so I guess we can't use L'Hopital Should I submit https:// and http:// in Google Search Console both with and without the www? In my site I'm redirecting everything (http://, http://www., https://) to https://www.example.com.  Google webmaster tools says: Make sure you add both "www" and "non-www" versions for your site. Also, if you use the HTTPS protocol, add those variations as well.  So I've added all the FOUR versions to google webmaster tools. Is this a correct process? Create a virtual file that is actually a command Show that $11^{10} \equiv 1 (\mod 100)$ $11^{10} \equiv 1 \pmod{100}$  I tried to solve by using euler's theorem, But I got stuck.  $\gcd(11, 100) = 1$  $11^{φ(100)} \equiv 1 \pmod{100}$  $11^{40} \equiv 1 \pmod{100}$  I don't know how to go on as $11^{40}$ is bigger than $11^{10}$ StackExchange drop down hiding chat, blog and log out, concerns What's the difference between terms 'link function' and 'canonical link function'? Also, are there any (theoretical) advantages of using one over the other?  For example, a binary response variable can be modeled using many link functions such as logit, probit, etc. But, logit here is considered the "canonical" link function. If $A^2 = I$, then $\operatorname{rank} (A+I) + \operatorname{rank} (A-I) =n$ If $A^2 = I$ where $A$ is an $n\times n$ matrix, then why is $\operatorname{rank} (A+I) + \operatorname{rank} (A-I) =n$.   I am not sure why this seems to be true. How do we fetch data through REST service which hosted in azure from SharePoint site which in office 365? How do we fetch data through REST service which is hosted in window azure, from SharePoint site which in office 365? Can we need to create app for SharePoint which contain restAPI endpoint or any better solution than this? Bad substitution: no closing "`" in a heredoc / EOF I'd like to print a man style usage message to describe a shell function like this output man find:  NAME        find - search for files in a directory hierarchy  SYNOPSIS        find [-H] [-L] [-P] [-D debugopts] [-Olevel] [starting-point...] [expression]  DESCRIPTION        This  manual  page  documents the GNU version of find.  GNU find searches the directory tree rooted at each        given starting-point by evaluating the given expression from left to  right,  according  to  the  rules  of        precedence  (see section OPERATORS), until the outcome is known (the left hand side is false for and opera‐        tions, true for or), at which point find moves on to the next file name.  If no  starting-point  is  speci‐        fied, `.' is assumed.  OPTIONS   I am facing an error message on the ` character. Following simple script shows the error:  ~$ cat &lt;&lt;EOF `.' EOF  bash: bad substitution: no closing "`" in `.'   I though heredoc was a cool way to echo strings by pasting them without having to escape its content such a quotes, etc... I assume I was wrong :/  Can someone explain this behavior please? Can heredoc accept ` character?  Edit 2: I accepted the answer of quoted here-document  &lt;&lt;'END_HELP', but I finally won't use it for this kind of complete manual output as  does   Edit 1: (For future reads) the limit with using quoted here-document is that is prevents to use tput in the here-document. To do so, I did the following:   unquoted here-document, for tput commands to be executed prevent the "bad substitution" error by escaping the backtick instead use tput within the  here-document   Example:  normal=$( tput sgr0 ) ; bold=$(tput bold) ;  cat &lt;&lt;END_HELP # here-document not quoted ${bold}NAME${normal}        find - search for files in a directory hierarchy  ${bold}SYNOPSIS${normal}        find [-H] [-L] [-P] [-D debugopts] [-Olevel] [starting-point...] [expression]  ${bold}DESCRIPTION${normal}        This  manual  page  documents the GNU version of find.  GNU find searches the directory tree rooted at each        given starting-point by evaluating the given expression from left to  right,  according  to  the  rules  of        precedence  (see section OPERATORS), until the outcome is known (the left hand side is false for and opera‐        tions, true for or), at which point find moves on to the next file name.  If no  starting-point  is  speci‐        fied, \`.' is assumed. END_HELP  unset normal ; unset bold ;   Here, note the escaped backtick that was source of error:  \`.' Name of component on output side cable of a DC power adapter? What is the name of this component (circled in red) of a charger?    What are the uses of this component? Why doesn't the Java SDK installer set JAVA_HOME? I always wondered why I have to manually set the JAVA_HOME environment variable after installing the Java SDK.     JAVA_HOME=c:\Program Files\Java\jdk1.6.0_12   Visual Studio at least provides a batch file to set these kind of environment variables:     call "c:\Program Files\Microsoft Visual   Studio 9.0\VC\vcvarsall.bat"   Does Java have something similar? I'm trying to make a build script that should simply work after installing the Java SDK. I don't want people to mess with environment variables on their PC. Make all i.stack.imgur.com links protocol-relative Stack Overflow has HTTPS in some places! However, this breaks most existing image links. Could those be made protocol-relative, or react to the requesting protocol, or just always use HTTPS?  The same applies to .sponsor-tag-img. Restrict the access to suggested edit reviews on deleted posts on an answer deleted as rude/abusive is visible, even without logging in (and for users with less than 10k reputation). These users can't see the answer , via the , or a direct link to the .    This is a potential avenue for spammers, just like the suggested edit spam used to be, but is ; according to the :     In addition, in order to reduce the incentive for spammers to make spam edits that get rejected, suggested edit spam is hidden from logged-out users, so they can't show their clients public-facing pages with spam (so they won't get paid).   For this to work, the spammer would need two accounts, one to post the spam and a second one to suggest an edit. Even if the spam post is quickly nuked, the review link will be active forever. One could argue that logged-in users without 10k reputation shouldn't be able to see the suggested edits either; I'm partial to that. If a SHA256 hash with high entropy is then hashed with one made from low entropy, is the resulting hash higher/same/lower entropy? If one were to create a SHA256 hash using 256 coin flips converted to hex (which, as I understand it, is as "entro-phized" as one can capture in SHA256) then take that hash as a string, combine that with a hash of the word "cat" and hash the resulting 512 character string, would the resulting hash from that exercise be any less random than our "perfect" hash we began with?  My thinking is the final string would capture the same amount as the original randomness as what we started with because the "extra" entropy can not be captured and is lost. Is this the case and am I thinking about this correctly? Would hashing something with high entropy with something simpler ever cause a lower amount of randomness or does it only go up?  Thanks to anyone who can help explain this a little better. "The Struts dispatcher cannot be found" error while deploying application on WebLogic 12.1.3 What does the colon in Tikz coordinates mean?