I don't know what to do! I have a great understanding of C basics. Structures, file IO, strings, etc. Everything but CLA. For some reason I cant grasp the concept. Any suggestions, help, or advice. PS I am a linux user
So I'm in Linux and I want to have a program accept arguments when you execute it from the command line.  For example,   ./myprogram 42 -b -s  So then the program would store that number 42 as an int and execute certain parts of code depending on what arguments it gets like -b or -s.
Ping a site in Python? Generating random results by weight in PHP? I know how to generate a random number in PHP but lets say I want a random number between 1-10 but I want more 3,4,5's then 8,9,10's. How is this possible? I would post what I have tried but honestly, I don't even know where to start. Why is it that a sequence in a closed, bounded interval [a, b] is a bounded sequence? What is the formal proof of this proposition from the definition of a bounded sequence? rstrip not removing newline char what am I doing wrong? Why is DML not allowed in Constructor? Cutting strands of wire to fit plug I am a hvac tech, but my question is I have 2awg stranded and my plug is 6awg, will it matter much if I cut some strands to fit my plug? the plug is 60amp 250vac for a piece of kitchen equipment if the matters. I frequently need to do the following things in MySQL:   Create a non-root user Set that user's password Grant that user all privileges Make a database with the same name as the new user Allow usage only for users from the localhost.   Previously I did this using PHPmyadmin, but I would prefer doing it directly from BASH. Is there a CLI way to execute these steps? Solve for $x$ in the $80^\circ$-$80^\circ$-$20^\circ$ triangle I've been solving this for days but I still I couldn't solve this. Can I know how to solve $x$ ? How can I include the cursor in the screenshots created when PrtScr is pressed? I was going to make a filter for the &quot;&quot; by excluding some sites from it.  I noticed  which talks about &quot;negative filtering&quot; but does not explain how one can do it or if it is possible.  There does not seem to be a way to do this, though.  On the filter page, my only options are:  So how can I do &quot;All sites except [list]&quot;? It would also be nice if this could include similar functionality with the meta checkbox.  Something like &quot;All main &amp; meta sites except...&quot; Why is $\mathbb{Z}[\sqrt{-n}], n\ge 3$ not a UFD? How do I make windows save their position on screen after re-attaching a display? In the film and book series, Year 4 (Goblet of Fire), how is it Mad-Eye Moody/Barty Crouch could see Harry through his Magical Eye even when he was under the Invisibility Cloak?  As the cloak is a True Invisibility cloak, immune to charms and spells, and according to legend invisible to even Death, how did Mad-Eye detect Harry Potter under the cloak? How Nagini and Mrs. Norris were able to sense Harry were through other senses, such as smell and warmth, but not visually.  I'm referring to the scene/chapter where Snape follows Harry at night. Harry hides under the Invisibility Cloak but his foot is stuck at the broken staircase. Eventually Mad-Eye arrives, sees Harry through his Magical Eye, and talks Snape away. Use integral test to show that Gaussian Integral $\int_{-\infty}^{\infty} e^{-x^2} \ dx$ converges? There's a question in my book (it's a school-specific textbook) saying:  Use the integral test to show $$\int_{-\infty}^{\infty} e^{-x^2} \ dx$$ (the Gaussian Integral) converges.  The integral test says if the integral converges, so does the series. But I have no idea how to represent this as a series, do I need to?   I'm not looking to evaluate it - I've read about it online - but how do I use the integral test here?  Thanks Gaussian Integers and Quotient Rings Show that $\mathbb{Z}[i]/(2+3i)$ is a finite field.    By applying some isomorphisms and realizing $\mathbb{Z}[i]$ as the quotient ring of $\mathbb{Z}[x]/(x^{2}+1)$, I found that:  $\mathbb{Z}[i]/(2+3i) \cong \mathbb{Z}[x]/(x^2+1,2+3x)$  However, I run into trouble as I can't divide $x^{2}+1$ by $2+3x$ in $\mathbb{Z}[x]$. What would be another way to approach the problem?  Thanks for the help. How can I show that $(n-1)!\equiv-1 \pmod{n}$ if and only if $n$ is prime? Thanks. How can I prove that if $\gcd(a, b) = 1$, then $\gcd(ab, c) = \gcd(a, c) \times \gcd(b, c)$?  By eea there exists $ax+by=1$ from $\gcd(a,b)=1$ so a and be are co-primes there also exists $dk=a$ and $dj= b$ where $d=\gcd(a,b)=1$ this is all the information I have gathered from the question but I dont know how to approach and solve it. Can anyone help explain to me how to arrive at the answer? Thanks! Object-oriented shell for *nix SEO and buying expiring or dropped domain Does it make any difference for SEO benefits to buy dropped and already available domains other than backorder domains that are expiring soon?  I heard somewhere that whois gets deleted after being dropped. But I didn't find any confirmation if it's true or not.  Anybody can tell me if there are benefits of one against the other, if yes what? Multiplicative order and powers Let's consider two number $a$ and $b$ such as $gcd(a,b)=1$. Can you explain me intuitively why there exist $n&gt;0$ such as $a^{n} \equiv 1 \space (mod \space b)$  ?