I received UK Visa refusal due to deposits I made in my account just before taking bank statement. Need advice fro applying again
UK Visa Refusal: Provenance of funds/parking
Solve recurrence relation $a_n = 3 a_{n - 3} + a_{n-1} + 2 n$ I am not able to solve the above recurrence relation which involves $n$. The initial conditions $a_0 = 1, a_1 = 2, a_2 = 3$, for $n \geq 0$. Please try to give closed form in terms of arbitrary $a_i \geq 1 $ for $i \geq 0$ enclosing a lstlisting environment inside my own environment using matlab-prettifier I've just started using matlab-prettifier.    Since the line \begin{lstlisting}[style=Matlab-editor] is a lot to type, I created my own environment:  \newenvironment{myMP}      {\begin{samepage}\begin{lstlisting}[style=Matlab-editor]}      {\end{lstlisting}\end{samepage}}   I've used this syntax many times before, but in this case it doesn't work.  Is there any reason why I can't enclose the lstlisting inside my own one?  Here's sample code, illustrating the problem.  \documentclass{minimal} \usepackage[framed]{matlab-prettifier}%For matlab code \newenvironment{myMP}      {\begin{samepage} \begin{lstlisting}[style=Matlab-editor]}      {\end{lstlisting} \end{samepage}} \begin{document} \begin{myMP} matlab word \end{myMP} \end{document}   When I run this with pdflatex it returns a *, indicating that the environment wasn't closed properly.  Thanks! Average run length Suppose in an Xbar chart, k successive points plotted outside a control limit indicates an out of control situation. If p is the probability of plotting a point outside a control limit, how is ARL = $(1-p^k)/(p^k (1-p))$? Is the composition of two injective functions injective? MySQL replication of single DB to same server What exactly are genes, DNA and chromosomes. How do they relate to each other and what is their function? So I am new to biology and I have been reading, and searching the web, but I couldn't understand the whole framework of a cell. So as I understood:    A DNA, is a double chain of Nucleotides (A,T,G,C and a sugar) and a phosphate residue. Some parts of a DNA code a gene and some do not, exons and introns accordingly. As I understand it these the sequences of exons hold genes and the whole sequence is called genome. Now I read in the book Introduction to Computational Molecular Biology by J. C. Setubal and J. Meidanis. that I cite Each cell of an organism has a few very long DNA molecules. Each such molecule is called a chromosome. So each X shaped thing called a chromosome holds one DNA molecule?   Or is each "hand" of the chromosome one complete double helix of DNA so we have 23 pairs of such chromosomes? or is it that each we 23 pairs Xs?   Shouldn't we have just one uniquely identifiable DNA sequence? I am asking this, because I have also read that each chromosome encodes a different part of one's genome. Does this mean we have several DNA sequences?   This is really bothering me, since I can't figure out the correct structure of a cell.   EDIT: Now if each chromosome contains a pair of DNA helices. We have 46 chromosomes so overall within the cell there are 92 DNA sequences? All of which are the same? Or are they different? If they are different how do they code for different aspects of one's genome? SIB 2009, Problem #2 Let $f(x)$ be a continuous function, whose first and second derivatives are continuous on $[0,2π]$ and $f&#39;&#39;(x)≥0\:\:∀\:x∈[0,2π]$. Show that$$ \int _0^{2\pi} f(x) \cos x dx \ge 0$$ Good review audit has "possible spam" warning? I was looking through someone's edit history and I was looking at :    Why does it give this notice, while at the same time saying that it's a high-quality post? How to minimize $|z_1 - z_2|^2 + |z_1 - z_4|^2 + |z_2 - z_3|^2 + |z_3 - z_4|^2$? If $z_1,z_2,z_3,z_4 \in \mathbb{C}$ satisfy $z_1 + z_2 + z_3 + z_4  =  0$ and $|z_1|^2 + |z_2|^2 + |z_3|^2 + |z_4|^2 = 1$, then the least value of $|z_1 - z_2|^2 + |z_1 - z_4|^2 + |z_2 - z_3|^2 + |z_3 -  z_4|^2$ is $2$.   I solved this by taking two of the values to be $\frac{1}{2}$ and other two as $-\frac{1}{2}$. But I couldn't prove this in an efficient manner. What exactly goes into a transformer's VA rating? At a fundamental level it seems that there has to be a limit to what the VA rating can represent.  For example if I draw 2 Amps-RMS from the secondary of a 30VA rated transformer at 15 Vrms this makes sense as the maximum Complex Power I can draw. Still, at a power factor of 1 my maximum current in the transformer would be sqrt(2) * 2 Amps.   But what if my power factor is abysmally low (ie in a DC rectifier) due to harmonic distortion and while I still draw 2A-RMS I have brief current spikes of 15 Amps? Surely the transformer's magnetics couldn't handle these spikes as I'd expect the core would saturate.  My question is what is the practical limit for VA ratings of transformers? Would brief current spikes that reduce to only 2A-RMS in this case be fine? Obviously the secondary/primary copper losses play a part in the rating but how do the magnetics factor in?  I ask this because I am designing a simple bench power supply using a 125VA transformer with a 24Vrms secondary and am trying to figure out how much power I can draw before the current spikes into the inductor are too much for the transformer. I also don't want to have to resort to active PFC as I don't want to risk messing up any HVAC PCB design.  Thank you New install - no network devices available - Realtek Device b822 I just purchased a Lenovo Yoga 730 15" laptop, and installed Ubuntu 16.04 in place of Windows 10. Install seemingly worked fine, but now I have no wifi device available.  Tried a reinstall just to be sure, and the same issue is happening. I don't believe it to be a hardware issue, as wifi was working without issue on Windows before I wiped it out.  When I run rfkill list I see:  0: ideapad_wlan: Wireless LAN Soft blocked: no Hard blocked: no   But when I run lspci I only see one item in the list claiming to be a network device:  3a:00.0 Network controller: Realtek Semiconductor Co., Ltd. Device b822 (rev ff)   I have a USB wifi adapter and that gets me connected without issue, but obviously that is not the desired solution.  Does anyone have any insight on what might be causing the issue?  Output from modinfo -p rtl8822be:  fix_rate: (int) debug_level: (int) swenc:Set to 1 for software crypto (default 0) (bool) ips:Set to 0 to not use link power save (default 1) (bool) swlps:Set to 1 to use SW control power save (default 0) (bool) fwlps:Set to 1 to use FW control power save (default 1) (bool) msi:Set to 1 to use MSI interrupts mode (default 1) (bool) dma64:Set to 1 to use DMA 64 (default 0) (bool) aspm:Set to 1 to enable ASPM (default 1) (int) debug:Set debug level (0-5) (default 0) debug_mask:Set debug mask (default 0) (ullong) disable_watchdog:Set to 1 to disable the watchdog (default 0) (bool) `--no-install-recommends` only specified packages I want to install xfce4-goodies but I don't want Midori Browser. With --no-install-recommends I don't know how to specify only Midori. I want the rest of packages. How to do that? Thanks! How to work with "FIFO" in C# .NET? Submitting a form by pressing enter without a submit button Well I am trying to submit a form by pressing enter but not displaying a submit button. I don't want to get into JavaScript if possible since I want everything to work on all browsers (the only JS way I know is with events).  Right now the form looks like this:  &lt;form name="loginBox" target="#here" method="post"&gt;     &lt;input name="username" type="text" /&gt;&lt;br /&gt;     &lt;input name="password" type="password" /&gt;     &lt;input type="submit" style="height: 0px; width: 0px; border: none; padding: 0px;" hidefocus="true" /&gt; &lt;/form&gt;   Which works pretty well. The submit button works when the user presses enter, and the button doesn't show in Firefox, IE, Safari, Opera and Chrome. However, I still don't like the solution since it is hard to know whether it will work on all platforms with all browsers.  Can anyone suggest a better method? Or is this about as good as it gets? states that the isomorphism type of a finite simple group is determined by its order, except that:   $L_4(2)$ and $L_3(4)$ both have order $20160$ $O_{2n+1}(q)$ and $S_{2n}(q)$ have the same order for $q$ odd, $n &gt; 2$   I think this means that for each integer $g$, there are $0$, $1$ or $2$ simple groups of order $g$.  Do we need the full strength of the  to prove this, or is there a simpler way of proving it? I'm here with weird stuff again.  How can i continue numbering while changing numbering style to Arabic from Roman? For example let's assume I have total of 7 pages and I want to number the first 3 of them as : i,ii,iii; then I change back to Arabic again and continue counting as 4,5,6,7. URLs are linked despite being inside a code span Markdown source:  `http://google.com`  - `http://google.com`     - `http://google.com`   Rendered result:  http://google.com   http://google.com   http://google.com    Note that the third code span is a link. Adding a newline before the list item makes the link disappear. Is there a program that can make live USBs for any distro, iso, you get the point. I can only find ones that make live USBs for other linux distributions and none for anything else. Is returning a pointer to a static local variable safe? I'm working with some code that widely uses the idiom of returning a pointer to a static local variable.  eg:  char* const GetString() {   static char sTest[5];   strcpy(sTest, "Test");   return sTest; }   Am I right in thinking that this is safe?  PS, I know that this would be a better way of doing the same thing:  char* const GetString() {   return "Test"; }   Edit: Apologies, the function signature should of course be:  const char* GetString(); Iterate enum values using java generics