Interestingly, on my Surface Pro 3 a LiveCD installation of Ubuntu (15.10) would boot without any issues.  However, a full install on a USB3 SSD, (either in UEFI or non-UEFI mode) with or without Secure Boot would fail to load. I made the installations by installing them through Virtual Box and having the SSD exposed to the Guest OS (Ubuntu Installer Disk).  Does anyone know what the difference in the boot chain is for LiveCDs and full install? Can I get a full install with a LiveCD-like boot chain so that it would boot on my Surface Pro?
I'm still a newbie with Linux but I'm trying to learn. I have two USBs, one is 4GB and has the ISO install of Ubuntu (I think it's called live, the one with maximum of 4GB of permanent storage) and got a 64gb usb to make a permanent full install on it. I installed it following  tutorial and everything looks fine (I had to create the EFI partition with the Terminal though) but it just won't boot, the live install boots without problems.   I'm using the school's computers which have the UEFI menu password protected so I can't access that and I won't have a laptop for like 3 weeks (main reason why I'm doing this). I tested it with a friend's laptop disabling the Secure boot but it still wouldn't boot. I also saw that some tutorials don't add the EFI partition so I tried without that one and still won't work. And I know it's not the 64GB usb not booting because I had a live install on it too before and it booted fine.  Please, I have been trying to make it work for two days now, any ideas? I can barely understand this stuff so if you could explain step by step that would be awesome.
According to this , I thought the new recaptcha API was used network-wide. Though today, when going to  (which for whatever reasons never recognized me automatically), I got this message instead of a usable captcha image.   V1 Unsupported Please direct siteowner to   (Doing a second try doesn't show this message anymore, and the recaptcha v1 works as intended.)  According to , the reCAPTCHA v1 API will stop working on March 31, 2018:  What happens to reCAPTCHA v1? Any calls to the v1 API will not work after March 31, 2018. Starting in November 2017, a percentage of reCAPTCHA v1 traffic will begin to show a notice informing users that the old API will soon be retired. Most websites around the world have already switched to reCAPTCHA v2, where humans pass effortlessly. With our advanced risk analysis engine, reCAPTCHA v2 can effectively separate humans from bots and always stay ahead of the attackers. If your site still uses reCAPTCHA v1, please upgrade to reCAPTCHA v2 immediately. We no longer support reCAPTCHA v1. Any calls to the v1 API will not work after March 31, 2018. Please register a new key and upgrade to v2.  I'm really hoping this will not take  to fix, because we've only got three and a half weeks left! Frattini subgroup $Φ ( G )$ is not trivial Frattini subgroup $Φ ( G )$ of a group G is the intersection of all maximal subgroups of $G$. The question is  Let $G$ be an abelian group.What is the sufficient and necessary condition of $Φ ( G ) ≠｛e｝$？  I think if $G$ has no torsion part, we cannot say $Φ ( G ) ≠｛e｝$,because $\Bbb Z ×\Bbb Z×・・・ ×\Bbb Z$ has a maximal subgroup $p\Bbb Z ×\Bbb Z×・・・×\Bbb Z$, with intersectioning distinct primes, we gain just a trivial group. So, we need torsion part. But I cannot proceed from here.I only know the answer, $G$ has an element of order $p^2$, that  is, $G$ has theree subgroups. I want to deduce this consequence from steady discussion. P.S  According to this answer, in a ring that is a finite direct product of quotient rings of $\mathbf{Z}$, we can say rattini subgroup is the same as the Jacobson radical of the corresponding ring. Getting attributes of Enum's value How to copy the complete folder structure one location to another location include all files and sub folders I have folder structure like in Shared documents/East using CSOM and C# Main Folder   Folder1   Folder2      File1      File2  I have to copy all folders with files to Shared documents/West .... Is there a video that explains how Stack Overflow works and can be used? Is there a video that explains how Stack Overflow works and can be used? I.e. a short tutorial to get new users started. If there isn't, then the people behind this site or others who know how it works should make one, because it's overwhelmingly different from other sites and thus difficult for beginners. Limits of Poisson's ratio in isotropic solid What is the Fastest a Character Can Move in One Turn? At level 20 with any magic items in the DMG, and any spells, what is the fastest a DnD 5e character could move using their movement?  (i.e., not including teleportation) How to increase label size of OpenLayers plugin basemap layers? I have not done much proofs before this and need some guidance. I know that for a simple graph such as this :  node - node - node -node   Removing the first and last vertex will not disconnect the graph. So far, I can think of two cases: Where there are leaves, or nodes with degree of 1. Where there are no leaves, which means all nodes have degrees 2 or more.   In the first case, removing the leaf will not disconnect the graph. In the second case, removing any should not disconnect the graph. Problem is, I don't know how to formulate this into a good proof. We denote the s value of an ECDSA signature $(r, s)$ on a message $m$ as: $s=\frac{H(m)+xr}{k}$  Assume two ECDSA signatures sharing the same nonce $(r, s_1) , (r, s_2)$ on two messages $m_1, m_2$, that verify under two pubkeys $x_1G, x_2G$.    If the two public keys are equal then the secret keys should be equal $x_1 = x_2$ and we can easily recover the $k$ using the standard attack on nonce reuse. Once we know $k$ we can recover the secret key.  $\frac{H(m_1)-H(m_2)}{(s_1 - s_2)} =\frac{k(H(m_1)-H(m_2))}{H(m_1)-H(m_2)+x_1r - x_2r}$  $x_1 = x_2 \rightarrow x_1r - x_2r = 0$  $\frac{H(m_1)-H(m_2)}{(s_1 - s_2)} =\frac{k(H(m_1)-H(m_2))}{H(m_1)-H(m_2)} = k$  My question is can this attack be made to work if the secret keys are not equal i.e. $x_1 \ne x_2$:  $\frac{H(m_1)-H(m_2)}{(s_1 - s_2)} =\frac{k(H(m_1)-H(m_2))}{H(m_1)-H(m_2)+x_1r - x_2r} = \frac{k(H(m_1)-H(m_2))}{H(m_1)-H(m_2)+ (x_1 - x_2)r}$  If you know either $x_1 - x2$ or $\frac{x_1}{x_2}$  you should be able to compute $k$ as long as $s_1 \ne s_2$.  You can calculate $x_1 - x_2 = \frac{H(m_2) - H(m_1)}{r}$ in case where $s_1 - s_2 = 0$. However this case seems to reduce to the hardness of ECDSA since anyone can compute the pubkey for a new message $m_2$ that verifies under first signature $(s, r)$ using public key recovery.  If $s_1 \ne s_2$ you can compute $\frac{x_1 - x_2}{k}$ which allows you to convert $s_1$ into $s_2$ and vice versa. MSO Review Queue Privileges are Misleading no wifi in Ubuntu 15.04 I cannot see WiFi option in my Ubuntu 15.04. What should I do? Revert asap  lspci -nnk | grep 0280 -A2 output:-  03:00.0 Network controller [0280]: Qualcomm Atheros Device [168c:0042] (rev 30) Subsystem: Foxconn International, Inc. Device [105b:e09a]   rfkill list output:-  0: hci0: Bluetooth Soft blocked: no Hard blocked: no 1: acer-wireless: Wireless LAN Soft blocked: no Hard blocked: no      dmesg | grep ath [    9.545199] ath10k_pci 0000:03:00.0: pci irq msi-x interrupts 8 irq_mode 0 reset_mode 0 [   10.029684] ath10k_pci 0000:03:00.0: Direct firmware load for ath10k/cal-pci-0000:03:00.0.bin failed with error -2 [   10.029701] ath10k_pci 0000:03:00.0: Direct firmware load for ath10k/QCA9377/hw1.0/firmware-5.bin failed with error -2 [   10.029704] ath10k_pci 0000:03:00.0: could not fetch firmware file 'ath10k/QCA9377/hw1.0/firmware-5.bin': -2 [   10.029711] ath10k_pci 0000:03:00.0: Direct firmware load for ath10k/QCA9377/hw1.0/firmware-4.bin failed with error -2 [   10.029713] ath10k_pci 0000:03:00.0: could not fetch firmware file 'ath10k/QCA9377/hw1.0/firmware-4.bin': -2 [   10.029719] ath10k_pci 0000:03:00.0: Direct firmware load for ath10k/QCA9377/hw1.0/firmware-3.bin failed with error -2 [   10.029721] ath10k_pci 0000:03:00.0: could not fetch firmware file 'ath10k/QCA9377/hw1.0/firmware-3.bin': -2 [   10.029726] ath10k_pci 0000:03:00.0: Direct firmware load for ath10k/QCA9377/hw1.0/firmware-2.bin failed with error -2 [   10.029728] ath10k_pci 0000:03:00.0: could not fetch firmware file 'ath10k/QCA9377/hw1.0/firmware-2.bin': -2 [   10.029733] ath10k_pci 0000:03:00.0: Direct firmware load for ath10k/QCA9377/hw1.0/firmware.bin failed with error -2 [   10.029735] ath10k_pci 0000:03:00.0: could not fetch firmware (-2) [   10.029737] ath10k_pci 0000:03:00.0: could not fetch firmware files (-2) [   10.029739] ath10k_pci 0000:03:00.0: could not probe fw (-2) What is the difference between “do” and “make”? I am using Ubuntu 16.04 with GTX 1080. On my first boot, the screen turn black after I selected Ubuntu in grub. After I added nomodeset, the black screen gone however it only shows the Ubuntu default background image. It can't reach the login screen. In what order do multiple readied actions with the same trigger resolve? Intuition behind why order of a subgroup divides order of a group. Why does Benford's Law (or Zipf's Law) hold? Both  (if you take a list of values, the distribution of the most significant digit is rougly proportional to the logarithm of the digit) and  (given a corpus of natural language utterances, the frequency of any word is roughly inversely proportional to its rank in the frequency table) are not theorems in a mathematical sense, but they work quite good in the real life.   Does anyone have an idea why this happens?  (see also ) Can python be used to edit a Text Object? That is, can python code replace, for example, a single letter in a Text Object or insert a letter or string into a Text Object.  Note that I'm not talking about replacing a Text Object with some updated string, such as, object.text = "new string". I'm thinking more about having access to the Text cursor (not the mouse cursor) and positioning it on some letter that I'd like to replace.  In other words, I'd like to have the same capability during BGE play that I have when altering a Text Object in the edit mode. Is it possible to repeat my track object along a path? I tried using the method shown here  using an array and then a curve modifier, but this happened when I added the curve modifier and chose the path as the curve object. Simple question:     My apples and orange are wrong   or     My apples and orange is wrong   I am not a native English speaker, and I am having some trouble choosing between plural are or singular is for that kind of example.