Reviewing someone's code, in a non-static class, I noticed there were only private static methods. So those are used internally in its class.   interface IDogInterface {     void Bark(bool isBarking); }  public class GoldenRevier : IDogInterface {     public void Bark(bool isBarking)     {         //Implementation...          SomeMethod();         SomeOtherMethod();         AnotherMethod();     }      private static void SomeMethod();     private static void SomeOtherMethod();     private static void AnotherMethod(); }   Note: there are no static attributes, no getters or setters, only what you saw in the above code.  Why would you make those internal methods static ? I see no benefit doing this.  I see bad logic in the above code... Am I missing something ?  EDIT:  Code edit to highlight the accepted answer meaning.  public class GoldenRevier : IDogInterface {     private Bark _bark = new Bark();      public void Bark(bool isBarking)     {         if(isBarking)         {             _bark.SetLoudness(5);             _bark.Start();         }         else         {             JustChilling();         }     }      private static void JustChilling()      {           Console.Write("No barking today, just chilling!");     } }
ReSharper likes to point out multiple functions per ASP.NET page that could be made static. Does it help me if I do make them static? Should I make them static and move them to a utility class?
Counterexample to Leibniz criterion for alternating series I have this statement and I need to say if it is true or false:  Let $\{a_n\}$ be a real sequence.  $$\lim_{n\to +\infty} a_n = 0 \quad \implies \quad \sum_{n=1}^{\infty}(-1)^na_n \quad \text{converges}$$  I know, from the Leibniz criterion that:     If $a_n \to 0$, $a_n$ is decreasing and positive then $\sum_{n=1}^{\infty}(-1)^na_n$ converges   From this fact I believe that the statement is false but I couldn't come up with an infinitesimal sequence that isn't decreasing and for that reason is divergent. I tried some function with $sin(\frac{1}{n})$ without any luck. Any help would be very appreciated, thank you! I have downloaded Aptana Studio 3 and created the following launcher item for using Alacarte:  file: alacarte-made.desktop  [Desktop Entry] Comment= Terminal=false Name=Aptana Studio 3 Exec=AptanaStudio3 Type=Application Icon=/opt/Aptana-Studio-3/icon.xpm   Then, when I add the icon to the favorites and opens the Aptana Studio 3 I get two icons for it, one for launching new instances, and one for the currently running instance as per the following screenshot:    How do I force the application to use the same icon added to the favorites? Change of flavour, Weak interaction I couldn't find a straight and clear answer to this question on the internet: Why is the weak interaction (charged), the only interaction which can change the flavours of the quarks? I need to calculate no of possible substrings containing "00" as a substring. I know the length of the binary string.  Eg: for a string of length 4, possible substrings are: 0000 0001 0010 0011 0100 1000 1001 1100  I just need the number of possible combinations, not enumerate all of them. There are two different commands to incorporate another file into the source of some document, \input and \include. When should I use one or the other? What are the differences between them? Are there more things like them to be aware of? How can I view the contents of tar.gz file without extracting from the command-line? I want to see the contents (list of files and folders) of an archive, for example a  tar.gz file without extracting it.  Are there any methods for doing that? Using a naked black hole as a mirror? The YouTube video is a good example how the gravity of this merging binary black holes bend light around themselves. "python" not recognized as a command How to Straighten Curved UVs into Straight Belt Showing the actual 3D model of a curving ramp.  Shows the UVs of that model that blender did automatically. Shows the UV image that I need.   I am going put a road texture on it., but round faces are not helping me at all. All I need is straight belt kind of UV. Is there an official rule that the minimum damage can't be negative? A slightly humorous thought occurred to me (a recovering rules lawyer) after reading .     "None of the answers actually specify that 0 is the minimum damage."   Logically it wouldn't make sense for an attack to apply negative damage or healing, except in specific cases like hitting a flame elemental with a fire attack. Ruling that you could do negative damage would lead to an exploit to avoid costs of healing. As such I highly doubt any DM would make such a ruling. I definitely wouldn't except for the most absurd and humorous of games were failure is the expected result not success.  Another possibility (as suggested by Secespitus) is that negative damage would reflect back on the attacker. This could be seen as punching a strongman so hard (or in just the wrong way) as to injure your own hand.  This would also play well in a failure is the only option game, and if there is a rule suggesting that it would be an appropriate answer to this question as well.  Take the case of a person with less than 8 Strength, no levels in monk, and does not have a tavern brawler.  Would they do -1(1 - 2) damage on unarmed strikes? If so what would the result of the negative damage be?   "Healing" the target because such a puny hit actually raises their fighting spirits and makes them more capable of fighting Reflective Damage, the attacker actually takes 1 point of damage, representing injury to his hand or other damage   I am curious to know if there is an official rule stating that the minimum damage an attack can do is 0 or is there something in the damage calculation that I am missing that would otherwise prevent negative damage? How do I determine the size of an object in Python? Proof that every repeating decimal is rational Explanation of terminal objects using limits I understand terminal objects, but I falter when trying to achieve them using the approach of diagrams, the category of constant diagrams $\mathcal{C}^{\mathcal{J}}$ and limits.  I have the empty category 0, now I have a diagram $D: \mathcal{J} \to \mathcal{C}$. However this diagrams image should be empty, because there are no objects or morphisms to map. At this point, I'm confused, because I can't get to the universal property $\forall c \in \mathcal{C}. \exists! f: c \to T$ anymore, because I'm missing T. (EDIT: I get that this is how it is supposed to be)  But continuing with the category of constant diagrams, even if I have a constant diagram mapping everything to one object / morphism, there is nothing to map, so the functors image is still empty. So now I'm missing both $T$, and any kind of $c$.  EDIT: It seems to me, have I chosen 1, instead of 0, I would have come up with that is considered the definition of the terminal category. What am I missing? What is the meaning of p values and t values in statistical tests? After taking a statistics course and then trying to help fellow students, I noticed one subject that inspires much head-desk banging is interpreting the results of statistical hypothesis tests.  It seems that students easily learn how to perform the calculations required by a given test but get hung up on interpreting the results.  Many computerized tools report test results in terms of "p values" or "t values".  How would you explain the following points to college students taking their first course in statistics:   What does a "p-value" mean in relation to the hypothesis being tested?  Are there cases when one should be looking for a high p-value or a low p-value? What is the relationship between a p-value and a t-value? What is a general rule for use of auxiliary verbs in sentence? Should we duplicate it or not? For instance,     It is available for every item and (is) used with . . . What is the strict aliasing rule? When asking about , people sometimes refer to the strict aliasing rule. What are they talking about? Is it posible to upload file in Lists Attachments in SharePoint in custom way For a graph $G$, let $W$ be the (random) vertex occupied at the ﬁrst time the random walk has visited every vertex. That is, $W$ is the last new vertex to be visited by the random walk. Prove the following remarkable fact:      For the   random walk on an $n$-cycle, $W$ is uniformly distributed over all vertices different   from the starting vertex. Testing points in PCB How do I prove the following statement by induction?  $$n^2 \lt 2^n$$  $P(n)$ is the statement $n^2 \lt 2^n$  Claim: For all $n \gt k$, where $k$ is any integer, $P(n)$  (since $k$ is any integer, I assume I have to prove this for positive and negative integers)  So let base case be $P(1)$, and I have to prove $P(n)$ for $n \ge 1$ and $n \lt 1$  $P(1)$ is $1^2 \lt 2^1$ which is clearly true.  Induction hypothesis: $k^2 \lt 2^k$  Inductive step $(k+1)^2 \lt 2^{(k+1)}$  $(k+1)^2 = k^2 + 2k + 1$  $k^2 + 2k + 1 \lt 2^k + 2k + 1$ by inductive hypothesis  Not sure how to proceed. Is my previous intuition that I have to prove this for $n \ge 1$ and $n \lt 1$ correct?