The difference between \pgfkeysvalueof and /.store in
What is the correct way to get a pgfkey value?
iPhone 6s with iOS 12.4 not connecting to MacBook Pro mid2015 with macOS 10.14.6 I am using an iPhone 6s with iOS 12.4 and a MacBook Pro mid2015 with macOS 10.14.6. Since recently (I am not exactly sure when it started), I cannot charge the phone with my computer anymore. As soon as I plug the phone in, it will play the charging sound repeatedly. The right-hand side port sometimes works, the lefthand side port never works. When I connect my old iPhone 5 (using the same cable), it charges without any issues. My iPad mini 4 shows the same issue.  Sometimes the "Do you trust this computer" setting flashes on the phone and disappears before I can click anything.   How can I fix this?  Update 1  Sometimes I get the Software Update dialogue in macOS. After approx. 2 minutes it shows the following:     Update 2  For some reason the issue disappeared for a while but is back now. Disabling "Settings" > "Touch ID &amp; Passcode" > "USB Accessoires" seems like it makes the problem a bit less bad, but not go away.  Update 3  This is driving me crazy. I upgraded to Mojave 10.14.3 mostly to get rid of the issue. It persists. Some more random information: Before logging in (Filevault pre-boot authentication), the phone will charge fine. Only when a user account is loaded, the issue appears. The likelihood of a successful connection increases with the battery state of the iPhone. Workaround 2 in my answer below suggest that this a "Trust issue" from the iPhone's side. I suppose the solution will have to be hidden somewhere there...    What I tried so far (will update):   Reset Privacy settings on iPhone Different (original, almost new Apple) lightning cables   Remove and add "iPhone USB" in Network Settings  SMC reset (), PRAM reset Upgrade to latest iOS 12.4 and MacOS 10.14.6 Only Guest User login is Available in my new Dell Vostro Laptop I bought a New Dell Vostro 3558 Laptop today. Ubuntu was pre-installed in that. However, i am facing the below 2 issues in it.   Only Guest user login is available. Linux Terminal is not working in Guest user login   Could someone please advise what i should do now. How did Montague Apparate into the Hogwarts bathroom? In year 5, Fred and George jam Montague into the Vanishing Cabinet. He's found weeks later in a toilet.      ‘He never managed to get all the words out,’ said Fred, ‘due to   the fact that we forced him head-first into that Vanishing Cabinet   on the first floor.’      […]      ‘They’ve found Montague, sir, he’s turned up jammed inside a toilet   on the fourth floor.’   ‘How did he get in there?’ demanded Snape.   ‘I don’t know, sir, he’s a bit confused.’   In year 6 Malfoy expands on that.      ‘I had to mend that broken Vanishing Cabinet that no one’s used for years. The one Montague got lost in last year.’      […]      ‘The other’s in Borgin and Burkes,’ said Malfoy, ‘and they make a kind of passage between them. Montague told me that when he was stuck in the Hogwarts one, he was trapped in limbo but sometimes he could hear what was going on at school, and sometimes what was going on in the shop, as if the Cabinet was travelling between them, but he couldn't make anyone hear him ... in the end he managed to Apparate out, even though he’d never passed his test. He nearly died doing it.   What happened here? Did he Apparate out into Hogwarts, Apparate into Borgin and Burkes and somehow wander back to Hogwarts and get stuck into a toilet? Question: Let $E$ be a normed space. Let $G$ be a closed subspace of $E$ and let $F$ be a finite dimensional subspace of $E$. Show that $F+G$ is a subspace of $E$ and is closed.  I'm having trouble in showing $F+G$ to be closed. I know that $F$ is itself closed and complete, as it is a finite dimensional subspace of a normed space, and that if $F$ were compact that $G+F$ would be closed. I also know that the closed unit ball of any finite dimensional normed space is compact.  I tried two methods. One was to take a convergent sequence $(x_n)_{n \in \mathbb N}$ in $G+F$. Then we can write $x_n = f_n + g_n$ where $f_n$ and $g_n$ are sequences in $F$ and $G$ respectively, and I attempted to find a way to force the individual components $f_n$ and $g_n$ inside the unit ball which would enable me to say that they had convergent subsequences. I couldn't see how to do this, however.   The other thought was to try and show that $F$ is compact, but I don't see a way to do this as I can't imagine it to be simply true without some other conditions on $F$.  Are one of these methods the right way to go? Or should I go another direction? I would appreciate any help I can get, although I would prefer not to be presented with a full proof so that I can do some work for myself. Thanks! Difference between Simple Past and Past Perfect What is the difference in meaning between the two examples below?   When she returned home from office, she was shocked to see that her husband and daughter were missing. (Simple Past)  When she returned home from office, she was shocked to see that her husband and daughter had been missing. (Past Perfect)    FIRST QUESTION: For me example #1 gives only idea of Status of her missing husband and daughter and example #2 gives idea of completed action/situation of missing husband and daughter before she reached home. Is this right? SECOND QUESTION: Is example #2 past perfect or past perfect continuous? I'm trying to find the longest consecutive set of composite numbers Hello and I'm quite new to Math SE.  I am trying to find the largest consecutive sequence of composite numbers. The largest I know is:  $$90, 91, 92, 93, 94, 95, 96$$  I can't make this series any longer because $97$ is prime unfortunately.  I can however, see a certain relation, if suppose we take the numbers like (let $a_1, a_2, a_3,...,a_n$denote digits and not multiplication):  $$a_1a_2a_3...a_n1,\ a_1a_2a_3...a_n2,\ a_1a_2a_3...a_n3,\ a_1a_2a_3...a_n4,\ a_1a_2a_3...a_n5,\ a_1a_2a_3...a_n6,\ a_1a_2a_3...a_n7,\ a_1a_2a_3...a_n8,\ a_1a_2a_3...a_n9,\ a_1a_2a_3...(a_n+1)0$$  The entire list of consecutive natural numbers I showed above can be made composite if:   The number formed by digits $a_1a_2a_3...a_n$ should be a multiple of 3 The numbers $a_1a_2a_3...a_n1$ and $a_1a_2a_3...a_n7$ should be composite numbers   If I didn't clearly convey what I'm trying to say, I mean like, say I want the two numbers (eg: ($121$, $127$) or ($151$, $157$) or ($181$, $187$)) to be both composite.  I'm still quite not equipped with enough knowledge to identify if a random large number is prime or not, so I believe you guys at Math SE can help me out. As far as I know, humans have 23 pairs of chromosomes, each one which contains a particular amount of genes. But in the "last" pair, men have a XY pair chromosome, and women have a XX pair chromosome. Does the missing "leg" of the XY pair make men to have fewer genes than women, and if so, how many genes do each sex have? strip last comma from get_the_category Do we have to tune the number of trees in a random forest? How to Toggle Selected Objects Visibility with H shortcut as in Maya I want to be able to toggle the visibility of selected objects with a shortcut (H) the way you can do in Maya and XSI, shown in the GIF. I'm guessing scrippting is needed. I've tried to do it my self but I'm new to Python and Blender and as soon as the objects are hidden they seem to no longer be in a selection state/list. Eg if I manually select the hidden object/s in the Outliner and try to print the selected object to the console, none seem to be selected. Is this possible to do with the current state of Blender 2.8? Hey all I downloaded this file () but can't seem to be able to uninstall it. I tried looking online as well as the README file but there is only instruction for installing, not uninstalling the package.   Attempted solutions:  sudo apt-get remove laptop_mode   returned   E: Unable to locate package laptop_mode   but when I type in laptop_mode I do get   Unhandled kernel version: 3.13 ('uname -r' = '3.13.0-32-generic')   Is there any way I can uninstall laptop-mode-tools? How exactly does lighting affect combat? I understand that there are different types of lighting (dim, bright, complete darkness), but I haven't been able to find anywhere in the DMH or PHB that specifically describes how these different types of light sources affect combat.   What impact does complete darkness have on players being able to see the locations of the monsters in the room? What impact does complete darkness have on combat rolls against monsters? Could anyone point me to a book/page that contains some more detailed information on this?   Thanks! I have a website the seems to load very slowly. When I run a speed test on it I see there seems to be a 6 secound gap before the HTML loads. Images and JS scripts load very fast after that point.  You can see in the pic below the yellow 'wait time' bars:    This seems to be consistant no matter what the HTML content on the page is.  This site is using a CMS (ModX Revo) so HTML is actually stored in an SQL database and brought forth by PHP, but I've never experienced this issue before.  Would anyone know what is causing this and how I could speed it up? Multi-Question Questions: How Best to Handle Them? Sometimes I come across a question on SO that is actually a number of questions all in one. If these &quot;sub-questions&quot; are closely related, it's not a problem. But if they are only weakly related (or not at all) it gets ugly. I'm now (ironically or hypocritically) going to ask a few questions of my own for the community to respond to:  Do you consider a question made up of a number of weakly-related sub-questions &quot;inappropriate&quot;? Why or why not? How many is too many sub-questions? What do you think is the best way to deal with such questions?  As an example,  I had some discussion about with another user. I will add a more complete version of my response in an answer below, but in short I felt that this question should be closed and many of the questions asked separately. Can you determine a formula for this problem? 1) a ten years old boy is sitting on the couch.      2) a ten year old boy is sitting on the couch.      3) a ten-years old boy is sitting on the couch.      4) a ten-year old boy is sitting on the couch.   Which is correct? How to let `dpkg -i` install dependencies for me? What is the benefit of Krivine's notation? I saw some people uses Krivine's notation for function application when presenting the syntax for the $\lambda$-calculus.  For example, the $\lambda$-term $\lambda f . \lambda x . \lambda y . f\ x\ y$ (with the normal convention that function application associates to the left, so it actually means $\lambda f . \lambda x . \lambda y . ((f\ x)\ y)$) is written $\lambda f . \lambda x . \lambda y . (f)\ x\ y$ (with a similar convention that it actually means $\lambda f . \lambda x . \lambda y . ((f)\ x)\ y$).  I do not see the point of having another pair of parentheses around the innermost $f$.  Why do people use Krivine's notation instead of the usual one? Does Windows use the fastest drive for the page file? Suppose I have a 6 GB page file on an SSD and another 6 GB page file on a traditional mechanical 5400rpm SATA drive.  Does Windows take into account the difference in the performance characteristics between the two drives when deciding which page file to use?  If it matters, I'm asking about Windows 7 and higher.  I reviewed this  but it doesn't appear to factor in the case of dissimilar storage speeds. Eulerian Paths in a Complete Graph $K_5$ As the title suggests, I’m simply looking for a method to compute the number of Eulerian Paths in the complete graph $K_5$, where all paths start from the same node. Since there are 5 nodes, all Eulerian paths must be Eulerian circuits as well.  Thanks.