UK visa refused due to lack of ties... how to reapply?
Should I submit bank statements when applying for a UK Visa? What do they say about me?
Measuring accuracy of latitude and longitude? How to add Windows to GRUB I have my encrypted Archlinux installed on my SSD. Now I have one HDD with Windows installed. But in my GRUB just Archlinux is shown (no Wonder, because I just installed Windows on the other HDD, GRUB doesn't know of that by now.).  My Question is, how do I properly add my Windows-HDD to GRUB, so that I can choose which to boot when starting?  I am a little bit afraid of destroying my GRUB so I can't boot my encrypted Archlinux anymore.  Thanks! RegEx for Javascript to allow only alphanumeric I need to find a reg ex that only allows alphanumeric. So far, everyone I try only works if the string is alphanumeric, meaning contains both a letter and a number. I just want one what would allow either and not require both. How do I run a 'sudo' command inside a script? Setting Zero values back to NULL How to divide two 64-bit numbers in Linux Kernel? Some code that rounds up the division to demonstrate (C-syntax):  #define SINT64 long long int #define SINT32 long int  SINT64 divRound(SINT64 dividend, SINT64 divisor) {   SINT32 quotient1 = dividend / divisor;    SINT32 modResult = dividend % divisor;   SINT32 multResult = modResult * 2;   SINT32 quotient2 = multResult / divisor;    SINT64 result = quotient1 + quotient2;    return ( result ); }   Now, if this were User-space we probably wouldn't even notice that our compiler is generating code for those operators (e.g. divdi3() for division). Chances are we link with libgcc without even knowing it. The problem is that Kernel-space is different (e.g. no libgcc). What to do?  Crawl Google for a while, notice that pretty much everyone addresses the unsigned variant:  #define UINT64 long long int #define UINT32 long int  UINT64 divRound(UINT64 dividend, UINT64 divisor) {   UINT32 quotient1 = dividend / divisor;    UINT32 modResult = dividend % divisor;   UINT32 multResult = modResult * 2;   UINT32 quotient2 = multResult / divisor;    UINT64 result = quotient1 + quotient2;    return ( result ); }   I know how to fix this one: Override udivdi3() and umoddi3() with do_div() from asm/div64.h. Done right? Wrong. Signed is not the same as unsigned, sdivdi3() does not simply call udivdi3(), they are separate functions for a reason.  Have you solved this problem? Do you know of a library that will help me do this? I'm really stuck so whatever you might see here that I just don't right now would be really helpful.  Thanks, Chad How can I insert a line break in a TikZ node? Simply putting \\ where I want the break doesn't work (see MWE).  Is there a way to make lines break automatically at some specified width?  And can I control the alignment of the text (left, right, centered, justified)?  \documentclass{article} \usepackage{tikz} \begin{document} \begin{tikzpicture} \node {First line\\second line}; \end{tikzpicture} \end{document} $\forall x,y>0, x^x+y^y \geq x^y + y^x$ Prove that $\forall x,y&gt;0, x^x+y^y \geq x^y + y^x$   A friend of mine told me none of the teachers in my school have succeeded in proving this seemingly simple inequality (it was asked at an oral exam last year). I tried it myself, but I made no significant progress. Bibliography with Metadata: I am constructing a bibliography of as much of the prior research in a field I am working in. I would like to use BibTeX to print the citation in the pdf, and then I would like to add the details of the paper after the citation. Only then would I like to print the next citation. For example:  [1] Jahan M. Dawlaty and Yunquing Chen. Measurement of the optical absorption of graphene in the terahertz. Applied Physics Letters, 2008. Research Group: Cornell Pump Wavelength: 500 nm. Probe Wavelenth: 7 microns. Relaxation Time: 50 fs. [2] Paul George and Dmitry Vekslar, Measurement of Ultrafast Carrier Dynamics in Graphene. Applied Physics Letters, 2009.  . . . and so on. Does anyone know how this could be done? Cannot access any files on Samsung Tab 4 7" Unexpected output of xargs The statement below should print afc abc but it prints abc abc instead. I tried many times but every time same result Don't know why this happens could anyone explain and help me?  echo abc|xargs -i{} echo $(echo {}|sed 's/b/f/g') {} Unary intersection of the empty set What are the most important things I need to do to encourage Google Sitelinks? My website used to have sitelinks and now it doesn't. It's very possible that it's due to changing the website to a sidebar design instead of having an "interstitial" type landing page which limited the number of choices, but I'm not sure.  Here is how sitelinks might look for a site:    What are some things that I can do to improve my chances of getting sitelinks? Why copy constructor not invoked here Don't certain processes decrease entropy? Should I really pay off my entire credit card balance each month or should I maintain some balance? Targeting only Firefox with CSS Generate mesh at run time Is it possible to generate mesh at runtime in blender game engine? That is, is it possible for blender to generate meshes using python code when the game runs?  I really would like to know if this is possible, as my final year project requires use of this. Overleaf does not compile after using Biblatex Number of solutions of an arithmetic function's equation Say, an equation is given below \begin{equation} 2\pi(x) - \pi(2x)=\omega(x) \end{equation}  where $x$ is a positive integer, $\pi(x)$ is the prime-counting function, and $\omega(x)$ is the number of distinct prime factors of $x$.  I would like to know if this equation holds for finitely many values of $x$ or infinitely many.  If one uses asymptotic formula (from number theory) it can be written that \begin{equation} \omega(x) \sim \ln x / \ln \ln(x) \end{equation} (from )  and  \begin{equation} \pi(x) \sim x/\ln(x), \end{equation} so the above equation can be rewritten (after simplification) as \begin{equation} 2x\ln(2)=\ln(x)\ln\ln(x)\ln(2x) +f(x) \end{equation}  where $f(x)$ is an error term.  If  I plot left side (which is linear, supposed to be a straight line) and right side(a curve),assuming $ f(x) $ is 100% accurate, then the equation implies(?!) that the right will intersect left side. Since line can intersect a curve ($ln  $ function) finite times, so there are finite intersection point. So, can I say that there are only finitely many values of $x$?  graph example-   here f(x) is assumed as x + sinx  without the f(x)-