I live in Nepal. I  will be 16 this December but I need to travel to India in September. I will get my citizenship only when I am 16. I neither have passport or voter card. I will be travelling alone. Can I travel? What are the documents required?
I'm a citizen of India and I'm travelling to Nepal by air. Is an Aadhaar Card a valid document used for travelling to Nepal by air?
"the 90s were the best decade ever" or "the 90s was the best decade ever"  "the 90s" and "decade" are both referring to the same singular period of 10 years, so "was" seems to make more sense. "90s were" rolls off the tongue better though. My new laptop came preinstalled with Windows 8. Naively, as I am, I just formatted the harddrive and installed fine old Ubuntu. Now I want to install Windows 8 for dual boot again, but I have no DVD and do download the ISO one needs a product key. That key is not on the back of the laptop anymore but somewhere on the mainboard.  Is there any way to recover the product key from the mainboard using Ubuntu? How can I send mail from an iPhone application I want to send an email from my iPhone application. I have heard that the iOS SDK doesn't have an email API. I don't want to use the following code because it will exit my application:  NSString *url = [NSString stringWithString: @"mailto:foo@example.com?cc=bar@example.com&amp;subject=Greetings%20from%20Cupertino!&amp;body=Wish%20you%20were%20here!"]; [[UIApplication sharedApplication] openURL: [NSURL URLWithString: url]];   So how can I send an email from my app? Negative pressure How is negative pressure created in a fluid system?Isn't it counter intuitive that we are reducing the pressure of a system containing no molecules(zero pressure) to a lower value? Need help understanding "getbits()" method in Chapter 2 of K&R C In chapter 2, the section on bitwise operators (section 2.9), I'm having trouble understanding how one of the sample methods works.  Here's the method provided:  unsigned int getbits(unsigned int x, int p, int n) {     return (x &gt;&gt; (p + 1 - n)) &amp; ~(~0 &lt;&lt; n); }   The idea is that, for the given number x, it will return the n bits starting at position p, counting from the right (with the farthest right bit being position 0). Given the following main() method:  int main(void) {     int x = 0xF994, p = 4, n = 3;     int z = getbits(x, p, n);     printf("getbits(%u (%x), %d, %d) = %u (%X)\n", x, x, p, n, z, z);      return 0; }   The output is:     getbits(63892 (f994), 4, 3) = 5 (5)   I get portions of this, but am having trouble with the "big picture," mostly because of the bits (no pun intended) that I don't understand.  The part I'm specifically having issues with is the complements piece: ~(~0 &lt;&lt; n). I think I get the first part, dealing with x; it's this part (and then the mask) that I'm struggling with -- and how it all comes together to actually retrieve those bits. (Which I've verified it is doing, both with code and checking my results using calc.exe -- thank God it has a binary view!)  Any help? How to create two partitions? Fastest way to determine if an integer's square root is an integer I'm looking for the fastest way to determine if a long value is a perfect square (i.e. its square root is another integer):    I've done it the easy way, by using the built-in  function, but I'm wondering if there is a way to do it faster by restricting yourself to integer-only domain. Maintaining a lookup table is impractical (since there are about 231.5 integers whose square is less than 263).   Here is the very simple and straightforward way I'm doing it now:  public final static boolean isPerfectSquare(long n) {   if (n &lt; 0)     return false;    long tst = (long)(Math.sqrt(n) + 0.5);   return tst*tst == n; }   Note: I'm using this function in many  problems.  So no one else will ever have to maintain this code.  And this kind of micro-optimization could actually make a difference, since part of the challenge is to do every algorithm in less than a minute, and this function will need to be called millions of times in some problems.    I've tried the different solutions to the problem:   After exhaustive testing, I found that adding 0.5 to the result of Math.sqrt() is not necessary, at least not on my machine. The  was faster, but it gave incorrect results for n >= 410881.  However, as suggested by , we can use the FISR hack for n &lt; 410881. Newton's method was a good bit slower than Math.sqrt().  This is probably because Math.sqrt() uses something similar to Newton's Method, but implemented in the hardware so it's much faster than in Java.  Also, Newton's Method still required use of doubles. A modified Newton's method, which used a few tricks so that only integer math was involved, required some hacks to avoid overflow (I want this function to work with all positive 64-bit signed integers), and it was still slower than Math.sqrt(). Binary chop was even slower.  This makes sense because the binary chop will on average require 16 passes to find the square root of a 64-bit number. According to John's tests, using or statements is faster in C++ than using a switch, but in Java and C# there appears to be no difference between or and switch. I also tried making a lookup table (as a private static array of 64 boolean values).  Then instead of either switch or or statement, I would just say if(lookup[(int)(n&amp;0x3F)]) { test } else return false;.  To my surprise, this was (just slightly) slower. This is because . Return a blank when cell reference is blank I am using the following formula in a Google Sheets to calculate the number of days between two dates (dates are in columns G and AL):  =ARRAYFORMULA(if(row(A:A)=1, "Readmission Days", (G:G)-(AL:AL)))   It has to be an array because I am working with a Google Forms and entries are automatically populated into new rows.  The problem is that some of the cells in col AL are blank, so the formula is reading those dates as something else and returning a very large number. Also, when both cells are blank, the formula returns a 0, messing up my data.  How can I include something to ignore blank cells or just return a blank when one or both cell references is blank? I´m not sure how to start with this proof, how can I do it? $$ \limsup ( a_n b_n ) \leqslant \limsup a_n \limsup b_n  $$ I also have to prove, if $ \lim a_n $ exists then: $$ \limsup ( a_n b_n  ) = \limsup a_n \limsup b_n  $$ Help please, it´s not a homework I want to learn. I have an external hard drive and I did something which I shouldn't have done, and I am annoyed that many files are prompting me about Administrator permissions to move a folder.  They are regular files.  How do I reset all the permission on the external hard drive? How to add percent sign to NSString Stack Exchange API too many requests from this IP address As a result, I am able to be understanding and accommodating to the people that I work with, including clients, which I believe is an important asset for a professional to have.   I wanted to make sure it is absolutely known that I mean to acknowledge clients as a class of people I can work with. Is this the right way to include it with commas? Delete with Join in MySQL Here is the script to create my tables:   CREATE TABLE clients (    client_i INT(11),    PRIMARY KEY (client_id) ); CREATE TABLE projects (    project_id INT(11) UNSIGNED,    client_id INT(11) UNSIGNED,    PRIMARY KEY (project_id) ); CREATE TABLE posts (    post_id INT(11) UNSIGNED,    project_id INT(11) UNSIGNED,    PRIMARY KEY (post_id) );   In my PHP code, when deleting a client, I want to delete all projects posts:  DELETE  FROM posts INNER JOIN projects ON projects.project_id = posts.project_id WHERE projects.client_id = :client_id;   The posts table does not have a foreign key client_id, only project_id. I want to delete the posts in projects that have the passed client_id.  This is not working right now because no posts are deleted. How many numbers are in the Fibonacci sequence below a given threshold? Assuming I'm asked to generate Fibonacci numbers up to N, how many numbers will I generate? I'm looking for the count of Fibonacci numbers up to N, not the Nth number.  So, as an example, if I generate Fibonacci numbers up to 25, I will generate:   1, 1, 2, 3, 5, 8, 13, 21 that's 8 numbers   How do I calculate this mathematically for an arbitrary "n"? Determining the Actual Server Create Date I am interested in determining the ages of all 70+ my servers. I would like to create a growth graph showing when servers and databases were added to the environment either/both monthly or annually. I executed the following query using the SSMS multi-query feature with only partial success.  SELECT [name], create_date FROM sys.databases   It's partial success because the master and model databases return with a date of 'April 8, 2003' when I know that I created some of these servers during the past couple years.  I refresh databases from one server to another several times a week, which appears to be causing issues with the database create date.   Is there a simple method to determine the actual create date for both servers and databases? I have some difficulties with a task in algebra. I guess it's trivial and really easy but I can't figure out how to solve it.  I have a set $G$ and a binary operation on it, let it be $\circ$. I have that the operation is associative and that the equations $a\circ x = b$ and $x\circ a = b$ have unique solutions. I have to prove that $(G, \circ)$ is a group.  I already have that the operation is binary and associative, so I have to prove that there is unique identity element and unique inverse element and it will come from the equations, but how exactly? What are reserved filenames for various platforms? Highlight text in code listing while also keeping syntax highlighting I’m using the listings package for code listings. Now I try to highlight some part of the code using \hl from the soul package.  Here’s an example of a resulting query where the injected part of a SQL injection should be highlighted:  \begin{lstlisting}[escapechar=@,language=SQL] SELECT name, password FROM users WHERE name='@\hl{' UNION SELECT "10", 1 \#}@'; \end{lstlisting}   But inside the highlighted part the SQL syntax highlighting is not applied.  So I tried to use \lstlinline for the code part inside \hl as well but it didn’t work:  \begin{lstlisting}[escapechar=@,language=SQL] SELECT name, password FROM users WHERE name='@\hl{\lstinline[language=SQL]$' UNION SELECT "10", 1 #$}@'; \end{lstlisting}   Although this \lstinline part works outside the lstlisting block, it doesn’t work inside it. The error I get for that particular line is:     Extra }, or forgotten \endgroup.   Maybe I’m just missing just some special syntax to get this working. Or is it not possible at all to get proper syntax highlighting for the \hl-highlighted part as well? Adapt BibTeX style to give all initials I'm using a modification of the plainyr BibTeX style. Although my bib-file contains all initials for some authors (e.g. B.D. McKay), I end up with just the first initial in my document (e.g. B. McKay). I thought about editing the BibTeX style myself, but after seeing the code, I decided against it. Maybe there are some people who are more knowledgeable in this area of expertise.  I want my final document to include the initials for all the names, and not just those of the first name.  This is the relevant code of the BibTeX style, or at least, I think it is the relevant code.  FUNCTION {format.names} { 's :=   #1 'nameptr :=   s num.names$ 'numnames :=   numnames 'namesleft :=     { namesleft #0 &gt; }     { s nameptr "{f.~}{vv~}{ll}{, jj}" format.name$ 't :=       nameptr #1 &gt;         { namesleft #1 &gt;             { ", " * t * }             { numnames #2 &gt;                 { "," * }                 'skip$               if$               t "others" =                 { " et~al." * }                 { " and " * t * }               if$             }           if$         }         't       if$       nameptr #1 + 'nameptr :=       namesleft #1 - 'namesleft :=     }   while$ }