I have a disk image named: disk.img. I cannot mount this because I think it's messed up from Windows.  Here are some commands I've run:  sudo mount -o loop,offset=135266304 ./disk.img /mnt/temp  The disk contains an unclean file system (0, 0). Metadata kept in Windows cache, refused to mount. Failed to mount '/dev/loop8': Operation not permitted The NTFS partition is in an unsafe state. Please resume and shutdown Windows fully (no hibernation or fast restarting), or mount the volume read-only with the 'ro' mount option.     sudo ntfs-3g -o remove_hibernation ./disk.img /mnt/temp  NTFS signature is missing. Failed to mount './disk.img': Invalid argument The device '*' doesn't seem to have a valid NTFS. Maybe the wrong device is used? Or the whole disk instead of a partition (e.g. /dev/sda, not /dev/sda1)? Or the other way around?     sudo ntfsfix ./disk.img   Mounting volume... NTFS signature is missing. FAILED Attempting to correct errors... NTFS signature is missing. FAILED Failed to startup volume: Invalid argument NTFS signature is missing. Trying the alternate boot sector Unrecoverable error Volume is corrupt. You should run chkdsk.     file ./disk.img  ./disk.img: DOS/MBR boot sector MS-MBR Windows 7 english at offset 0x163 "Invalid partition table" at offset 0x17b "Error loading operating system" at offset 0x19a "Missing operating system"; partition 1 : ID=0xee, start-CHS (0x0,0,2), end-CHS (0x3ff,255,63), startsector 1, 4294967295 sectors     fdisk -l ./disk.img  Disk ./disk.img: 279.5 GiB, 300069052416 bytes, 586072368 sectors Units: sectors of 1 * 512 = 512 bytes Sector size (logical/physical): 512 bytes / 512 bytes I/O size (minimum/optimal): 512 bytes / 512 bytes Disklabel type: gpt Disk identifier: *  Device       Start       End   Sectors   Size Type ./disk.img1 264192 586072063 585807872 279.3G Microsoft basic data     I really don't know what to do. I don't have access to Windows.  Anyone have any ideas?
Whenever I boot Ubuntu, I get a message that it cannot mount my windows partition, and I can choose to either wait, skip or manually mount.  When I try to enter my Windows partition through Nautilus I get a message saying that this partition is hibernated and that I need to enter the file system and properly close it, something I have done with no problem so I don't know why this happens.    Here's my partition table, if any more data is needed please let me know.     Device Boot      Start         End      Blocks   Id  System /dev/sda1            2048    20000767     9999360   83  Linux /dev/sda2        20002814   478001151   228999169    5  Extended /dev/sda3   *   478001152   622532607    72265728    7  HPFS/NTFS/exFAT /dev/sda4       622532608   625141759     1304576   82  Linux swap / Solaris /dev/sda5        20002816   478001151   228999168   83  Linux
Series Summation,Convergence I am stuck on the 4 th one.I have done the rest.I have found out the value of a_n.But not getting how to proceed for the 4 th one. Normally, when a user edits one of my posts, I receive a notification like on the following depending on the case   User has editing privilege (click to visit revision)   Users' edit is submitted to review queue (click to visit review queue)     The above notifications were received instantaneously (or less than 30 minutes, in case caching is supposed to be the answer) as the edit was done/suggested.  But I did not receive any such notification today (yet) on an edit made on my . I think it is a possible bug and should be looked at. The recent notifications list I have is shown below: Proving a sequence defined by a recurrence relation converges How can I prove that this iterative sequence converges to $2$? Can I use the convergence definition?  $$a_{n+1} = \frac{a_n}{2} + \frac{2}{a_n},\qquad  a_0 = 4  $$  Thanks for the help. Over the years I've written some libraries. These libraries sometimes depend on each other.  As a result, the "tex" directory is structured as follows:  tex ├── library |   ├── library1.sty |   ├── library2.sty |   └── library3.sty ├── project1 |   ├── master.tex |   ├── chapter1.tex |   └── chapter2.tex ├── project2 |   └── article.tex └── project3     └── paper.tex   The libraries depend on each other. As a result, in every library that depends on another library, this is part of the header:  %library2.sty \ProvidesPackage{library2} \RequirePackage{../library/library1}   In other words, the library is imported from the "root of every project". This is not a good design choice. What if someone copies the libraries in the folder of the root of a project, or what if the folder "library" is renamed...  It is however reasonable the "active directory" still remains in the project root.  What can be done to resolve such library dependencies? What's the associated matrix of this linear operator? Let $V$ be a complex vector space of dimension $n$ with a scalar product, and let $u$ be an unitary vector in $V$. Let $H_u: V \to V$ be defined as  $$H_u(v) = v - 2 \langle v,u \rangle u$$  for all $v \in V$. I need to find the characteristic polynomial of this linear operator, but the only way to find it that I know of is using the associated matrix of the operator.  I don't know how to find this matrix because I don't know how to deal with the scalar product. Is there some other way to find the characteristic polynomial? If not, how can I find the associated matrix of this linear operator?  Thanks in advance. What if the hard disk is partitioned into more than 26 sections in Windows? Problems with \printbibliography I am writing my thesis and need to do this with apa citation style.  I used the following code in my main document:  \usepackage[backend=biber,style=apa,sorting=none,natbib=true]{biblatex} \addbibresource{library.bib}  \usepackage[autostyle=true]{csquotes}    and in the end of my main document..  \printbibliography[heading=bibintoc,[title={References}]   However I always get this error:     "Undefined control sequence.   \printbibliography[heading=bibintoc,[title={References}]"   Furthermore in my references table, I get (yearmonthday) instead of (2015)e.g. and the references are not alphabetically sorted. VLC will not install Sum of binomial coefficients with index divisible by 4 I am trying to obtain a closed form expression for  $\sum {n \choose 4k}$  I am trying to use the binomial expansion of $(1 + i)^n$ and $(1 - i)^n$. $$(1 + i)^n + (1 - i)^n = 2\left(\sum {n \choose 4k} -\sum {n \choose 4k + 2}\right)$$ Stuck at this now. I can't come up with a way to simplify the second term on RHS. Any help would be appreciated. I have installed Linux Bash on Windows 10 (available from Microsoft), but I've forgotten my password.  I've searched for a solution but I only find suggestions that involve doing something before the system boots, like accessing recovery mode, but that will not work in this case as this Ubuntu is just an application within a Windows system and doesn't have its own boot process.  How can I reset my password? How to uncover a table column wise in Latex beamer I have a table with 7 columns and want to show the first 5 at once, and then  the 6th and 7th on consecutive slides.  This is the code I have for now:  \begin{frame}{Наслов}     \begin{itemize}         \item Ставка.     \end{itemize}         \begin{tabular}{ccccc&lt;{\onslide&lt;2-&gt;}c&lt;{\onslide}c}             $p_1$ &amp; $p_2$ &amp; $\ldots$ &amp; $p_{9}$ &amp; $p_{10}$ &amp; $W$  &amp; $D$\\             $1$   &amp; $1$   &amp; $\ldots$ &amp; $1$      &amp; $1$     &amp; $w_1$&amp; $d_1$\\             $1$   &amp; $1$   &amp; $\ldots$ &amp; $1$      &amp; $0$     &amp; $w_2$&amp; $d_2$\\             $1$   &amp; $1$   &amp; $\ldots$ &amp; $0$      &amp; $1$     &amp; $w_3$&amp; $d_3$\\             $1$   &amp; $1$   &amp; $\ldots$ &amp; $0$      &amp; $0$     &amp; $w_4$&amp; $d_4$\\             $\vdots$ &amp; $\vdots$ &amp; $\vdots$ &amp; $\vdots$ &amp; $\vdots$ &amp; $\vdots$ &amp; $\vdots$\\             $0$   &amp; $0$   &amp; $\ldots$ &amp; $0$      &amp; $1$     &amp; $w_{1023}$&amp; $d_{1023}$\\             $1$   &amp; $1$   &amp; $\ldots$ &amp; $0$      &amp; $0$     &amp; $w_{1024}$&amp; $d_{1024}$         \end{tabular} \end{frame}   This produces 2 slides: the first one with p1, p2, ..., p9, p10 and D columns, and the second with W added, while I want them to appear in the following order:   1st slide: p1, p2, ..., p9, p10  2nd slide: p1, p2, ..., p9, p10, W 3rd slide: p1, p2, ..., p9, p10, W, D   I looked in the manual and found this example:  \begin{frame}     \begin{tabular}{l!{\vrule}c&lt;{\onslide&lt;2-&gt;}c&lt;{\onslide&lt;3-&gt;}c&lt;{\onslide&lt;4-&gt;}c&lt;{\onslide}c}     Class &amp; A &amp; B &amp; C &amp; D \\     217     X &amp; 1 &amp; 2 &amp; 3 &amp; 4 \\     Y &amp; 3 &amp; 4 &amp; 5 &amp; 6 \\     Z &amp; 5 &amp; 6 &amp; 7 &amp; 8     \end{tabular} \end{frame}   which does what is supposed to. However, I don't seem to be able to apply its logic to my problem. :( Is anyone willing to help?   P.S. What are the meanings of &lt; and ! in columns specification? How do constant aperture zoom lenses work? Cheaper zoom lenses usually are faster at the wide end and slower at the long end (for example, the $150 Canon EF-S 18-55mm f/3.5-5.6). More expensive constant-aperture zoom lenses have the same aperture regardless (for example, $800 Canon EF 17-40mm f/4.0 L).  My question is: are these good lenses  at the wider settings, or do they have a different optic system that allows them to maintain the same aperture throughout the zoom range? How to evaluate these two integrals. Which is the correct question ("Who has" vs "Who have")? The situation is that:  We've already read three English novels.  Which is the correct question for that situation?   Who has already read three English novels?  Who have already read three English novels?    Or could both be correct? Please also provide the grammatical reasons for your answers. What is the correct way to install proprietary ATI Catalyst Video Drivers (fglrx) directly from AMD? I am planning on doing a fresh install of Ubuntu and want to know what is the correct way to install ATI Catalyst Video Driver?      There are multiple valid answers for this question spanning over several versions of Ubuntu. For your convenience an index of each below: Cost increase and suspend During a recent game, my opponent Suspended two  in the same turn. Then, during my turn, I played a .    The way we resolved it, is that at the next turn, my opponent payed 1 for the second Rift Bolt. I'm not sure if this is correct, because the rule text for supspend says that when you remove the last suspend counter you cast the spell without paying its mana cost.  So, to me, it sounds like even if the cost was increased, one still does not need to pay for it.    What's the correct thing to do? If actually one needs to pay for the second suspended spell, what would happen if he can't? Also how do LEFT JOIN, RIGHT JOIN and FULL JOIN fit in? How does the Java 'for each' loop work? Consider:  List&lt;String&gt; someList = new ArrayList&lt;String&gt;(); // add "monkey", "donkey", "skeleton key" to someList     for (String item : someList) {     System.out.println(item); }   What would the equivalent for loop look like without using the for each syntax? How do I remove the Me-User-Indicator from the Panel? How do I remove the Me-User-Indicator from the Panel?  The indicator contains two items: the written user name and the icon of a human. My specific question is with the ASUS M3N78-VM motherboard that my home server uses. I currently have 4x2GB installed for a total of 8GB but I was hoping to upgrade to say 16GB (4x4GB). The official specifications of that motherboard says it only supports up to 8GB but it was released back when only 2GB sticks were available. What, if any, would prevent it from working with 4GB sticks now that 4GB sticks are available?  My general question is with motherboards in general... what would prevent a motherboard from working with bigger sticks if its all just the same type (DDR2 for example and same speeds) of memory?