Glut error when compiling in Visual Studio
What is an undefined reference/unresolved external symbol error and how do I fix it?
I'm trying to find a copy of 6.20 to run a diff on a client's Drupal install. I believe there's been changes to core.   How can I get version 6.20? Additionally, how can I download any older Drupal versions? What is the difference between an "API," a "framework," an "IDE," and an "engine?" Why didn't Dumbledore show his memory of Barty Crouch Jr's confession to Cornelius Fudge to confirm his point that Voldemort returned? Wouldn't that just prevent all the mumbo-jumbo happening in the 5th book? Clipping raster with vector boundaries using QGIS In QGIS I would like to clip a raster precipitation layer using an admin boundary layer that is vector data. However the Geoprocessing tools seem to be usable only for vector data. How can I clip this precipitation layer? Natural examples of deformation retracts that are not strong deformation retracts The question  asks for examples of deformation retracts which are not strong deformation retracts. A comment is given refering the asker to Exercise 0.6 in Hatcher. (The description of this space also appears in , which is about this very same exercise.)  This space, however, seems to be constructed specifically for this purpose.     Are there any naturally occurring (by which I mean not constructed specifically for this purpose, arising in some other way) spaces that are deformation retracts but not strong deformation retracts?   The main reason for asking is that it doesn't seem very likely to me that one would stumble upon such a space at random, so I don't know what to watch out for. One can never be too careful. This question was triggered by .  Basically, it goes like this: If you have a weapon with a certain magical effect, let's say the minor property unbreakable (can not be broken, requires special means) or temperate (no harm in temperatures between -20 to 120 F), it can bypass the immunity of something like a Werewolf because it is magical instead of mundane. This goes for any minor property because those properties are under the Magic Items portion of the DMG on pg.143.  How does this differ from a pair of gauntlets with the exact same effect being used as an improvised weapon (emphasis added for clarity) from dealing damage in the same manner to the same Werewolf? Or something that's clearly not a weapon like a Shield of Missile Snaring being used to bash an opponent? Delete from uitableview + write to plist not working Making a logic circuit with only NAND GATES? What is -crf used for in ffmpeg When converting an array of jpegs to a video file (ogg format) I have been using the -crf option.  What are the valid ranges for -crf? Currently I am using 23.    I cannot find the bookmark I read to know what this flag does and I have spent some time Googling around.  These are the arguments I am using at the moment:  -f image2 -r 10 -i " + _sourcePath + @"\img%05d.jpg -crf 18  -y -r 10 " + _destPath + "\\" + _filename + ".ogg" Constructor not defined error in test code How can I tell what RAM will fit my computer? If I want to add more RAM to my computer, how can I buy something compatible? What kinds are there? How do I determine which kind my computer will accept and how much I can add? Is there any way to force SQL Server NOT to mark subscriptions as inactive, ever?  It happens sporadically when there are connection issues and I don't want to have to reinitialize the subscription every time.  Note, I'm not talking about the subscriptions being marked as expired...just as inactive.  We have retention set to 0 (infinite). I'd rather have a big distribution database than have to reinitialize a 15GB database to a subscriber over the WAN. Anyway, the real issue here is that they are getting marked as inactive within just a few hours sometimes...or sometimes a few days...it seems sporadic. Is there any way to tell WHY SQL decided in its wisdom to mark them inactive? Swing's KeyListener and multiple keys pressed at the same time When activating the evolution for a caught Pokemon, it seems to amplify the Combat Power (CP). Thus it seems most beneficial to evolve your Pokemon with the highest CP, if you have multiple of the same kind.   But what I am not sure about is whether it makes an efficiency difference if you spend candies and dust to boost CP before evolving, to gain more from the amplification? Or is it more efficient to just evolve without spending, and then using the leftover candies afterwards, since they now give a bigger CP boost per candy?   I only tested with a Rattata so far, which gained +8 CP per candy before evolving, and +15 CP afterwards. I collected no numbers on the amplification efficiency though, and now ran out of materials for further testing.  Or maybe it is a balanced calculation and makes no difference at all? I would love to have some insight on that.    Some data I collected thus far: (GPC = CP gain per candy)  79 CP Weedle (GPC 6) evolved to: 84 CP Kakuna (GPC 6), evolved at 90 CP to: 297 CP Beedrill    Note: The max-CP "half circle" in the profile stayed filled roughly at the same relative position throughout the evolutions. Prove that if $d \mid n \in \mathbb{N}$, then $\varphi(d) \mid \varphi(n)$. I want to prove that if $d \mid n \in \mathbb{N}$, then $\varphi(d) \mid \varphi(n)$.  It's given that $d \mid n$, so we know that $n = dm$, for some $m \in \mathbb{Z}$. Now, I want to show that $\varphi(d) \mid \varphi(n)$, i.e. that $\varphi(n) = k\varphi(d)$, for some $k \in \mathbb{Z}$. Drawing a blank of where to go from here. For example, the square can be described with the equation $|x| + |y| = 1$. So is there a general equation that can describe a regular polygon (in the 2D Cartesian plane?), given the number of sides required?  Using the Wolfram Alpha site, this input gave an almost-square: PolarPlot(0.75 + ArcSin(Sin(2x+Pi/2))/(Sin(2x+Pi/2)*(Pi/4))) (x from 0 to 2Pi)  This input gave an almost-octagon: PolarPlot(0.75 + ArcSin(Sin(4x+Pi/2))/(Sin(4x+Pi/2)*Pi^2)) (x from 0 to 2Pi)  The idea is that as the number of sides in a regular polygon goes to infinity, the regular polygon approaches a circle. Since a circle can be described by an equation, can a regular polygon be described by one too? For our purposes, this is a regular convex polygon (triangle, square, pentagon, hexagon and so on).  It can be assumed that the centre of the regular polygon is at the origin $(0,0)$, and the radius is $1$ unit.  If there's no such equation, can the non-existence be proven? If there are equations, but only for certain polygons (for example, only for $n &lt; 7$ or something), can those equations be provided? S1300I scanner issues under Ubuntu 16.04 using Sane In theory this scanner does work under Linux and Ubuntu.  I've found this document that I tried to follow.    I install sane, copy firmware, confirm the location in the config etc.  Everything looks good.  Potential problem areas  sudo sane-find-scanner   output:  # sane-find-scanner will now attempt to detect your scanner. If the # result is different from what you expected, first make sure your # scanner is powered up and properly connected to your computer.  found SCSI processor "Marvell 91xx Config 1.01" at /dev/sg5 # Your SCSI scanner was detected. It may or may not be supported by SANE. Try # scanimage -L and read the backend's manpage.  could not fetch string descriptor: Pipe error could not fetch string descriptor: Pipe error found USB scanner (vendor=0x04c5 [FUJITSU], product=0x128d [ScanSnap S1300i]) at    libusb:005:007 could not fetch string descriptor: Pipe error # Your USB scanner was (probably) detected. It may or may not be supported by # SANE. Try scanimage -L and read the backend's manpage.  # Not checking for parallel port scanners.  # Most Scanners connected to the parallel port or other proprietary ports # can't be detected by this program.   Okay.  So the scanner is detected and listed, it prints a bunch of extra noise that   # scanimage -L  No scanners were identified. If you were expecting something different, check that the scanner is plugged in, turned on and detected by the sane-find-scanner tool (if appropriate). Please read the documentation which came with this software (README, FAQ, manpages).   Okay, let's verify the firmware files:  ls -lh  /usr/share/sane/epjitsu  total 136K -rw-r----- 1 root root 65K Jan  1 17:49 1300_0C26.nal -rw-r----- 1 root root 65K Jan  1 17:49 300_0C00.nal   Looking at the configuration file: (snippets)  # Fujitsu S300 firmware /usr/share/sane/epjitsu/300_0C00.nal usb 0x04c5 0x1156  # Fujitsu S1300 firmware /usr/share/sane/epjitsu/1300_0C26.nal usb 0x04c5 0x11ed   Last thing I tried was to pull the line from sane-find-scanner and update the config  sane-find-scanner returns a different product ID.   I updated the config file above, restarted the sane service, I ran scanimage -L still, scanner not detected.  For reference I had this working on this same computer under a virtualbox VM.  If I can get it to work under windows that would be ideal.  Any suggestion would be much appreciated.    Update: I revisited the behavior after adding the 1300i firmware and it's still not working but.  Once in a while when I do run this is the output.  If I run it again it'll fail.  scanimage -L device `epjitsu:libusb:005:008' is a FUJITSU ScanSnap S1300i scanner   also sudo gscan2pdf and sudo simple-scan both fail to detect a scanner.  It fails with and without sudo permissions. How often is the password asked for sudo commands? Where can I set it up? Sorting citations using \cites command in biblatex I am using biblatex for citations and bibliography. Now I often have lists of multiple citations, for which biblatex has the \cites command. Now I can get citations to automatically sort if I don't want page numbers, but I cannot get it right with page numbers.  What I want is all citation ordered chronological (oldest first). Is this possible, or must I just do this by hand?  Here is an example.  \documentclass[11pt,oneside]{memoir}  \usepackage[     style=authortitle,     useprefix=false,     maxnames=2,     firstinits=true,     sortcites=true,     uniquename=init,     abbreviate=true,     backend=biber,     sorting=ynt ]{biblatex}  \begin{filecontents}{jobname.bib} @book{tom1,   author = {Author, A.},   year = {2001},   title = {This book is from 2001},   shorttitle = {2001}, } @book{tom2,   author = {Author, A.},   year = {1999},   title = {This book is from 1999},   shorttitle = {1999}, } \end{filecontents}  \addbibresource{jobname.bib}   \begin{document} This one is corrent.\footnote{\Cites{tom1,tom2}.} This one is corrent.\footnote{\Cite{tom1,tom2}.}   This one is incorrent.\footnote{\Cites{tom1}{tom2}.} This one is incorrent.\footnote{\Cites[1]{tom1}[12]{tom2}.} \end{document} 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?