In dnd warlock spell slots are max level so if you make a first-level warlock spell slot using Sorcery points does the spell slot become max level is this possible and if it is can you make infinite spell slot by making a 1st level spell slot and it becoming a 3rd level slot then making it into 3 Sorcery points using 2 to make a 1st level slot and it becoming a 3rd again gaining a spell point every time you do this thus making infinite spell slots? what I'm basically asking is that in and 5e does a 1st level warlock spell slot become a 3rd because it says that all your spell slots are max level.
Can a multiclass sorcerer make spell slots for their other class using sorcery points?  For example: can a multiclassed sorcerer 3 / warlock 1 use Flexible Casting to create a warlock spell slot?
I would like to configure my Ubuntu 12.04 server to synchronize its clock with a specific NTP server. Where to set this up? Person, Persons, People, Peoples Can you please clarify the relation and differences between these nouns?   For example, is it proper to use "persons" instead of "people"? Are they the same? As I believe that "people" is plural, how come there exists the plural of the plural (=peoples)? Does it have any usage? If $a_k\geq0$ is a decreasing sequence converging to $0$, do we have $\lim_{n\to\infty}\frac{\sum_{k=1}^n a_k}n = 0$? Proving $|P(A\cap B)-P(A)P(B)|\leq \frac{1}4$ Let $A$ and $B$ be two events of a probability space. Prove that  $\displaystyle|P(A\cap B)-P(A)P(B)|\leq \frac{1}4$   I think it's a very challenging problem, and I've made no progress so far ...  Can someone give me a hint ? Monos in $\mathsf{Mon}$ are injective homomorphisms. Let $f: M \to N$ be a mono in $\mathsf{Mon}$. I want to prove that the underlying function $U(f): U(M) \to U(N)$ is injective.   How can this be done ? Thanks in advance. The boundary of union is the union of boundaries when the sets have disjoint closures Assume $\bar A\cap\bar B=\emptyset$. Is $\partial (A \cup B)=\partial A\cup\partial B$, where $\partial A$ and $\bar A$ mean the boundary set and closure of set $A$?   I can prove that $\partial (A \cup B)\subset \partial A\cup\partial B$ but for proving $\partial A\cup\partial B\subset \partial (A \cup B)$ it seems not trivial. I tried to show that for $x\in \partial A\cup\partial B$ WLOG, $x\in \partial A$ so $B(x)\cap A$ and $B(x)\cap A^c$ not equal to $\emptyset$ but it seems not enough to show the result. Is it possible to query the content of the Time-based Workflow Queue from an Apex unit test to assess that a specific Workflow Rule has been executed and added a new item to the queue? I didn't see anything alike in the documentation, but wish it could be possible to improve testing and stability overtime.  Thanks 4 cards are drawn from a pack without replacement. What is the probability of getting all 4 from different suits?  Here's how I tried to solve:  For the first draw, we have 52 cards, and we have to pick one suit. So, probability for this is $\frac{13}{52}$.  For the second draw, only 51 cards are left. The second suit has to be selected, so there are 13 cards from that suit. The probability is $\frac{13}{51}$.  Similarly, the third and fourth draw have probabilities $\frac{13}{50}$ and $\frac{13}{49}$ respectively.  Since the draws are independent, the total probability becomes $$\frac{13}{52} \times \frac{13}{51} \times \frac{13}{50} \times \frac{13}{49}$$  But my book says the answer is $\frac{{13\choose 1} \times {13 \choose 1} \times {13\choose1} \times {13\choose1}}{52 \choose 4}$.  My answer differs by a factor of $4!$. What did I do wrong? In a complete metric space with no isolated points, any countable intersection of open dense sets is uncountable? Is it possible to be admitted to a masters in Germany with a 3-year bachelors from another country? What is the correct permission in /etc/fstab to mount NTFS? I have Windows and Arch Linux in dual with UEFI. I want to mount my another NTFS partition in Arch. I mounted the partition with mount /dev/sda5  /mnt/Apps command. Then added the output of genfstab -U /mnt/Apps in /etc/fstab file. The output is as follows:  UUID=01D158CC7C2A61A0 /mnt/Apps ntfs rw,nosuid,nodev,user_id=0,group_id=0,allow_other 0 0   But when I unmount and remount that partition all files and folders shows with root uid and gid and 0777 permission. I also tried with changing uid and gid to 1000 but same result. So, my question, what is the correct way to add NTFS partitions in fstab so that I can read &amp; write all file and folder both with normal user (1000:1000) and root (0:0)? Why particle hole symmetry and chiral symmetry are called symmetries? $PHP^{-1}=-H$ (particle-hole symmetry) and   $\Gamma H \Gamma^{-1}=-H$ (chiral symmetry)   I understand why we get the negative signs but im just a bit confused as to why such equalities mean $H$ is particle hole and chiral symmetric.   When we say $H$ is symmetric under some operation, like time reversal,  don't we usually mean that $H$ is invariant under the said transformation?  $THT^{-1}=H$ if $H$  is time reversal symmetric.  On the contrary, we say $H$ is symmetric under particle hole and chiral operations when $H$ picks up a negative sign. This seems to contradict our usual convention of what we mean by $H$ being symmetric(invariant). Use biblatex and utf8 For my thesis, I use biblatex for the bibliography.  As seen , biblatex is not compatible, with \usepackage[utf8x]{inputenc}. It was reported as close but I still have the same problem with my version of bibtex (last one on archlinux ). I want to use the € symbol inside my report but it fails without utf8.  ! Package biblatex Error: Incompatible package 'ucs'.  See the biblatex package documentation for explanation. Type  H &lt;return&gt;  for immediate help.  ...                                                l.7 \begin{document}   Any idea idea how to fix ?  \documentclass{report}  \usepackage[utf8x]{inputenc} \usepackage{biblatex} \bibliography{includes/mybib}{}  \begin{document}  X said Y \cite{bib1}  \printbibliography  \end{document}   and the file mybib  @online { bib1,        title = {Refrence title},        author = {X},        url = {http://site.com/y}} Prevent area light from being reflected on glass? I did setup an easy scene with an area light behind a window. In the glass (simple plane) which is in front the area light is visible - how can I turn this off so that the background is shining throgh? If $a_0\in R$ is a unit, then  $\sum_{k=0}^{\infty}a_k x^k$ is a unit in $R[[x]]$ I am using Ubuntu 16.10 and recently I have not been able to connect to internet using Ethernet. The network manager shows device not managed. The WiFi network is working fine.      I've tried the solution from this questionn  with no use.  My /etc/network/interfaces file:  # interfaces(5) file used by ifup(8) and ifdown(8) auto lo iface lo inet loopback   My /etc/NetworkManager/NetworkManager.conf file:  [main] plugins=ifupdown,keyfile,ofono dns=dnsmasq  [ifupdown] managed=true   Output of nmcli d:  DEVICE  TYPE      STATE      CONNECTION  wlp2s0  wifi      connected  eduroam     enp8s0  ethernet  unmanaged  --          lo      loopback  unmanaged  -- Can Cycles renders be done from the command line? It seems that Cycles is mainly built in the form of Python scripts (as far as I can tell). Is it still possible to use Cycles to render a .blend file from the command line? Does JavaScript have the interface type (such as Java's 'interface')? Do I need a US visa to transit (or layover) through an American airport? In Europe usually you don't need to go through immigration to change planes (unless you are entering/exiting Schengen). Is it the case in the US as well? May I catch a connecting flight on one of the US airports if I don't have US visa? Adjective meaning "argumentative for argument's sake"?