For example,     int len1=strlen(string);       size_t len1 = strlen(string1)   Does using size_t make any difference in the compiler behavior or code run time or difference in memory? I absolutely know about the difference, which was answered previously in another thread, but I am concerned about RAM behaviour.
I notice that modern C and C++ code seems to use size_t instead of int/unsigned int pretty much everywhere - from parameters for C string functions to the STL.  I am curious as to the reason for this and the benefits it brings.
Let $a&gt;0$, show that for $x&gt;0$, $1&lt;f(x)&lt;2$, where $$f(x)=\frac{1}{\sqrt{1+x}}+\frac{1}{\sqrt{1+a}}+\sqrt{\frac{ax}{ax+8}}$$  I could take the derivative, find the maximum of the function and conclude. But that involves heady algebra and you have to solve a high degree polynomial. Is there an easier way simply using inequalities? Thanks, much appreciated Outlining in Blender? I am currently working on converting my logo vectored as a SVG to a 3D model using the 2.72 version. I ran into a problem with my logo because it contains a black stroke and an orange stroke (see both images below), but currently all I have is the interior color of each shape. I was wondering whether or not there was a simple way to add in these strokes, and how exactly to go about creating the strokes. Thank you in advance community! How to change boot priority? Escaping quotes in zsh alias Following on from  about stripping newlines out of text, I want to turn this into a zsh alias as follows:  alias striplines=' awk " /^$/ {print \"\n\"; } /./ {printf( \" %s \",$0);}"'   I've tried escaping the quotes inside the awk script, but I'm getting this error:  awk: (FILENAME=bspsrobustness FNR=1) fatal: division by zero attempted   (The file is called bspsrobustness)  Is there a way to do what I want? I suppose I could turn this into an awk script rather than a zsh alias, is that my best option? Is is possible to skip the confirmation step while adding a repository? When I add a repository by running  sudo add-apt-repository ppa:ubuntu-x-swat/x-updates   It outputs this dialog:  Updated versions of X.org drivers, libraries, etc. for Ubuntu.  This PPA is for stable upstream releases of X.org components.  If you're looking for something even more bleeding-edge, please see the xorg-edgers PPA.  While Ubuntu does not "officially/formally" support these packages, if you discover problems when installing these debs please feel free to report bugs to launchpad.  However, please make sure to clearly state that you are running packages from this PPA so we know the fixes need to come here.  If you are upgrading from one release to another with this PPA activated, please install the ppa-purge package and use it to downgrade everything in here beforehand. sudo ppa-purge ppa:ubuntu-x-swat/x-updates will do it.  [Directions for packaging drivers can be seen at https://wiki.ubuntu.com/X/DriverBuilding]  More info: https://launchpad.net/~ubuntu-x-swat/+archive/x-updates Press [ENTER] to continue or ctrl-c to cancel adding it   I want to skip the confirmation step  Press [ENTER] to continue or ctrl-c to cancel adding it   How can I automatically confirm the addition of a PPA? Via command line, I have a log file I'd like to keep track of.  What I want is to have, basically, a tail that refreshes when the log is updated making the text scroll upwards as new lines are appended to the log file.  Is there anything out there that does that without having to write some code? Proving $1^3+ 2^3 + \cdots + n^3 = \left(\frac{n(n+1)}{2}\right)^2$ using induction How can I prove that     $$1^3+ 2^3 + \cdots + n^3 = \left(\frac{n(n+1)}{2}\right)^2$$    for all $n \in \mathbb{N}$? I am looking for a proof using mathematical induction.  Thanks Card game probability 3 players I don’t know how to handle this 3 players case, may anyone give a hand? Thanks!     When playing card game, there are 3 players playing 32 cards, each   receive 10 cards, 2 remind on the table. Overall are 4 aces and 4   kings in the game. How likely is P (E | D)? D = "The table remains 2   aces" E = "I (at least) get one king".   I guess I should have steps as follows.   P(E) = P(1King)+P(2K)+P(3K)+P(4K) P(D) = (4/32) * (4/32) = 1/256 P (E | D) = P(E) + P(D)   Equations may be used:  Counting combinations      The number of combinations of n objects taken r at a time is     nCr = n(n - 1)(n - 2) . . . (n - r + 1)/r! = n! / r!(n - r)!                 Number of favorable outcomes P(I) =     Total number of possible outcome Add an unnmbered section to the table of Contents in Lyx Cannot do a `composer install` even though my minimum stability is listed as dev I am trying to build the master branch in my project after updating to 8.5.0, but am being met with an error from composer (which I did not get on my develop branch):     The requested package drupal/focal_point 1.0.0-beta6 is satisfiable by   drupal/focal_point[1.0.0-beta6] but these conflict with your   requirements or minimum-stability.   In my composer file, I have:  "drupal/focal_point": "^1.0",   as well as:  "minimum-stability": "dev",   How can I fix this so TravisCI gets unstuck? It worked fine for the develop branch, and the master is now updated with it. Finding Command-Line Arguments of Programs I know that unix has man pages, but is there a place I can look to discover command-line arguments of programs? Going to command prompt and typing notepad /? doesn't give anything. TikZ or cryptocode package for cryptographic protocol diagrams limit of the sequence $a_n=1+\frac{1}{a_{n-1}}$ and $a_1=1$ How to remove RVM (Ruby Version Manager) from my system I recently installed Ubuntu 11.10 (new install). I would like to use the Adwaita theme with Unity, but it seems that it is not available in the theme selection dialog. I know I get it there after installing gnome-shell, but is there a way to use Adwaita theme for Unity without installing gnome-shell? Theorem numbering I am trying to number my theorems, corollaries, Lemmas, Propositions, Definitions, Remarks etc. I put the following code:  \theoremstyle{theorem}  \newtheorem{theorem}{Theorem}[section] \newtheorem{corollary}{Corollary}[theorem] \newtheorem{lemma}[theorem]{Lemma} \newtheorem{proposition}[theorem]{Proposition}  \theoremstyle{definition} \newtheorem{definition}{Definition}[section] \newtheorem{example}{Example}[definition]  \theoremstyle{remark}     \newtheorem{remark}{Remark}[section]   I want to produce the following:  theorem 1.1  proposition 1.2  definition 1.3  example 1.4  remark 1.5  lemma 1.6  but the code above gives me  theorem 1.1  definition 1.1  remark 1.1  lemma 1.2  Can anyone tell me if there is a code that numbers all these respectively? Writing a list to a file with Python I found a problem with an application on Ubuntu.   Questions :   How do I best report the issue?  What sort of information should I provide? Explicit formulas for Stirling numbers of second kind I have seen some recursive formulas for Stirling I and II kind but I am especially interested in explicit formulas.  I was thinking and get: $$ \left\{ {m \atop n} \right\} =  \sum_{k_i&gt;0 \wedge k_1+k_2+...+k_n = m} \frac{m!}{n!}\cdot \frac{1}{k_1! \cdot k_2! \cdot ... \cdot k_n!}$$ I am not sure if it is ok but supposedly it is (I created it with combinatorics interpretation)  Can somebody look at that and tell me if it is ok/wrong?  By the way,if you have some nice formulas, I will be grateful for sharing that. Why is the net speed of Stack Overflow so fast? This question is about the net speed.  I'm from China, and I find that opening pages on Stack Overflow is very fast, normally within a range of 1 to 4 seconds. This speed is very good for a website outside China; it's even faster than some native websites.  Not every website outside China has such good speed, so I am wondering why and how Stack Overflow manages to be so quick.