Installing Skype using a .deb file "sudo: impossible to determine the name of the host" "dpkg: error: requires action option"
How do I install Skype?
I get it after updating in Synaptic Manager  I recently did a clean install of Ubuntu 17.04 from 16.10.  error message:-  W: Download is performed unsandboxed as root as file '/var/cache/apt/archives/partial/samba-libs_2%3a4.5.8+dfsg-0ubuntu0.17.04.1_i386.deb' couldn't be accessed by user '_apt'. - pkgAcquire::Run (13: Permission denied) How to get next/previous record in MySQL? setting upper and lower limits in rnorm How do I create bookmarks with pdfLaTeX? I'm using MiKTeX and using pdfLaTeX. I can generate the PDF, but there are no bookmarks. In the .tex-file it is using:  \chapter \section \subsection   (with labels)  I originally used make with sphinx to output LaTeX. It must work somewhat or I wouldn't get the PDF. When I say bookmarks, I mean when you are in Acrobat and the left side has the Bookmarks panel.  I am reading   But I am not sure where to apply this.  EDIT:  I applied this, \usepackage{bookmark}, and got bookmarks, but I never get the subsection bookmarks. Most efficient way to concatenate strings? What's the most efficient way to concatenate strings? Getting text from last marker to EOF in POSIX.2 How do I start a process from C#? How do I start a process, such as launching a URL when the user clicks a button? Using a naked black hole as a mirror? How do you run as a different user from the Start Menu in Windows 10? Running an application as a different user (e.g. domain admin account) from the start menu (by shift + right-clicking the application) used to be an option in Windows 7 &amp; XP.  However, I can't find that option in Windows 10. The workaround seems to be either 1) to find the application in Windows Explorer (shift + right-click) or 2) use runas.exe from the command line.  However, in order to use those workarounds, I have look up the executable name first. It's a bit difficult because I don't have the name of every RSAT tool or executable name memorized.  (e.g. "Active Directory Users and Computers" is dsa.msc, "Routing and Remote Acces" is rrasmgmt.msc)  Is there a simpler way to do this? Here is my problematic code:  \begin{tikzpicture} \draw  (0,0)  to [bend left=20] (3,3) node[midway] {midway label}; \end{tikzpicture}   I wanted to put a label midway of the line, but instead the label is at (0,0).  If I remove [bend left=20], the line is not bent, and the label still misplaced. If I remove to and replace it by --, then it works fine, but my line is not bent any more.  \begin{tikzpicture} \draw (0,0) -- (3,3) node[midway] {midway label}; \end{tikzpicture}   Works fine.  The problem occurs with MacTeX 2011 and MacTeX 2012. I was recently invited to join InitiativeQ via a friend on Facebook. The underlying idea makes rough sense to me (as a non finance expert). However their 'hook' seems to be that early adopters will get free money later down the line when the currency launches (the earlier you adopt, the more currency you will receive). Looking at the website, there is a big button with the text Reserve $128,957 (I assume that's their idea of what the dollar value of my reservation will be if it launches).  The website's production quality suggests it is not a scam, however the language suggests strongly that it is. Is this a scam, a get rich quick scheme? Or am I being overly paranoid? In ZF set theory the axiom of regularity (also called axiom of foundation) says that:     In all nonempty sets x there is an element y such that x∩y=∅   As I been told that  of the axiom is to prohibit constructions as $x\in x$, but is this a possible strategy?  Given a binary predicate $R$, written in infix notation, there are unitary predicates $p$ such that:  $\qquad \exists y \forall x: x R y \leftrightarrow p(x)$.  But there also are some convincing counterexamples:   $  p(x) \leftrightarrow \neg(x R x)$ $  p(x) \leftrightarrow \neg(x R f(x))$, where $f$ is any surjection $  p(x) \leftrightarrow$ all chains $x_1 R x, \: x_2 R x_1, \: x_3 R x_2,  \ldots \:$ are finite.   I think there is a major mistake to try to avoid certain paradoxical loops. First, there are no guarantees that every possibility is prohibited. And second, it seems pathological to make constructions that avoid certain proof-techniques (it's like the attitude of a shyster).  So, what protection comes from this axiom? Historically, has it anything to do with the Russell-predicate $x\notin x$?  See also Geometric proof that a Pythagorean triple has a number divisible by $3$? Can I infer from “If $a,b \in \mathbb{N}$ such that $(a,3)=(b,3)=1$ then $a^2+b^2\neq c^2$ for any $c\in\mathbb{N}$” that any pythagorean triple has a number which is divisible by $3$? If so, how can this relationship be proved geometrically? How to add custom C++ keywords to be recognized by Minted? HP Easy Scan - "HP Scanner 3" will damage your computer The 'ok' on the 'Your Answer' dialog on unregistered sites is a bit too high The 'ok' on the 'Your Answer' dialog on unregistered sites is a bit too high:     You can see the top of the k is outside the actual box, increasing the margin-top by 10px in the containing div fixes it. Is it possible to use the enumerate/itemize environment within the proof/remark environment in a nice way? Prove $e^{x+y}=e^{x}e^{y}$ by using Exponential Series Run a command before & after ubuntu apt upgrade & unattended-upgrades "Notice: Undefined variable", "Notice: Undefined index", and "Notice: Undefined offset" using PHP