I am a UK citizen, Can I re-enter South Africa for a second time after returning home to the UK, if the second visit to South Africa is still within the first visit's allocated 90 day time limit? Will they let me back into the country on this 1st visa or will I be re-issued a new visa, as I have returned to my home country in between? I can't seem to find any info about this anywhere about returning home and then re-entering South Africa again after a couple of weeks. I've already booked my return flight to SA from UK but panicking slightly that they'll let me back into the country...Im just going back for 2 weeks Thanks
How many times can an Australian leave and re-enter South Africa (90 days at a time without a visa) in a year, and do they need to be out of the country for a certain period of time before they re-enter?  I want to be in South Africa for as long as I can, however as an Australian without a visa I can only stay for 90 days at a time. What I would like to do is simply leave South Africa and go to another country in Africa for a few days, before returning with a new 90 day allowance.    Is this possible, or must I wait a certain period before re-entering South Africa/is there a limit to the amount of times I can do this in one year?
Specifying geography with cardinal directions So here in America we are in "the West".  Would this become "the Western world" or "the western world? "  I'll assume the same applies to "the East" (Asia). Do GTA 5 saves back-up to a cloud service? For GTA 5 (on PC), if I have a save file, will it automatically back-up to either the Steam or Rockstar cloud, or do I have to save it manually? If it have to save it manually, will you please provide the default directory for saves? Is there any reason to not complete the game? Would there be anything in Skyrim where you wouldn't want to complete the main story? (Yes, I know the game continues after that)  Like something you can no longer access, or do after beating the game? How can I get the node id the comment is attached to in hook_comment_insert?  I tried the following code:  function mymodule_comment_insert(Drupal\Core\Entity\EntityInterface $entity) {   if ($entity-&gt;bundle() == 'comment_custom' &amp;&amp; $entity-&gt;get('entity_type')-&gt;value == 'node') {      // Below returns empty, because "$entity-&gt;get('entity_id')-&gt;value" is empty.     $node = Node::load($entity-&gt;get('entity_id')-&gt;value);      // No luck with this one too.     $node = \Drupal::routeMatch()-&gt;getParameter('node');    } } How do I read the history of my reputation? Which way does the scale tip? Can I nohup/screen an already-started process? I'm doing some test-runs of long-running data migration scripts, over SSH. Let's say I start running a script around 4 PM; now, 6 PM rolls around, and I'm cursing myself for not doing this all in screen.  Is there any way to "retroactively" nohup a process, or do I need to leave my computer online all night? If it's not possible to attach screen to/nohup a process I've already started, then why? Something to do with how parent/child proceses interact? (I won't accept a "no" answer that doesn't at least address the question of 'why' -- sorry ;) ) Modifying agsm.bst package bibliography output I would like to change the URL output from:  URL: the html link  into:  [Online]URL: [Accessed on]  I am using:  \usepackage[comma]{natbib} \bibliographystyle{agsm} For all infinite cardinals $\kappa, \ (\kappa \times \kappa, <_{cw}) \cong (\kappa, \in).$ I don't understand the proof to the a/m claim. How we know that $\eta &lt; \kappa$ and $(\alpha,\beta)&lt;_{cw} (0, \eta) $ and hence $h: \mu \to \eta \times \eta$ is injective? Appreciate if anyone could advise.  Here is an excerpt of the proof:  For an infinite ordinal $\kappa,$ the canonical well-ordering of $\kappa \times \kappa,$ denoted by $&lt;_{cw}$ is defined as follows: $(\alpha_1, \beta_1)&lt;_{cw} &lt; (\alpha_2, \beta_2)$ iff either one of the following holds.  $(1): \max\{\alpha_1,\beta_1\} &lt; \max\{\alpha_2,\beta_2\}$  $(2): \max\{\alpha_1,\beta_1\} =\max\{\alpha_2,\beta_2\}$ and $\alpha_1&lt;\alpha_2$   $(3): \max\{\alpha_1,\beta_1\} =\max\{\alpha_2,\beta_2\}$ and $\alpha_1 = \alpha_2$ and $\beta_1 &lt; \beta_2.$  Claim: For all infinite cardinals $\kappa, (\kappa \times \kappa, &lt;_{cw}) \cong (\kappa, \in).$  Proof: (It has been show that it is true for $\kappa = \omega$) Assume there is a counterexample  $\kappa.$ Let $A= \{\lambda \in \kappa + 1| \lambda\geq \omega \ is \ a \ cardinal \ and \ (\lambda \times \lambda, &lt;_{cw}) \not\cong (\lambda, \in)\}.$ Then, $\kappa \in A.$ Let $\mu$ be least element of $A.$ Thus, $\mu &gt; \omega$ and for all $\lambda,$ if $\omega \leq \lambda &lt; \mu$ and $\lambda$ is a cardinal, then $(\lambda \times \lambda, &lt;_{cw}) \cong (\lambda, \in).$  By Comparability theorem, $(\mu, \in)$ is isomorphic to initial segment of $(\mu \times \mu, &lt;_{cw})$ since $|\mu \times \mu| \geq \mu$ and $\mu$ is cardinal. Let $(\alpha, \beta) \in \mu \times \mu$ such that $(\mu, \in)$ is isomorphic to initial segment of $(\mu \times \mu, &lt;_{cw})$ given by $(\alpha, \beta).$ Let $h$ be the isomorphism. Let $\eta= \max\{\alpha, \beta\}+ \omega.$ Then $\eta &lt; \kappa$ and $(\alpha,\beta)&lt;_{cw} (0, \eta).$ HENCE, $h: \mu \to \eta \times \eta$ is injective. Can an Animagus take the form of any animal? Similar to my old question about  are there any limits to the animal forms an Animagus can be?     We know that the animal form can be much smaller than human (cat, rat, beetle) so I don't think size is a factor.   I'm not aware of any Animagus who transforms into a magical creature (e.g. unicorn or phoenix) so maybe those aren't possible.   Ultimately, what I'd like to know is whether there could be a T-Rex Animagus... (prompted by ) Where can I download Windows 7 (legally from Microsoft)? I just bought a serial for Windows 7 on-line from the Microsoft store (the most painful shopping experience EVER!). I selected that I wanted to download my version of Windows 7 after purchase. After payment, I have listed a Product Key but no download link in sight.   Where do I download my Windows 7 ISO to burn to disk?  Note: I'm not a Technet or MSDN subscriber. Is there a term for coining a phrase for a word that already exists? I am just a high school student, and I haven't seen much in mathematics (calculus and abstract algebra).  Mathematics is a system of axioms which you choose yourself for a set of undefined entities, such that those entities satisfy certain basic rules you laid down in the first place on your own.  Now using these laid-down rules and a set of other rules for a subject called logic which was established similarly, you define certain quantities and name them using the undefined entities and then go on to prove certain statements called theorems.  Now what is a proof exactly? Suppose in an exam, I am asked to prove Pythagoras' theorem. Then I prove it using only one certain system of axioms and logic. It isn't proved in all the axiom-systems in which it could possibly hold true, and what stops me from making another set of axioms that have Pythagoras' theorem as an axiom, and then just state in my system/exam "this is an axiom, hence can't be proven".  EDIT : How is the term "wrong" defined in mathematics then ? You can say that proving fermat's last theorem using the number-theory axioms was a difficult task but then it can be taken as an axiom in another set of axioms .  Is mathematics as rigorous and as thought-through as it is believed and expected to be ? It seems to me that there many loopholes in problems as well as the subject in-itself, but there is a false backbone of rigour that seems true until you start questioning the very fundamentals . Wirtinger Inequality: $\int_0^1 f'^2 \geq \pi^2 \int_0^1 f^2 $ I have a  basic question  Let $f$ be a $\mathcal{C}^1$  map  from  $[0,1]$ into $\mathbb{R}$ vanishing in $0$ and $1$. I want to prove that   $$\int_0^1 f'^2 \geq \pi^2 \int_0^1 f^2 $$  and to see when we have equality. How can I pad an integer with zeros on the left? How do you left pad an int with zeros when converting to a String in java?  I'm basically looking to pad out integers up to 9999 with leading zeros (e.g. 1 = 0001). In preparation for the eventual deployment of full HTTPS support on Stack Exchange, and also to make the currently available "alpha" HTTPS support more usable, all links from Stack Exchange sites to other Stack Exchange sites should be .  Currently, at least the following places still feature links with explicit http: protocol prefixes:   the page footer, the "Hot Network Questions" and "Community Bulletin" modules in the sidebar,  (the site switcher menu is OK, though),   and, of course,   lots and lots of user-supplied links in post and comment content.   I've posted this feature request with the intent to provide a single central place for tracking these issues, rather than having them scattered across multiple meta threads.  If you find more places on SE where protocol-relative links should be used, please report them below.  I fully expect this request, in its full sense, to be treated as  for the time being; however, these issues do need to be fixed at some point before our HTTPS support is ready for "prime time".  Ps. Yes, the next release of  (v1.10) is going to include a general client-side fix for most of these issues.  In the mean time, the  plugin effectively provides the same functionality, and much more besides. Why do I get TypeError: can't multiply sequence by non-int of type 'float'? I am typing to get a sale amount (by input) to be multiplied by a defined sales tax (0.08) and then have it print the total amount (sales tax times sale amount).  I run into this error. Anyone know what could be wrong or have any suggestions?   salesAmount = raw_input (["Insert sale amount here \n"]) ['Insert sale amount here \n']20.99 &gt;&gt;&gt; salesTax = 0.08 &gt;&gt;&gt; totalAmount = salesAmount * salesTax  Traceback (most recent call last):   File "&lt;pyshell#57&gt;", line 1, in &lt;module&gt;     totalAmount = salesAmount * salesTax TypeError: can't multiply sequence by non-int of type 'float' Serana disappeared during dawnguard questline. Are the rationals a closed or open set in $\mathbb{R}$? I want to utilize beamer's \uncover command within ChemFig's reaction scheme environment, i.e.:  \schemestart     \chemname[-1ex]{\chemfig[][scale=1]{*5(-=(-=[:-60]O)-O-=)}}{Furfural}     \uncover&lt;2-&gt;{         \arrow(furfural--mf){-&gt;[*{0}HDO][]}         \chemname[-1ex]{\chemfig{*5(-=(-)-O-=)}}{2-Methylfuran}     } \schemestop   However, this results in numerous "undefined control sequence" errors.  Is there a way to use beamer's \uncover command within ChemFig?  Here is a full MWE:  \documentclass[10pt]{beamer} \usepackage{chemfig}  \begin{document}  \begin{frame} \frametitle{Stuff}  \schemestart     \chemname[0ex]{\chemfig[][scale=1]{*5(-=(-=[:-60]O)-O-=)}}{Furfural}     \uncover&lt;2-&gt;{         \arrow(furfural--mf){-&gt;[*{0}\textbf{HDO}][]}         \chemname[0ex]{\chemfig{*5(-=(-)-O-=)}}{2-Methylfuran}     } \schemestop  \end{frame}  \end{document}