I was recently issued a B1/B2 visa with an annotation that i am going there to sit for an exam on 5th feb in Atlanta.  my visa has an issue date of october. I am planning on going to the US in early January. Does my port of entry have to be Atlanta or may i go to some other place like chicago and later go to atlanta for my exam .
I am a girl in my early twenties traveling to USA from India and in my visa application I have provided the contact address for a relative in San Francisco, and their invitation letter. I would like to visit LA first. Will I face problems during immigration if I land in LA (with an immediate on wards ticket to SF)? I dont plan to get on the flight from LA to SFO.  Initially I was planning to fly to SFO from India and then fly to LA immediately after completing immigration at SFO airport.
Optimize table layout Is the function Riemann integrable? If yes, obtain the value of $\int_0^1f(x) \ dx$      $f(x) = \begin{cases} \frac {1}{n},  &amp; \frac{1}{n+1}&lt;x\le\frac{1}{n}\\ 0, &amp; x=0 \end{cases}$   My attempt  $f$ is bounded and monotonically increasing on $[0,1]$. Also, $f$ has infinite discontinuities but only one limit point. Therefore $f$ is Riemann integrable. Now, to calculate the integration  $\int_0^1f(x) \ dx=\int_{1/2}^{1}1 \ dx + \int_{1/3}^{1/2}\frac{1}{2} \ dx + \int_{1/4}^{1/3}\frac{1}{3} \ dx+...$  $=\sum_{n=1}^\infty \frac{1}{n^2}-\frac{1}{n}+\frac{1}{n+1}$  How do I proceed from here? How do I calculate these summations? I know $\sum \frac{1}{n}$ is $\log 2$, but not the other two summations. No notification (+15) for accepted answer Yesterday my answer was accepted, but I got no notification in top bar, moreover, top bar still shows that I earned 45 reps  while reputation tab shows right 60 rep.  Update: July, 11 Again having this problem: In the dropdown:  In the rep tab:  You see, first down votes in the drop down are missing. Beamer - Color of header foreground with AnnArbor theme I use beamer with the theme AnnArbor and colortheme whale.  I tried to use:  \setbeamercolor{section in head/foot}{fg=white, bg=blue}   or  \setbeamercolor{palette tertiary}{fg=white, bg=blue}   But for an unknown reason, the bg works but not the fg... The sections names stay black in the header.    EDIT : the problem comes from the hyperref package.  This code works well :  \documentclass{beamer} \usetheme{AnnArbor} \usecolortheme{whale} \setbeamercolor{frametitle}{fg=white,bg=blue}  \begin{document}     \section{Test 1}     \subsection{Test 1.1}     \begin{frame}         \frametitle{Test}     \end{frame} \end{document}   Whereas this one doesn't works :  \documentclass{beamer} \usetheme{AnnArbor} \usecolortheme{whale} \setbeamercolor{frametitle}{fg=white,bg=blue} \usepackage{hyperref} \hypersetup{     colorlinks=true,     linkcolor=black,     urlcolor=blue,     citecolor=gray,     frenchlinks=false,     pdfborder={0 0 0} }  \begin{document}     \section{Test 1}     \subsection{Test 1.1}     \begin{frame}         \frametitle{Test}     \end{frame} \end{document}   And that's pretty normal because of this line :  linkcolor=black, Show that if $p$ is prime then $\Bbb Z_p$ is a field Check my proof please.  Let $\Bbb Z_p:=\Bbb Z/p\Bbb Z$ be the quotient ring modulo $p$. I want to prove that if $p$ is prime then $\Bbb Z_p$ is a field.  Known facts about the quotient rings of the kind $\Bbb Z_n$ (I dont list all the characteristics of a ring, just some ones):   They are commutative rings with unity. $[0]=[n]$ is the identity of addition or zero. Then $[n]+[a]=[a]$ and $[n]\cdot[a]=[n]$ for all $[a]\in\Bbb Z_n$. $[1]$ is the multiplicative identity or unity. Then $[1]\cdot[a]=[a]$ for all $[a]\in\Bbb Z_n$. The addition is defined as $[a]+[b]=[a+b]$, and the multiplication is defined as $[a]\cdot[b]=[ab]$. $[a]=[b]$ means that exists $z\in\Bbb Z$ such that $a=b+nz$. $|\Bbb Z_p|=p$.   A ring $\Bbb Z_p$ dont have zero divisors, i.e. doesnt exist $[a],[b]\in\Bbb Z_p$ distinct of $[p]$ such that $[a]\cdot[b]=[p]$. Proof by contradiction: suppose that exists such $[a],[b]$ distinct of $[p]$ that are zero divisors. Then exist some $z_j\in\Bbb Z$ such that:  $$(a+pz_1)(b+pz_2)=pz_3\iff ab+pz_4=pz_3\iff ab=pz_5$$  but this is a contradiction with the assumption that $a,b\neq p$ and $p$ prime, so dont exist divisors of zero on any $\Bbb Z_p$.$\Box$  For any $[a]\in\Bbb Z_p$ distinct of $[p]$ exist $[b]$ such that $[a][b]=[1]$. Because $\Bbb Z_p$ dont have zero divisors and is finite for some $[a]\neq[p]$ we have that if $[b]\neq[c]$ then $[a][b]\neq[a][c]$. Proof by contradiction: if $[a][b]=[a][c]$ in the above conditions then  $$[a][c]=[ac]=[ab]=[a][b]\iff ac+pz_1=ab+pz_2\iff a(c-b)=pz_3$$  for some $z_j\in\Bbb Z$. But $pz_3\in[p]$, then $[a][c-b]=[p]$ but because there are no zero divisors in $\Bbb Z_p$ then or $[a]=[p]$ or $[c-b]=[p]$ what contradicts the above conditions.$\Box$  Because $[a][b]\neq[a][c]$ for $[a]\neq[p]$ and $[b]\neq[c]$ then for any $[a]\neq[p]$ we have that  $$[a]\cdot\Bbb Z_p=\Bbb Z_p\implies \exists [b]\in\Bbb Z_p:[a][b]=[1]$$  In other words: every element of $\Bbb Z_p$ but $[p]$ have a multiplicative inverse as stated above.$\Box$  Because $\Bbb Z_p$ is a commutative ring with $[1]\neq[0]$ and have multiplicative inverse for all their elements but $[p]=[0]$ then $\Bbb Z_p$ is a field.$\Box$ Being a fairly new user something I don't seem to be able to locate is information on whether small edits to the title are considered as trivial edits. I see the usual recommendation when suggesting an edit is:     Avoid trivial, tiny one-letter edits unless absolutely necessary.   I can see the logic in that for most cases, but for example I just read a question with a title containing "Andriod" which would be trivial in one way but also affect the ability of users to locate the question using both the site and external search engines. Would it be frowned upon to suggest an edit for those cases? Some of code I read in trigger is like this    for(account a: [select id  from account where id in: mapAccount.keySet()]) {     //code      }    some are like   List&lt;Account&gt; listAccount = [select id  from account where id in: mapAccount.keySet()];   for(Account a: listAccount ){   //coode   }   Are those same from performance view?which one is better? How to Install Octave in El Capitan? How can I check the SMART status of a SSD or HDD on current versions of Ubuntu 14.04 through 20.04? In my experimentation, I've used only BJTs as switches (for turning on and off things like LEDs and such) for my MCU outputs. I've been repeatedly told, however, that N-channel enhancement-mode MOSFETs are a better choice for switches (see  and , for examples), but I'm not sure I understand why. I do know that a MOSFET wastes no current on the gate, where a BJT's base does, but this is not an issue for me, as I'm not running on batteries. A MOSFET also requires no resistor in series with the gate, but generally DOES require a pull-down resistor so the gate doesn't float when the MCU is rebooted (right?). No reduction in parts count, then. There doesn't seem to be a great surplus of logic-level MOSFETs that can switch the current that cheap BJTs can (~600-800mA for a 2N2222, for example), and the ones that do exist (TN0702, for example) are hard to find and significantly more expensive. When is a MOSFET more appropriate than a BJT? Why am I continually being told that I should be using MOSFETs? What is the meaning of p values and t values in statistical tests? Mysql Pivot rows into dynamic columns with unknown number of columns I have an output of a query as follows:  bid  | code | amount        | ----------------------------- 2915 | BF   |   -10700.00   | 2915 | YQ   |   -300.00     | 2915 | YR   |   0.00        | 2915 | YM   |   0.00        | 2915 | WO   |   -153.00     | 2915 | IN   |   -329.00     | 2915 | K3   |   0.00        | 2915 | CUTE |   -50.00      | -----------------------------   I need to convert the values in code column to individual columns with column name as corresponding code and amount shall be the value.  bid  | BF       | YQ     | ... | CUTE  | ---------------------------------------- 2915 | -10700.00| -300.00| ... | -50.00|   The issue is that the result of my initial query has dynamic codes and hence need to generate columns accordingly.  Already tried the following logic but couldn't achieve the goal:   , ,   All the above links use some expression or the other to generate the columns.   My original resulting rows are result of simple select on multiple joined tables, and has no calculation or expression scope.  Kindly suggest some pointer or hint on how to achieve this.  Many thanks in advance. Find a recurrence relation for the number of ternary strings of length n that do not contain two consecutive 0s or two consecutive 1s. Note: Problem from "Kenneth Rosen's DM and it's applications" and solution from "Students solution guide for use with ... applications"  Let P(n) be the number of strings not containg two containing two consecutive zeros or two consecutive ones.  I got the answer  P(n)=P(n-1)+2P(n-2)+2P(n-3)+...+2P(0) +2  but then the book says the sequence also satisfies the recurrence relation  P(n)=2P(n-1)+P(n-2). I am not able to understand this part. How to "find and replace" in a PDF on OS X? Can I legally downgrade from Win 7 64 bits to Win 7 32 bits? Possible Duplicate:          Tired of the unstable Win 7 64bit I got when I purchased my laptop (it was impossible to find a powerful laptop with Win 7 32 bits).  Can I legally downgrade from Win 7 64 bits to Win 7 32 bits? The key/activation will work?    Details: Everybody comments about the stability of Win 64.  Well, I made a mistake. Is not that Win 64 is unstable (it never crashed). It just works very poor. It feels choppy. Compiling a large program (on an old AMD desktop PC) takes 1.5 seconds on Win 32. The same program compiles on Win 64 in 4-5 seconds in this new and "powerful" laptop. All programs are less responsive. MySQL Access denied for user 'root'@'localhost' Pointwise convergence of $h_n(x) = x^{1+\frac{1}{2n-1}}$ Okay, maybe I'm missing something obvious but consider $h_n(x) = x^{ 1+ \frac{1}{2n-1}}$ on the set $[-1,1]$. Now consider a fixed $x \in [-1,1]$, we have:  $$\lim_{n\rightarrow \infty} h_n(x) = x \lim_{n \rightarrow \infty} x^\frac{1}{2n-1} = x$$  But my book says it's $|x|$? Why? https:// search results appearing on Google for purely http:// site This is what happens when I launch the terminal  There was an error creating a child process  So I have been using the Ubuntu terminal on my Raspberry Pi 4 model B 8 GB with Ubuntu for a couple moths when Ubuntu 20.10 came out for the Pi. But now I have a problem where I launch the terminal and it gives that message. I have gone for alternatives and tried to fix it but all the solutions were outdated or they were on a different distro. Also the Ubuntu commands did not fix the issue because it only triggers upon a certain command. Subset of a finite set is finite We define $A$ to be a finite set if there is a bijection between $A$ and a set of the form $\{0,\ldots,n-1\}$ for some $n\in\mathbb N$.  How can we prove that a subset of a finite set is finite? It is of course sufficient to show that for a subset of $\{0,\ldots,n-1\}$. But how do I do that?