Is there a way to connect Azure to AWS with Site-to-site VPN ?  All guides and resources I have found in internet so far are using a VM that runs ipsec software (openswan/strongswan/RRAS), but I would like to explore native options first as that seem more elegant.  Note: "" may be seen as a duplicate, but I don't feel there is a satisfactory answer there. I could not get connection working using suggestions in that thread.
As I found solutions on making site-to-site VPN between Azure and AWS using a software VPN server, I'm asking myself if it's possible to connect the VPN gateways (Azure VNET / AWS VPC) directly.  Is there a limitation that forbids it ?
Multiple object instances represented by two slightly shifted rectangles In a software diagram, I'd like to be able to represent multiple instances of an object by two rectangles with one of them slightly shifted. I recently learned about the pic style so I'm using it with two nodes to achieve what I want.  The following example does work, but I'd like to know if I can do the same without using the fill=white. My hack kind of assumes the entire picture background is white and that may not always hold. I'd like to be able to crop the unwanted picture part out.  \documentclass[crop,border=3pt]{standalone}  \usepackage{pgf,tikz} \usetikzlibrary{positioning}  \begin{document} \begin{tikzpicture}[     every node/.style={font=\sffamily\small},     block/.style={         rectangle, draw, align=center, minimum width=2cm,         minimum height=1.4cm, font=\sffamily\small     },     multinode/.pic={         \node [block] at (0.1,0.1) {};         \node [block, \tikzpictextoptions, fill=white] at (0,0) {\tikzpictext};% &lt;-- FILL WHITE     } ]     \node [block] (STG) at (2,5) {single\\instance};     \pic [pic text={multi\\instance}] at (5,5) {multinode}; \end{tikzpicture} \end{document}   The following images show first one version with the fill white hack, and then one version without it. The  (ESC), states that for every natural number $n \geq 2$, there exists a set of natural numbers $a, b, c$ , such that the following equation is satisfied:  $$\frac{4}{n}=\frac{1}{a}+\frac{1}{b}+\frac{1}{c}\tag{1}$$  The basic approach to solving this problem outlined by Mordell [Ref1] is described below  By defining $t$ and $m$ as positive integers greater than zero and $q$ a positive integer greater than one we can observe that  a) There is always a solution for even $n$, since if $n=2^qt$ we have the trivial solution $$\frac{4}{4t}=\frac{1}{t}$$  In the remaining case $n=2(2t+1)$, a solution in the form of two Egyptian fractions can always be found  e.g. $$\frac{4}{2(2t+1)}=\frac{2}{2t+1}=\frac{1}{t+1}+\frac{1}{(t+1)(2t+1)}$$  b) If $(1)$ is a solution for some particular prime $n$ then all composite numbers $mn$ divisible by $n$ are also solutions, thus  $$\frac{4}{mn}=\frac{1}{ma}+\frac{1}{mb}+\frac{1}{mc}$$  will also be a solution. This means that we can simplify the analysis to the cases where $n$ is a prime greater than 2.  Using Mordell's approach we have just shown that we only need to consider the cases where $n$ is prime and where $n \equiv 1 \pmod{2} \;\;[meaning \;\;n=2t+1]$  The argument continues...  Mordell goes on to show in turn that the search can be reduced further to the cases when $$n \equiv 1 \pmod{4} \;\;[meaning \;numbers \;\;n=4t+1]$$ $$n \equiv 1 \pmod{8} \;\;[meaning \;numbers \;\;n=8t+1]$$ $$n \equiv 1 \pmod{3} \;\;[meaning \;numbers \;\;n=3t+1]$$ $$n \equiv 1,2,4 \pmod{7} \;\;[meaning \;numbers \;\;n=7t+1,n=7t+2 \;or\;n=7t+4 ]$$ $$n \equiv 1,4 \pmod{5}  \;\;[meaning \;numbers \;\; n=5t+1 \;or\;n=5t+4]$$  Assembling these results together, Mordell showed that the conjecture can be proved in this context except for the cases when $$n \equiv 1,11^2,13^2,17^2,19^2,23^2 \pmod{840}$$  Mordell stated that since the first prime meeting this condition is 1009, this is proof that the conjecture holds for $n&lt;1009$.  This basic approach can be pursued further. Other workers have shown that the conjecture holds for much higher values of $n$ using similar methods as can be seen on the above Wikipedia page.   Note that other intermediate results can be constructed from the above congruence's, e.g. $n \equiv 1 \pmod{24}$.  The question is:  Are there any other elementary approaches to solving this problem than the one outlined by Mordell (and described above)?  [Ref1] Louis J. Mordell (1969) Diophantine Equations, Academic Press, London, pp. 287-290. How to show that if $\phi(n)$ equals to n itself, then n must be 1? Shared email on 2 Facebook accounts is stopping access to both accounts My husband wanted me to set up a Facebook account for him and I accidentally used our shared email address, which is set against my own account.  Since then, neither of us has been able to log in, so I can't alter any settings.  Can anyone advise how to resolve this please? Which package can be used to write BNF grammars? Prove by Double Counting Method $\sum\limits_{k = 0}^m \binom{m}{k}\binom{n}{r + k} = \binom{m + n}{m + r}$ Show by combinatorial arguments that:   $$\sum_{k = 0}^m \binom{m}{k}\binom{n}{r + k} = \binom{m + n}{m + r}$$  Hello ,  I want to prove this argument by double counting method, i kinda have an idea of proving by comb args. but not by double counting... Can someone give any clues or ideas? thanks :) How can I remap a keyboard key? There are a few examples of pairs of words ending with -ee/-er like employee and employer or advisee and adviser. What I was curious about is if there was any rule that would describe the relationship of the objects in a pair like this and situations when it's appropriate to create a counterpart for a given word.   I'll give you an example. It's relatively common in the computer programming world to see the word dragee, which describes an object that is being dragged with a mouse. I understand that this is a relatively new word and could not be found in any dictionary (I've tried). Is that acceptable to make up words like this one or is it just bad English? Probability associated with experiencing all outcomes Assuming I have no infinite scroll or anything else going on in my theme: Is there a way to enqueue my custom Gutenberg block styles and scripts so they are only (lazy) loaded in the front-end when the block is really used? Something like is_active_widget, just for blocks?  If I enqueue them inside a enqueue_block_assets function they're added to any site.  On github, I found this  , but it sounds like it's more on bundling than conditional load, so I still hope they didn't leave that optimization opportunity out - otherwise any other site will soon be junked with 20 additional scripts from numerous Gutenberg block plugins people install and only use once on a page (think of large image gallery block scripts for example).  Thanks &amp; Regards! I have installed nodeJS on Ubuntu with following code   sudo apt-get install nodejs   Since I am a new user for ubuntu I also ran this code too  sudo apt-get install npm   Now when I type    nodejs --version   It shows   v0.6.19   I checked and saw latest nodeJS version is 0.10.26   How can I update my version of nodeJS to 0.10.26?  I tried with    sudo apt-get install &lt;packagename&gt;  sudo apt-get install --only-upgrade &lt;packagename&gt;   but no luck. How do I convert between big-endian and little-endian values in C++? How do I convert between big-endian and little-endian values in C++? For clarity, I have to translate binary data (double-precision floating point values and 32-bit and 64-bit integers) from one CPU architecture to another.  This doesn't involve networking, so ntoh() and similar functions won't work here.  Note: The answer I accepted applies directly to compilers I'm targeting (which is why I chose it).  However, there are other very good, more portable answers here. Keep getting error 'list' object has no attribute 'split' From SL Loney Trigonometry:     Prove that   $$r^2+r_1^2+r_2^2+r_3^2=16R^2-a^2-b^2-c^2$$   for a triangle with sides $a$, $b$, $c$, circumradius $R$, inradius $r$, and exradii $r_1$, $r_2$, $r_3$.   This one is a really dirty question.   I have tried a lot of stuff like $r=4R\times \Pi(\sin\frac{A}{2}$) and  $r_1=4R\times\sin\frac{A}{2}\cos\frac{B}2\cos\frac{C}2$ etc..  There are other ways like $-r+r_1+r_2+r_3=4R$,  but all these are way too cumbersome or clumsy.   Anything more intuitive? What is the difference between an Intel i7 and a Xeon quad core processor? I know the  processors have been around for a long time and are mostly used in servers, but I am curious, why do people not use the Xeons in a high performance desktop?    As far as I know about the best desktop processor out there now is the  line. The i7's and Xeons are both quad-core processors, what is the main difference in these? I just saw that the MacBook Pro's are using the quad core Xeons instead of the i7's. Stuck at 0% [waiting for headers] On googling this error it seems that a lot of people are having this issue.  apt-get upgrade hangs at 0% [waiting for headers] apt-get install apache2 hangs at 0% [waiting for headers]. Some apt-get commands are working, but only certain packages.  Any ideas? I don't think this is an issue with slow repos because I've had it up for a long while and it hasn't budged from 0%. I have edited sources.list but I removed the lines I added when this issue presented itself and it hasn't made a difference.  Any clues would be really useful. A problem about function N How were bullets able to dent Captain America's Shield? Just after Captain America's shield was introduced in Captain America: The First Avenger, Peggy Carter shot few bullets at it which created few minor distortions on it.                                  From  page of Marvel.Wikia,     Proto-Adamantium   This is the original Adamantium created by Dr. MacLain. Proto-Adamantium is the official name for the metal that makes up Captain America's Shield. It has never been recreated and is the absolute most invulnerable item in all of existence.    From  page of Marvel.Wikia:     The true shield was once slightly dented by an enraged Odinforce empowered Thor, using Mjolnir, but he later reconciled and pounded out the small dent.    How were few bullets able to dent Captain America's shield then? Let I and J be ideals of a ring R. Show by example that the set of products {xy | x ∈ I, y ∈ J} need not be an ideal Let I and J be ideals of a ring R. Show by example that the set of products {xy | x ∈ I, y ∈ J} need not be an ideal, but that the set of finite sums of products of elements of I and J is an ideal. This ideal is called the product ideal, and is denoted by IJ.   I want to check if my work on the first part makes any sense. I am not sure if I am picking the right example.  If I let R = Z and I = (2) and J = (3) then I has multiples of 2, and J has multiples of 3  6 will divide the product IJ if we add 2 and 3 though we get 5 in IJ, but I am not sure if 5 Divides IJ. Why is integration so much harder than differentiation?