I have been creating some C programs and I have saved them to my Home directory while editing. I have compiled them with gcc and then run the executable file with ./ and they work fine. However, when the programs are ready, I take the executables to another directory in another partition of my hard drive where I store my personal files, but when I try to run them from this new location, the terminal prompts the message "Permission denied".   Is there any way that I can run the programs from any location I store them, other than the Home directory?  Thanks in advance for your help.
I have this problem: I'm used to compile and run .c files with CodeBlocks. If I do that from my Desktop (ext4 partition) it works without problems, but doing this from my secondary hard drive (NTFS partition) makes CodeBlocks to say permission denied while running a .c file.  I have read it's because of the partition type is it correct? But I don't know how to solve it. I tried to edit fstab (sudo gedit /etc/fstab) adding this line:   /dev/sda /media/Dati ntfs user,exec 0 1   but after rebooting Ubuntu I had a warning on boot about a problem mounting a drive, that's because I set KDE to auto mount my Dati drive on boot.   So I should auto mount my NTFS drive with execute permission? How can I do that?
How to fix pagination for custom loops? I have added a custom/secondary query to a template file/custom page template; how can I make WordPress use my custom query for pagination, instead of using the main query loop's pagination?  Addendum  I have modified the main loop query via . Why isn't pagination working, and how do I fix it? Factoring $x^n + y^n$ over the integers Is there a way to change the process group of a running process? Is there a way to change PID, PPID, SID of a running process? It would make sense for the answer to be no, but I'd like to make sure. For multiple OTP keys, why not do this:  Key = Hash[(EC)DH Shared Secret + Counter]  The counter will increase per message, and the output of the hash will be random for each new unique input into it. What are the problems or weaknesses with this design??  EDIT: For clarification: both parties will have the shared secret from an ECDH exchange, random numbers from Pythons os.urandom for generating the ECC key The shellscript is very simple:  retroarch $* -c /tmp/retroarch/Data/retroarch/gambatte.cfg   ("retroarch" is another shellscript)  If the filename passed contains spaces it fails:  RetroArch [ERROR] :: Could not read ROM file. Birthday Problem applied to collisions I'm trying to extend the birthday problem to detect collision probability in a hashing scheme. Here is my problem. I use the letters and numbers [A-Z][a-z][0-9] to make a set of keys by randomly choosing from that set 10 times and concatenating them all together. So A24cv30kf2 could be one key for example. This implies that the base set has $62^{10}$ possible keys. Next, I want to compute the probability that I would see a collision if I picked a key from that set and issued it to $n$ users. If $M$ represents the size of the set (= $62^{10}$) and $P(M,n)$ the probability then  $$P(M,n) = \frac{M!}{M^{n}(M-n)!}$$  This follows by replacing 365 in the well known birthday problem shown   What I want to understand is the following: I want to check and see if my choice of concatenating 10 is right, when I know that my $n$ is of the order of a few millions and my $1 - P(M,n)$ needs to be less than 0.0001 or some small number. The large values of M &amp; n make the above intractable to compute. Is there an easier way to compute this? Most simple code to populate JTable from ResultSet Indicate How Trustworthy the UpVotes Are Why is this quotient space not Hausdorff? Why do residuals in linear regression always sum to zero when an intercept is included? I'm taking a course on regression models and one of the properties provided for linear regression is that the residuals always sum to zero when an intercept is included.   Can someone provide a good explanation for why this is the case? What is a word for getting an award in a competition or being one of the top three? Database design for products with bundles of products I am building a database system for my retail business. I have set some tables which are:   Product Purchase Sales Balance   All are connected one another and are able to show my inventory level.  The problem I am having is I also sell bundles of products - that have different prices than their individual prices. Example: I sell an orange for $1, an apple for $1.2; I sell fruit package 1 (2 oranges and 2 apples) for $3.8, package 2 (4 oranges and 4 apples) for $7.  Is there a right way how to create relationship for these product bundles?  PS: I am using FileMaker Pro creating this. Are there gotchas using varargs with reference parameters I have this piece of code (summarized)...  AnsiString working(AnsiString format,...) {     va_list argptr;     AnsiString buff;      va_start(argptr, format);     buff.vprintf(format.c_str(), argptr);      va_end(argptr);     return buff; }   And, on the basis that pass by reference is preferred where possible, I changed it thusly.  AnsiString broken(const AnsiString &amp;format,...) { ... the rest, totally identical ... }   My calling code is like this:-  AnsiString s1, s2;     s1 = working("Hello %s", "World");     s2 = broken("Hello %s", "World");   But, s1 contains "Hello World", while s2 has "Hello (null)". I think this is due to the way va_start works, but I'm not exactly sure what's going on. While executing a C program, a.out, using the Ubuntu terminal, why do I always need to type ./ before a.out, instead of just writing a.out? Is there solution for this? A book with two twins and a difficult relation, a room where time flows slower than the outside and a mysterious monster coming from a sink There was this pocket book, back when I was a teenager (20 years ago), with these two twins discovering a room (it was something like a tool shed) where time flowed slower (1 hour inside was equal to 1 minute outside if i remember correctly).   Inside the shed there was a sink and a strange snake-ish metallic monster was slowly coming out from it.  One of the twins, the one with the "less marked" personality, decides to spend one year (during a whole night) inside the room in order to get out older than his twin.  I don't remember what happens with the monster, I think they destroyed the whole shed in the very end. Why is HMAC-SHA1 still considered secure? This Q &amp; A   says that the security of HMAC-SHA1 does not depend on resistance to collisions? Are they are saying specifically with respect to HOTP or for HMAC-SHA1 for any use?     If HMAC-SHA1 is used for verifying the integrity of a document and you can find a collision, you can make changes in the document, right?      Even the RFC says that resistance to collisions is relevant       The security of the message authentication mechanism presented here depends on cryptographic properties of the hash function H: the resistance to collision finding (limited to the case where the initial value is secret and random, and where the output of the function is not explicitly available to the attacker), and the message authentication property of the compression function of H when applied to single blocks    What am I missing here? Is there anywhere within the Blender UI that displays the dimensionality &amp; bounding sets (e.g., all floats, floats in [0,1], floats in [0,255], etc) of arbitrary shader node inputs &amp; outputs?  I consistently find myself digging through stackexchange/the Blender docs/experimenting with less-than-equal-to to try to figure out what I need to divide by to normalize shader nodes' input/output values to within a specific range, or to center them at 0, etc. This seems like functionality that Blender's very rich UI might already have built into it, though, so I am wondering if I am just overlooking it somewhere.  As an example, I can do something like this, varying the threshold between 0, 0.5, and 1, and observing that in rendered view my sphere switches from all black to mixed black/white to all white, to convince myself that Blender's (Perlin) Noise Texture's Fac output naturally outputs floats in [0,1]:    But it seems odd that I should have to experiment, or search through docs or stackexchanges, to discover something like this. Is this information maybe already neatly displayed somewhere inside the Blender UI, and I just don't know where to look? Capital letters in "Theorem", "Conjecture" etc This is my first post and as you can probably guess I am a mathematician so I have no clue about grammar. I am writing a mathematical document at the moment and I would appreciate some advice on my usage of capital letters. Can somebody please confirm if the following are correct?  1) "We know by T​heorem 4.6.1 that..."   2) "the following c​onjecture, due to..."  3) In order to prove the "Mckay-Stevens $k$-covering C​onjecture, once needs to show that..."  I'm particularly confused about 3).  Many thanks for any help Proof that every number ≥ $8$ can be represented by a sum of fives and threes. Can you check if my proof is right?  Theorem.  $\forall x\geq8, x$ can be represented by $5a + 3b$ where  $a,b \in \mathbb{N}$.  Base case(s): $x=8 = 3\cdot1 + 5\cdot1 \quad \checkmark\\ x=9 = 3\cdot3 + 5\cdot0 \quad \checkmark\\ x=10 = 3\cdot0 + 5\cdot2 \quad \checkmark$  Inductive step:  $n \in \mathbb{N}\\a_1 = 8, a_n = a_1 + (x-1)\cdot3\\ b_1 = 9, b_n = b_1 + (x-1)\cdot3 = a_1 +1 + (x-1) \cdot 3\\ c_1 = 10, c_n = c_1 + (x-1)\cdot3 = b_1 + 1 + (x-1) \cdot 3 = a_1 + 2 + (x-1) \cdot 3\\ \\ S = \{x\in\mathbb{N}: x \in a_{x} \lor x \in b_{x} \lor x \in c_{x}\}$  Basis stays true, because $8,9,10 \in S$  Lets assume that $x \in S$. That means $x \in a_{n} \lor x \in b_{n} \lor x \in c_{n}$.  If $x \in a_n$ then $x+1 \in b_x$,  If $x \in b_x$ then $x+1 \in c_x$,  If $x \in c_x$ then $x+1 \in a_x$.  I can't prove that but it's obvious. What do you think about this? Explanation of finite population correction factor? I understand that when sampling from a finite population and our sample size is more than 5% of the population, we need to make a correction on the sample's mean and standard error using this formula:  $\hspace{10mm} FPC=\sqrt{\frac{N-n}{N-1}}$  Where $N$ is the population size and $n$ is the sample size.  I have 3 questions about this formula:   Why is the threshold set at 5%? How was the formula derived? Are there other online resources that comprehensively explain this formula besides  paper?