$(a+\frac{1}{2})^n + (b+ \frac{1}{2})^n$ is an integer for at most finitely many $n$
How do I show that the sum $(a+\frac12)^n+(b+\frac12)^n$ is an integer for only finitely many $n$?
Can we denied permission for synchronized data extension in Salesforce Marketing Cloud, My requirement is, I don't want to allow users to access synchronized data extension either in contact builder or in Subscribers. I'm trying to use the ant migration tool to retrieve all the Custom Metadata records for a single Custom Metadata Type.  However, I can't figure out the syntax.  I would think that something like this would work:    &lt;Package xmlns="http://soap.sforce.com/2006/04/metadata"&gt;     &lt;types&gt;         &lt;members&gt;State_Sales_Tax.*&lt;/members&gt;         &lt;name&gt;CustomMetadata&lt;/name&gt;     &lt;/types&gt;     &lt;types&gt;         &lt;members&gt;State_Sales_Tax__mdt&lt;/members&gt;         &lt;name&gt;CustomObject&lt;/name&gt;     &lt;/types&gt;     &lt;version&gt;36.0&lt;/version&gt; &lt;/Package&gt;   but no dice. I am using the book documentclass and have a list of figures. After  I noticed that there is a blank line to separate figures that are in different chapters, but not if they are within the same chapter. Since I changed the numbering of my figures to be {1, 2, 3, etc.} instead of {2.1, 2.2, 3.1, etc.} this looks silly and I'd rather have a blank line between each figure, no matter what.  How do I do that?  Similar: Is there a rule of integration that corresponds to the quotient rule? What are Salesforce ID's composed of? I remember seeing somewhere that IDs are composed of a few pieces. I always have a hard time trying to find that information when I'm looking for it. What I mean by the above is that the various places in the ID represent different things - for example the first few characters represent what type of sObject it is. What is tail recursion? Whilst starting to learn lisp, I've come across the term tail-recursive. What does it mean exactly? Single service account running all SQL Servers Is there any negative performance impact for using the same service account and agent account to run SQL Server and SQL Agent respectively for all SQL server instances running at a small company of say 35 servers? The biggest database is 0.5 GB. any suggestions are welcome. Thank you. Linking files in g++ I'm wondering how can I simulate a sample of n Weibull distribution lifetimes that include Type I right-censored observations. For instance lets have the n = 3, shape = 3, scale = 1 and the censoring rate = .15, and the censoring time = .88.  I know how to generate a Weibull sample but I do not know how to generate a censored data that have type I right-censored in R.  T = rweibull(3, shape=.5, scale=1) Cycles: How do I exclude the Environment Texture from reflections? In a Cycles scene I have an equirectangular image serving as an Environment Texture background (set in the World settings).  I have a glossy object being partially lit by the Environment Texture, as well as getting reflections from it.  Is there a way I can exclude the Environment Texture from affecting the glossy object completely? I want the image as background wallpaper only. The glossy object should be affected by other objects and lights within the scene: everything except the Environment Texture. I gave a scammer my telephone number, address, and name. How bad is it? Updated question because old one was embarassing: I saw a spam email from "PayPal" and I didn't realize that it was a phishing attempt. I gave the phishing site my name, telephone number, and email. What could he do with them?  Old question: Well, I saw a spam email, but I didn't realize that it's really a scam at first. I gave him my telephone number, address, and name. What would he do with them? Could he ruin ALL of my reputation with it? Does anyone know of a program or way to log all network activity to a specific program on one's computer (program and/or service)?  I know I can see this "live" in Resource Monitor, but I'm wondering if anyone knows of a program or way to track and log all network activity to/from a specific process and/or service.  I'm finding a lot of "live"-type monitors, like Windows Resource Monitor, but nothing that can log. How to execute consecutive commands from history? Suppose I want to execute a sequence of four commands that I have executed before. If the first one is 432 in the command-history, then I could do:  $ !432; !433; !434; !435   I'm curious, is there a more efficient way to accomplish this? xargs and vi - "Input is not from a terminal" Full file date (without GNU utilities) How do I move my website to a new server without interruption to email? opengl storing multiple indices into indices buffer After parsing collada files I found out that we have to load two(or more) indices each pointing to say a vertex or normal etc. like this (&lt;p>3 0 2 0 0 0&lt;/p>)  Is there a way to load (and use)these indices to indices buffer(ELEMENT_ARRAY_BUFFER) like this (vnvnvn...) ; where v is vertex pointer, n is normal pointer from the above. with vertices loaded to VBO1 like (vvvv...) and in VBO2 like (nnnn...). So that we dont have to repeat the normals in VBO2.  VBO like (vnvnvn...) is also ok. (and not something like this ), I'm not trying to use multiple indices buffer. I'm trying to put all the given indices into one index buffer and use them alternately.  (If I wasnt clear i will try for more clarification.) Getting a collection of index values using a LINQ query Is there a better way to do this?  string[] s = {"zero", "one", "two", "three", "four", "five"};  var x =  s .Select((a,i) =&gt; new {Value = a, Index = i}) .Where(b =&gt; b.Value.StartsWith("t")) .Select(c =&gt; c.Index);   i.e. I'm looking for a more efficient or more elegant way to get the positions of the items matching the criteria. How to change default window background color in Windows 10? Prove that the product of four consecutive positive integers plus one is a perfect square I need to prove the following, but I am not able to do it. This is not homework, nor something related to research, but rather something that came up in preparation for an exam.     If $n = 1 + m$, where $m$ is the product of four consecutive positive   integers, prove that $n$ is a perfect square.   Now since $m = p(p+1)(p+2)(p+3)$;     $p = 0, n = 1$ - Perfect Square      $p = 1, n = 25$ - Perfect Square      $p = 2, n = 121$ - Perfect Square   Is there any way to prove the above without induction? My approach was to expand $m = p(p+1)(p+2)(p+3)$ into a 4th degree equation, and then try proving that $n = m + 1$ is a perfect square, but I wasn't able to do it. Any idea if it is possible?