Where and How are Character array literals created?
What is the type of string literals in C and C++?
What is *.pkinfo file? What is a *.pkinfo file?   Google Search results talk about Package Info files and how they contain map documents and layers, so I don't see how this is different from a .mpk file.    I also have not found anything about how to create a *.pkinfo file. What issues should be considered when overriding equals and hashCode in Java? What issues / pitfalls must be considered when overriding equals and hashCode? What is the difference between display: inline and display: inline-block? Can md5 be used for encrypting data? I know that md5 shouldn't be used for password hashing because of collisions and possibility of making dictionary attacks e.g. using rainbow tables. But what about other uses? Can I use md5 for encrypting data?  Say, attacker gains access to database where sensitive data was stored using md5. He wants to know just this data that was hashed, not another data that gives this hash. Can he do it?  I know that there are better cryptographic hash functions so don't suggest to use them if md5 is enough. What and where are the stack and heap? fitting a smaller range when we bought our house, it had a very used 40" gas range. now that range has died. replacing with a new 40" range is very pricey ($2k+), and our cooking needs don't justify the size anyhow.  i'm looking for ideas on how to fit a smaller range. i would imagine that extending the counter top and cabinets would be a pretty extensive change. we've found we can get a 36" range for around 1/2 the cost. would it be feasible to add some sort of storage along side the smaller range to fill in the space?  thanks. i know this is an open-ended question with no specific answer, i'm just looking for ideas. Evaluate $6^{433} \pmod {21}$ and a proving question Question 1: Denote $a \mod b$ as $a \% b$, where $a$ and $b$ are some integers  Evaluate 12^32475 % 21    The following is what I tried:    12^32475 % 21 = (12^3 % 21)^10825 % 21 = 6^10825 % 21 = ... = 6^433 % 21   But how to continue ?  Question 2:  I don't understand this: n-1= -1 mod n. Where is this from? And does this line become the next line?    Context: my class is discrete math for computer science. So far for related topics, it covers modular inverse, (extended) GCD algorithm, Fermat's Little Theorem and Chinese Remainder Theorem (CRT). Resizing point on zoom out I've added a point on map like this but it is static in size.   How to resize that point on zooming?  Map on zoom out This question is updated to request additional answers and details in light of information now available in the Dungeon Master's Guide. In the released DM basic rules, Lost Mine of Phandelver, Hoard of the Dragon Queen, and the DMG teaser there are wands, staves, and rings that you can use to cast spells.  Do abilities that trigger from casting a spell activate when casting a spell from an item?  Can the character modify the spell using class abilities when casting a spell from an item?   Examples include:  An abjurer Wizard's arcane ward recovering hit points from a Dispel Magic cast from a Ring of Spell Storing  A sorcerer using Twinned Spell on a ray of enfeeblement from a Staff of Power  An evocation wizard using Sculpt Spell on a fireball from a Wand of Fireballs.   Now that the DMG is out we have some clearer rules on casting spells from items (DMG p. 141):  Some magic items allow you to cast a spell from the item.  The spell is cast at the lowest possible spell level, doesn't expend any spell slots, and requires no components, unless the item's description says otherwise  The spell uses its normal casting time, range and duration, and the user of the item must concentrate if the spell requires concentration. A magic item, such as certain staffs, may require you to use your own spellcasting ability when you cast a spell from the item.  Does whether or not you can apply class abilities to the casting of the spell depend whether the item uses the user's own spellcasting ability (such as the Staff of Fire) versus an item that comes with a fixed spellcasting ability built-in (such as the Wand of Fireballs)? Does it matter if it's something that triggers more or less automatically like Arcane Ward, versus something you have to control, like Careful Spell? What's the difference between "either" and "neither"? When a ball moves to the right, friction acts to oppose the motion, in other words, to the left. However, when a car travels around a bend, the friction acts in the perpendicular direction to the car's velocity and provides the centripetal force. I just cannot understand why friction would act in that direction. Best Fake Proofs? (A M.SE April Fools Day collection) Pokemon keep running away and Pokestops don't drop anything when spinning. What is going on? I can't do anything now. Can't catch Pokemon, can't get items. Does anyone have the same problem? I have two layers, one (A) has point features and the other (B) has polygons.  How do I produce a new table with some (the ID) or all the fields from the A table and some (the area code) or all from the B table where the B polygon contains the A point?  I am using QGIS. Real Analysis, Folland Problem 1.3.15 Measures Given a measure $\mu$ on $(X,M)$, define $\mu_0$ on $M$ by $$\mu_0(E) = \sup\{\mu(F): F\subset E \ \text{and} \ \mu(F) &lt; \infty\}$$ a.) $\mu_0$ is a semifinite measure. It is called the semifinite part of $\mu$. b.) If $\mu$ is semifinite, then $\mu = \mu_0$ (Use Exercise 14) c.) There is a measure $\nu$ on $M$ (in general, not unique) which assumes only the values of $0$ and $\infty$ such that $\mu = \mu_0 + \nu$.  The proof of Exercise 14 can be found  For a.) I believe we need to show that $\mu_0(E) = \infty$. Perhaps we can do this by proof of contradiction, similarly to what the proof in the link above does (actually it seems identical). For b.) I am not sure how we can show $\mu = \mu_0$ I think maybe we have to show by construction that $\mu \leq \mu_0$ and $\mu \geq \mu_0$ For c.) I haven't any idea for. Any suggestions is greatly appreciated. Nested Quantifiers true or false I have a concern with nested quantifiers.  I have: $$  \forall x \exists y \forall z(x^2-y+z=0) $$ such that $$ x,y,z \in \Bbb Z^+$$   My first question, can it be read like this:  $$  \forall x \forall z \exists y(x^2-y+z=0)  $$  The way I did it, is I started off with $x=1, z=1 $   $$ 2-y = 0 $$ $$ y =2 $$  Is this a good approach? Manually installing a program on Debian I have installed Debian on my pc, but the problem is that at the moment I have no Internet connection to this pc. So, to install a program I have to manually downloaded from a pc with internet and then install it to the linux-debian computer.  The question is this: Is there a standard way to make the installation manually? Note that when I connect a usb flash with the program I want to install(that is:   cdparanoia_3.10.2+debian-10.1_i386.deb) and I try opening it I get the message:     Failed to execute child process “ar” no file or directory. Let $F$ be a finite field. How do I prove that the order of $F$ is always of order $p^n$ where $p$ is prime? Unable to see anything after importing .obj file Decision boundaries and Gaussian density functions