Unable to change virtual machine power state: This host supports AMD-V, but AMD-V is disabled When I try to run VMware, I'm getting     Unable to change virtual machine power state: This host supports AMD-V, but AMD-V is disabled.   AMD-V might be disabled if it has been disabled in the BIOS/firmware settings or the host has not been power-cycled since changing this setting.
AMD-V is not enabled in VirtualBox on AMD APU I am running on a dual core AMD E450 CPU. When I tried to run a 64-bit OS that requires hardware virtualization using VirtualBox, it showed me an error message that "AMD-V is not enabled".    My AMD processor is supposed provide AMD-V support, but I can find no option for enabling AMD-V in BIOS.    How can I solve this problem? How can I enable AMD-V for my CPU?  Thanks in advance  lscpu :-  Architecture:          x86_64 CPU op-mode(s):        32-bit, 64-bit Byte Order:            Little Endian CPU(s):                2 On-line CPU(s) list:   0,1 Thread(s) per core:    1 Core(s) per socket:    2 Socket(s):             1 NUMA node(s):          1 Vendor ID:             AuthenticAMD CPU family:            20 Model:                 2 Stepping:              0 CPU MHz:               1650.000 BogoMIPS:              3291.72 Virtualization:        AMD-V L1d cache:             32K L1i cache:             32K L2 cache:              512K NUMA node0 CPU(s):     0,1   EDITED:-  Error message from VirtualBox:-  Failed to open a session for the virtual machine XXX.  AMD-V is disabled in the BIOS. (VERR_SVM_DISABLED).  Result Code: NS_ERROR_FAILURE (0x80004005) Component: Console Interface: IConsole {1968b7d3-e3bf-4ceb-99e0-cb7c913317bb}
If $n$ is a natural number $\ge 2$ how do I prove that any graph with $n$ vertices has at least two vertices of the same degree? Any help would be appreciated.  If $n$ is a natural number $\ge 2$ how do I prove that any graph with $n$ vertices has at least two vertices of the same degree? . If you filter out a range of wavelengths, how can you calculate the energy from the remaining wavelengths?   To make it concrete, say we filter everything below 450nm or alternatively above 700nm. Splicing a Javascript array from within the callback passed to forEach What's the current state of LaTeX3 (2020)? There are a few questions on this forum asking about why Latex3 is taking so long to come out. However, all of these are from the early 2010s. I'm just wondering what the current state of the project is and whether it's ready (or nearly ready) for prime time? The Windows 10 April 2018 Update includes a new feature called Timeline which tacks the activities and allows you to see what you have done earlier, sends it to Microsoft servers, so that you can resume work on a 2nd device, which is connected to the same Microsoft account when you press the Tasks View button in the taskbar:    How can I disable the Timeline because I don't want that my activity gets tracked? How to open and repair an m4v or mp4 video file? Yesterday I was filming a scene with my phone but suddenly the application crashed and when I try to open the m4v generated it says that is corrupted.  I have downloaded the video files (around 36MB) on my PC and I am trying to open and repair it. Can you suggest me a way to do it?  FFMPEG info  As suggested in comments I try check what FFMPEG says me about that file with this command  ffmpeg.exe -i VID_20120425_144739.m4v -c:v copy -c:a copy out.mp4 2&gt; log.txt   Here it is the result:  ffmpeg version N-40126-ga4b58fd Copyright (c) 2000-2012 the FFmpeg developers   built on Apr 26 2012 03:29:50 with gcc 4.6.3   configuration: --enable-gpl --enable-version3 --disable-w32threads --enable-runtime-cpudetect --enable-avisynth --enable-bzlib --enable-frei0r --enable-libass --enable-libcelt --enable-libopencore-amrnb --enable-libopencore-amrwb --enable-libfreetype --enable-libgsm --enable-libmp3lame --enable-libnut --enable-libopenjpeg --enable-librtmp --enable-libschroedinger --enable-libspeex --enable-libtheora --enable-libutvideo --enable-libvo-aacenc --enable-libvo-amrwbenc --enable-libvorbis --enable-libvpx --enable-libx264 --enable-libxavs --enable-libxvid --enable-zlib   libavutil      51. 47.100 / 51. 47.100   libavcodec     54. 15.100 / 54. 15.100   libavformat    54.  3.100 / 54.  3.100   libavdevice    53.  4.100 / 53.  4.100   libavfilter     2. 72.100 /  2. 72.100   libswscale      2.  1.100 /  2.  1.100   libswresample   0. 11.100 /  0. 11.100   libpostproc    52.  0.100 / 52.  0.100 [mov,mp4,m4a,3gp,3g2,mj2 @ 003fc940] moov atom not found VID_20120425_144739.m4v: Invalid data found when processing input   Latest two lines are displayed in red. Several responses to a question  suggested I try Opera kiosk mode, so I decided to download it and give it a try. Once the download had completed and the disk image was being verified, Safari hung for over a minute and there were periods where Safari used a very high %CPU:    In Mac OS X 10.5, I was accustomed to seeing Safari freeze, but it never used up more than 200% CPU (2 cores x 100%). Is this a bug in Activity Monitor? Or does this mean that %CPU is now more akin to ? Adding x and y values while creating a label QGIS I'm trying to create a label on a map in QGIS.  I can open the setting where there are an X and Y button and a few other properties, like opacity and distance.  I'm pretty sure the problem is that I need to enter the proper X and Y coordinate here, but I don't know how to get to where it lets you enter the coordinates. How to run Bash script on startup on Linux? I am running Linux 4.9.11-1.0.0 on my iMX7 dual development board. I have a test.sh file that I would like to run at startup. It currently only has a bunch of echo statements in it (just for testing purposes).   When I flick the switch on the board to turn it on, I see a bunch of initialization stuff come up. I would like the echo statements in my test.sh file to also be displayed in this initialization sequence on startup. Eventually once this is working, the plan is to do real stuff in place of the simple echo statements. I just want to make sure the script is running on startup at this point.  So far I have created the test.sh file and I am able to run it manually after the board has booted up. I have added the following to my /etc/rc.local file before the exit statement at the end:  sh '/home/root/test.sh'   I have verified that this rc.local file has #!/bin/sh -e at the top. I have also done:  $ chown root /etc/rc.local $ chmod 777 /etc/rc.local   Once this was all done, I verified that it should be working properly by typing:  $ /etc/init.d/rc.local start   Everything is working as expected up until this point and I am seeing the echo statements when I do that last step. However, when I go and try to reboot the board, I do not see the echo statements at all in the printed initialization stuff.  What am I missing? Maybe it is actually running on startup but I just don't see the output for some reason? I'm finishing professional school and over the years have acquired a pile of notes and articles that I'd like to hang onto.  I'd like to add to them and create sort of an archive of article and files that may be useful down the road.  I'd also like to organize this collection of files not only by simple grouping but also with tags.  I feel like that will make searching through them years later much easier.  Suggestions on software that would be good for this?  Just a general file manager, something that uses tags that can be attached to each file? Isomorphism of a product $C_n \times C_m$ of cyclic groups with the cyclic group $C_{mn}$ Given that $C_n$ is a cyclic group of order $n$, what conditions must integers $n$ and $m$ satisfy such that the group $C_n \times C_m$ is isomorphic to C$_{mn}$?   So I attempted to investigate a few lower-order cyclic groups to find a pattern. In particular, I looked at $C_2 \times C_3$ and compared it to $C_6$. Here are a couple of diagrams:  $C_2 \times C_3$ -   $C_6$ -   They Cayley tables look pretty different (identity elements are all over the place for $C_2 \times C_3$) so I concluded that they are not isomorphic.  I did the same for $C_2 \times C_4$ and $C_8$:  $C_2 \times C_4$ -   $C_8$ -   Again, I arrived at the conclusion that the 2 groups are not isomorphic due to their Cayley table structure.  It seems I'm stuck now. Are my conclusions wrong for the examples I examined? If so, how do I find the conditions for the general case of comparing $C_m \times C_n$ with $C_{mn}$? How do I clone a generic List in Java? If $a_k\geq0$ is a decreasing sequence converging to $0$, do we have $\lim_{n\to\infty}\frac{\sum_{k=1}^n a_k}n = 0$? Let $a_k\geq 0$ be a non-increasing sequence satisfying $\lim_{k\to\infty} a_k = 0$. Is it always true that $$\lim_{n\to\infty} \frac{\sum_{k=1}^n a_k}n=0$$ ?  I tried proving with "brute force" but failed: Let $\varepsilon&gt;0$. Then there exists a $K\in\mathbb N$ such that $a_k\le\varepsilon$ for all $k\geq K$. Let $C=\sum_{k=1}^K a_k$. We have $$\frac{\sum_{k=1}^{\left\lceil\frac C\varepsilon\right\rceil}a_k}{\left\lceil\frac C\varepsilon\right\rceil}=\frac{C}{\left\lceil\frac C\varepsilon\right\rceil}+\sum_{k=K+1}^{\left\lceil\frac C\varepsilon\right\rceil} a_k\le \varepsilon +\varepsilon\cdot\left( \left\lceil\frac C\varepsilon\right\rceil-K\right).$$  However, this is not good, as the right-hand side depends on $C$, which can get large for small $\varepsilon$.   Also, numerical computations for example with $a_k=\frac1{\log\log k}$ seem to confirm the statement though...  (Additionally, note that I didn't use the non-increasing fact, but I am not sure if it is needed.) Trace of a commutator is zero - but what about the commutator of $x$ and $p$? Operators can be cyclically interchanged inside a trace: $${\rm Tr} (AB)~=~{\rm Tr} (BA).$$ This means the trace of a commutator of any two operators is zero: $${\rm Tr} ([A,B])~=~0.$$ But what about the commutator of the position and momentum operators for a quantum particle? On the one hand: $${\rm Tr}([x,p])~=~0,$$ while on the other hand: $$[x,p]~=~i\hbar.$$ How does this work out? Does the plastic cap on a Presta valve serve any purpose once fitted to a rim? I can see the use of the valve cap on a Presta valve when the tube is still packaged (it obviously stops the valve puncturing the tube), but does it do anything except look pretty (or not) once you've fitted the tube to a rim?  I've kept them on out of habit, because I've had problems with sticking Schrader valves in the past when I've lost the caps and dirt/grime has got in there - but the design of Presta valves suggests to me that they wouldn't suffer this fate.  Given that I really need to , is replacing this cap something I can leave out of my daily chores? How can I find $\gcd(a^m+1,a^n+1)$ with $a,m,n$ positive integers? How can I find $\gcd(a^m+1,a^n+1)$ with $a,m,n$ positive integers?    I have this idea:  Let $d=\gcd(m,n)$. Then there exist positive integers $x,y$ such that $mx-ny=d$ (WLOG). We shall find $G=\gcd(a^m+1,a^n+1)$.  If $m,n$ are odd, then $d$ is odd, therefore one and only one of $x,y$ is even. We have:  $$a^{ny}(a^d+1)=a^{mx}+a^{ny}=(a^{mx}-1)+(a^{ny}+1)=(a^{mx}+1)+(a^{ny}-1).$$  If $x$ is even and $y$ is odd, then $a^{m}+1\mid a^{mx}-1$ and $a^{n}+1\mid a^{ny}+1$, therefore $G\mid a^{ny}(a^d+1)$. If $x$ is odd and $y$ is even, then $a^{m}+1\mid a^{mx}+1$ and $a^{n}+1\mid a^{ny}-1$, thus $G\mid a^{ny}(a^d+1)$. However, since $\gcd(a^m+1,a^{ny})=\gcd(a^n+1,a^{ny})=1$, so $\gcd(G,a^{ny})=1$, hence $G\mid a^d+1$. We also have $a^d+1\mid a^{m}+1$ and $a^d+1\mid a^{n}+1$, so $a^d+1\mid G$. Thus $G=a^d+1$.  If $v_2(m)=v_2(n)=v_2(d)=k&gt;1$, then there exist some odd numbers $m_1,n_1,d_1$ such that $m=2^km_1,n=2^kn_1,d=2^kd_1$. We shall have $m_1x-n_1y=d_1$, so one and only one of $x,y$ is even, and we can use the same argument when $m,n$ are odd, so $G=a^d+1$.  However, if $v_2(m) \neq v_2(n)$, I cannot find any solutions for this. I think that $G \in \{1,2\}$, but I cannot prove or disprove it. How can I find $G=\gcd(a^m+1,a^n+1)$ if $v_2(m) \neq v_2(n)$ ? Moreover, is there anything from my arguments that can be improved ? Laws and theories What is a , a , and what is the relationship among them?  I know this is a very basic question, so any reference to epistemology will be greatly appreciated :) My very simple Greasemonkey script is not running? INSERT takes over 5 hours, when inserting more than specific number of rows When inserting less then about 1,350,000 rows to the table it all takes about 2 minutes, however when number of inserted rows is bigger, then the time needed to insert data grows to about 5 hours.  The problem is not connected with query or indexes, because everything has been working fine for a long time and nothing has changed in the structure of query, tables or indexes.   Problem appeared for the first time about 2 weeks ago and it appears repeatedly on days, when number of inserted rows is bigger than +-1,350,000. For example on one day number of inserted rows is 1,200,000 and the process takes 2 minutes, on the other day number of rows is 1,450,000 and it takes 5-6 hours to insert data.  I tried to rebuild indexes, but it has not helped. File permissions and saving Let's say you open a file on which you have write permission. Meanwhile you change permissions and remove write permission while you still have the file open in some editor.  What will happen if you edit and save it?