I followed the mainstream instructions for installing Ubuntu 16.10 alongside windows 10. After installing Ubuntu I restarted my computer to get the GRUB menu to choose which OS to boot. Everything is fine. Booted Ubuntu 16.10 and then I wanted to test Windows as well, so I shut the pc down and turned on again to find the same menu but this time I chose Windows. When I turned it on again, it just ignored grub and went straight to booting Windows.   EDIT: Windows 10 fast start and hibernation are disabled, Secure Boot is disabled; my notebook is a Sony Vaio SVE151J11X  EDIT2: through admin prompt on windows i just ran:  bcdedit /set {bootmgr} path \EFI\ubuntu\shimx64.efi   now everything is fine. Thanks
I've just upgraded to Windows 10 from Windows 8.1 on my partitioned laptop that has Ubuntu 14.04 installed. Grub no longer appeared on boot so I ran boot-repair from an Ubuntu liveUSB. This didn't seem to have any effect. I've checked and secure boot is still disabled. Log from boot-repair:  So what's next?  Update: I've attempted to use chroot to update grub from my Ubuntu partition. update-grub runs successfully finding both linux and windows boot manager but the process still doesn't have any effect. grub-install complains that it cannot find EFI directory (but I have mounted everything correctly).  Update2: Just discovered that running efibootmgr after chroot into ubuntu shows ubuntu as not being in the boot order at all. I manually changed the order and rebooted to discover that the bootorder was reset. I run in windows: bcdedit /set {bootmgr} path \EFI\ubuntu\shimx64.efi But this has no effect either even after reporting 'Operation Successful'.
Looking for a 1000 most frequent english words Is there a free list of 1000 most frequent words used in everyday English? If there is a list with usage examples (as each of those words has multiple meanings for sure, not to cound phrasal verbs), it would be even greater.  Is there something alike, but with phrases? (E.g. 1000 most frequent phrases) The volume "filesystem root" has only 0 bytes disk space remaining? Make Blender usable on high resolution screen The Blender UI elements are incredibly small by default on high resolution screens on Windows (15" UHD screen).  I found the Preferences -> System -> DPI setting which can be set up to 144.  This makes Blender usable, but still uncomfortable and difficult on the eyes.  Is there a way to make the UI elements even larger? How do I install Netbeans? I used NetBeans for Java development on Windows and remember finding it in the Ubuntu Software Center on Natty, but now it's gone. Is there a PPA I can use or will it be re-added to the official repos? Using NPN transistor as switch Get name of caller function in PHP? Is there a PHP function to find out the name of the caller function in a given function? We hold an L1 visa (Citizens of India) and are planning a cruise to the Bahamas this summer. Are there any Visa requirements to enter Bahamas. Disable back button in android How can I install Windows after I've installed Ubuntu? Subdomain versus subdirectory I recently moved from having a main site like www.example.com with a subdomain associated site yyy.example.com, to moving everything off the subdomain to a subdirectory like www.example.com/yyy/, with the same hierarchy underneath the subdirectory, and now yyy.example.com is just a redirect page to the subdirectory, so yyy.example.com/abc/page-x is redirected to www.example.com/yyy/abc/page-x and so on.  The effect has been that the traffic increased by several times (the total page views are more than ten times at the present rate) what it was to the yyy subdomain. Previously almost all of the traffic to the yyy subdomain was from the www site. This is from monitoring the old yyy site for a year or more.  I'm curious to know if there's any research or results which would indicate whether this is universal (subdirectories beat subdomains) or "just me". Are there any Combinatoric proofs of Bertrand's postulate? I feel like there must exist a combinatoric proof of a theorem like: There is a prime between $n$ and $2n$, or $p$ and $p^2$ or anything similar to this stronger than there is a prime between $p$ and $(\prod_p p) + 1$ (Euclid's theorem).  I was trying to prove one by the Sieve on this grid      1     2     3     4 ... p   p+1   p+2   p+3   p+4 ... 2p  2p+1  2p+2  2p+3  2p+4 ... 3p ........................... ........................... ........................... p^2 p^2+1 p^2+2 p^2+3 p^2+4 ...   but it did not work.  Do any good arguments like this exist? I don't expect anything as strong as Prime Number Theorem or even Bertrand, but surely a direct combination proof can prove that there are lots of primes? Let $X$ be a locally compact metric space which is also $\sigma$-compact. Let $C_{c}(X)$ be the continuous functions on $f$ from $X$ to $\mathbb{R}$ with compact support. Is $C_{c}(X)$ separable?  My work so far:   If $X$ is a compact metric space, then by Urysohn's Lemma and Stone-Weierstrass, the continuous functions $C(X)$ on $X$ are separable and hence the result follows as $C_{c}(X) = C(X)$.  Suppose $X = \mathbb{R}$. Write $\mathbb{R} = \bigcup_{N  = 1}^{\infty}[-N, N]$. Let $f \in C_{c}(\mathbb{R})$. Then $f$ is supported on a compact set $K \subset [-N, N]$ for some $N$. Thus $C_{c}(\mathbb{R}) =\bigcup_{N = 1}^{\infty}C([-N, N])$. Each $C([-N, N])$ has a countable dense subset $\{\psi_{N, n}\}_{n = 1}^{\infty}$ and so $\bigcup_{N, n = 1}^{\infty}\{\psi_{N, n}\}$ is a countable dense subset of $C_{c}(\mathbb{R})$.  In the general case, $X = \bigcup_{i = 1}^{\infty}X_{i}$ where each $X_{i}$ is compact and $X_{1} \subset X_{2} \subset \cdots$. Let $f \in C_{c}(X)$. Then $f$ is supported on a compact set $K = \bigcup_{i = 1}^{\infty}K \cap X_{i}$. Is it still true that $C_{c}(X) = \bigcup_{i = 1}^{\infty}C(X_{i})$? I checked my  to see whether I can find something similar to the main-site flag-history for chat-flags, but didn't find anything. I recently had the (dis)pleasure of regularly having to deal with a user, that has been deleted multiple times. Whenever they show up (with the same nick-name) again I have to flag them again. I'd like to get an overview of how often I had to do that, and whether my flags were helpful for the moderators. As such I propose the implementation of a flag-history as it is already in place for the main-site for chat-flags, that request moderator intervention. To be completely clear I am not talking about the 10k user flags, which are acted on in a matter of sometimes seconds with instantly visible results, but about moderator attention flags from this menu: I have looked in several different Fate games' rulebooks, including Fate Core, DFRPG, Atomic Robo, FAE, and Jadepunk, which all describe Boosts as temporary Aspects you get to invoke for free, one time, and which disappear after being invoked.  In the other "invoke for free" situation I'm aware of (on Aspects newly-created via the Create Advantage action), they aren't singled out as "temporary."  I looked in many books but I'm interested in Fate Core.  So I haven't been able to figure out whether Boosts need to be invoked immediately or they disappear, without having been invoked at all? A method to count occurrences in a list Use grep to find content in files and move them if they match If I have a Java source file (*.java) or a class file (*.class), how can I convert it to a .exe file?  I also need an installer for my program. Is there an GUI Designer for python? Is there a GUI IDE for programming python just like java has netbeans?  I wanted one where we could drag &amp; drop test boxes &amp; labels just as we do in swing components using netbeans or eclipse.  Or is there an add-on present in either netbeans or eclipse itself? Fibonacci sequence emerging from integer partitioning How do I make exponential equation with points?  Here are my points:  x = 0, y = 0 x = 1, y = 4.75000 x = 2, y = 9.26250 x = 3, y = 13.54937 x = 4, y = 17.62191   this is same as   x = 0, y = 0 x = 1, y = (0 + 5) * 0.95  x = 2, y = ((5 * 0.95) + 5) * 0.95 x = 3, y = (((5 * 0.95) + 5) * 0.95 + 5)) * 0.95 x = 4, y = ((((5 * 0.95) + 5) * 0.95 + 5)) * 0.95 + 5) ) 0.95   as x value increase by 1, y value is added by 5 and multiplied by 0.95 i tried to make an equation for this but i couldn't  also i tried to use natural exponential but the initial value is 0 so it didn't work  please help me