I am in need of drawing chemical complexes in space, with octahedral or tetrahedral or square or any other structure (for instance [Co(SO_4)(NH_3)_5]^+). Would anyone have any suggestion about which package to go to ? My inclination would be tikz but would there be some more specific package ? I don't think chemfig would be suited for that... ? Thanks and have a great day !
how can I add the charge and the counter ions to my complex? I'm using chemfig.  \schemestart \chemname{\chemleft[\chemfig{Ni (&lt;:[1]OH_2) (-[2]OH_2) (&lt;:[3]OH_2) (&lt;[5]OH_2) (-[6]OH_2) (&lt;[7]OH_2) }\chemright]}{\ce{[Ni(OH2)6]Cl2}} \schemestop     Thanks!
Does the order of declaration matter in Java/C#? In C++ I can't use a method if I declare it after the calling method.    Does this order matter in other languages like Java or C#? How to make a complaint about grades? My professor announced the grades. He told us in each part what grades we had. My oral presentation for the project was way better than other students. But he just gave me 89 for oral and gave others 88.  I think it is not fair at all, because most of the students were not clear or the did not consider timing. He also told me that "your presentation was very good".  Also, I performed very well on the final exam but he also did not give me the 100. I think it is not fair.  How can I make a complaint? What should I write? Order of the Rubik's cube group Quantum teleportation and no-communication theorem According to the Wikipedia article for the :     In very rough terms, the theorem describes a situation that is analogous to two people, each with a radio receiver, listening to a common radio station: it is impossible for one of the listeners to use their radio receiver to send messages to the other listener. This analogy is imprecise, because quantum entanglement suggests that perhaps a message could have been conveyed; the theorem replies 'no, this is not possible'.   According to the Jet Propulsion's recent article on quantum teleportation:   they can effect an entangled photon (B) with another photon (A) to change the state of the other entangled photon.  Doesn't this contradict what the no-communication theorem states ? The Problem  Accessing my site over https (the only protocol allowed) I get the content, but none of the CSS, images etc.  Drupal is creating pages in response to https requests that include http links to these resources, but it should be using https.  What I've done  I have copied a site to a dev server. The site loads and basically works fine - I can log in etc. It's just that all the links drupal generates are http. The site I've copied it from also runs over https. The site does not exist on http (it would just get a Forbidden error). I've drush cc all.  So Apache's working - I can access the site. .htaccess is working (clean urls work, for example).  I'm using SNI to access the site because the server has other vhosts too, but I'm only accessing the site using the latest Firefox (and as it's a dev site and I'm the only dev, nobody else will use it).  I've done this dozens of times and am quite stumped! Why does Drupal not notice that the request came over https?  The fix  Turns out that .htaccess has this to say:   /* Base URL (optional).                                                          If Drupal is generating incorrect URLs on your site, which could             be in HTML headers (links to CSS and JS files) or visible links on pages     (such as in menus), uncomment the Base URL statement below (remove the       leading hash sign) and fill in the absolute URL to your Drupal installation.    Sure enough, putting $base_url = 'https://example.com'; fixed it.  But why is this necessary? it normally shows in the bottom corner as a sort of 'pie' that fills up as the picture is downloaded, similar to the 'app downloading' pie when viewing a downloading app on the home page/s  prior to this the picture resolution is terrible This week we rolled out a series of changes to  of the question close workflow.  You can read more about the details of these changes .    For context, the overall effort to improve the question close experience will be optimized for Stack Overflow. Given Stack Overflow’s scale, many of the pain points we hear about with question closing and reopening are unique to Stack Overflow and won’t make sense for other network sites. However some  changes are general improvements that should improve usability and guidance overall. Wherever possible, we plan to roll these changes out network wide as well. Any time we roll out a change network wide, we’ll make sure to cross-post here. This first phase is being rolled out to the network and is why I’m posting today.  Let us know if you run into any issues or have questions regarding the network here. While the etiquette of dealing with duplicate answers , there hasn't been a great way to deal with these, "Uh, yeah, I said this, too" types of behavior than the almighty downvote.   It would be nice to have a "Duplicate Answer" option on the flag menu. Five flags auto-deletes the answer, as with any other flag. In order to prevent abuse, the flagged answer would have to have the last owner edit (including original post) be younger than the original answer's original posting by at least 2 minutes.  Also, this ability should be a 5,000+ rep privilege, since we currently have no fanfare of rep from 3,001 to 9,999, and a power like this has a bit more umph than closing a question.  Thoughts? finding rational roots of polynomials What is the fastest way to convert float to int on x86 What is the fastest way you know to convert a floating-point number to an int on an x86 CPU.  Preferrably in C or assembly (that can be in-lined in C) for any combination of the following:   32/64/80-bit float -> 32/64-bit integer   I'm looking for some technique that is faster than to just let the compiler do it. If I'm logged in to a system via SSH, is there a way to copy a file back to my local system without firing up another terminal or screen session and doing scp or something similar or without doing SSH from the remote system back to the local system? Network-wide HTTPS: It's time My intent is to show that a composition of bijections is also a bijection by showing the existence of an inverse.  But my approach requires the associativity of function composition.  Let $f:  X \rightarrow Y, g:  Y \rightarrow Z, h:  Z \rightarrow W$ be functions.  $((f \circ g) \circ h)(x) = h((f \circ g)(x)) = h(g(f(x)))$, and $(f \circ (g \circ h))(x) = (g \circ h)(f(x)) = h(g(f(x)))$.  However, I am having problems in justifying that the two compositions, $(f \circ g) \circ h$ and $f \circ (g \circ h)$, have the same domain and range.  When I consulted ProofWiki, whose link is at the bottom, I got even more confused.  Specifically, for $(f \circ g) \circ h = f \circ (g \circ h)$ to be defined, ProofWiki requires that dom$g =$ codom$f$ and dom$h =$ codom$g$.  First of all, I think that it should be dom$g =$ range$f$ ....  Moreover, as you can see in the example below, you actually have to adjust domains and ranges of $f, g, h$ for the requirement to hold true.  Let $f: \mathbb R \rightarrow \mathbb R$ be $f(x) = 2x$, $g: \mathbb R^+ \rightarrow \mathbb R$ be $g(y) = ln(y)$, $h: \mathbb R \rightarrow \mathbb R$ be $h(z) = z - 10$.   Then $((f \circ g) \circ h)(x) = ln(2x) - 10 = (f \circ (g \circ h))(x)$, with dom$((f \circ g) \circ h) = \mathbb R^+$ = dom$(f \circ (g \circ h))$.  As a result, we need to set dom$f = \mathbb R^+$, range$f = \mathbb R^+$; dom$g$, range$g$, dom$h$, and range$h$ remain the same.  Am I allowed to do that?  This adjustment implies that when we say dom$f = X$, $f$ must be defined for all elements in $X$, but $X$ may not be the entire set of elements for which $f$ is defined. What is the function of "do" in this sentence? Rarely, though, do countries introduce a single reform alone.   What function does do have in this sentence? Find a recurrence relation for the number of ways to arrange $n$ dominoes to fill a $2$ by $n$ checkerboard. I am having trouble with this question, please take a look at it:     Find a recurrence relation for the number of ways to arrange $n$ dominoes to fill a $2$ by $n$ checkerboard.   I have just started reading the topic and it is one of the starting problem. Please help. You can give me some hints, a complete answer is also appreciated.  Thanks Towards the end of , how do I get  $$ \frac{\sqrt{8z + 1} - 1}{2} &lt; w + 1 $$  Here $w = x + y \geq 0, t = (w^2 + w)/2 , z = t + w, x,y \in \mathbb N_{\geq 0}$.  Thanks. Partial sum of rows of Pascal's triangle I'm interested in finding   $$\sum_{k=0}^m \binom{n}{k}, \quad  m&lt;n$$  which form rows of Pascal's triangle. Surely $\sum\limits_{k=0}^n \binom{k}{m}$ using addition formula, but the one above involves hypergeometric functions and I don't know how to approach it.  EDIT: if possible, please don't solve it, just a few hints will do. I was using this command to use a custom crafting table:  /execute @a ~ ~ ~ detect ~ ~-1 ~ dropper 1 {Items:[{id:minecraft:blaze_rod,Slot:1b,Count:1b,Damage:0s},{id:minecraft:blaze_rod,Slot:4b,Count:1b},{id:minecraft:stick,Slot:7b,Count:1b}]} /scoreboard players set @p LSC 1   But I get this error message when I stand on a dropper with these items:     Failed to execute '{Items:[{id:minecraft:blaze_rod,Slot:1b,Count:1b,Damage:0s},{id:minecraft:blaze_rod,Slot:4b,Count:1b},{id:minecraft:stick,Slot:7b,Count:1b}]} /scoreboard players set @p LSC 1' as TrevMCC38   By the way, Im in 16w06a JavaScript equivalent to printf/String.Format I'm looking for a good JavaScript equivalent of the C/PHP printf() or for C#/Java programmers, String.Format() (IFormatProvider for .NET).  My basic requirement is a thousand separator format for numbers for now, but something that handles lots of combinations (including dates) would be good.  I realize Microsoft's  library provides a version of String.Format(), but we don't want the entire overhead of that framework. How to mitigate the Spectre and Meltdown vulnerabilities on Linux systems?