As wizard, would it be possible to use your familiar's line of sight as your own for spells such as Mirage Arcane which has a range of sight? Would You be able to use a telescope or spyglass to use that spell?
I am thinking about a wizard who has a rat familiar (from the  spell), and has the  spell prepared. Can he use his familiar's senses to teleport into another room (where the familiar is hiding) by looking through the eyes of the rat and casting misty step?  The wizard could use his action to switch to the familiar's senses and then use his bonus action to cast the spell. This would greatly reduce the "blind and deaf" time he experiences from doing this.
Prove that a topological space equipped with a delta-complex structure is Hausdorff Resizing an iframe based on content I am working on an iGoogle-like application. Content from other applications (on other domains) is shown using iframes.   How do I resize the iframes to fit the height of the iframes' content?  I've tried to decipher the javascript Google uses but it's obfuscated, and searching the web has been fruitless so far.  Update: Please note that content is loaded from other domains, so the  applies. Car accident, put in park or neutral? Replacing strings in files based on certain search criteria is a very common task. How can I    replace string foo with bar in all files in the current directory? do the same recursively for sub directories? replace only if the file name matches another string? replace only if the string is found in a certain context? replace if the string is on a certain line number? replace multiple strings with the same replacement replace multiple strings with different replacements Is it possible to run commands from spotlight? I run commands in terminal a lot and i'm wondering if it is possible to run the commands from spotlight. For example in spotlight  would like to run the command(because i have a lot of network issues):   ping google.com   And then spotlight to load terminal and execute the command instead of having to load terminal because it takes so long to load. So is this possible? Seasonal Loan Amortization Hi I can compute a Basic Loan Amortization Schedule, But now I'm trying to Calculate a Seasonal Loan Amortization Schedule . So for example A loan starts at January And Will go on for 3 years, with Monthly Payments. Interest is at 3% Annually and is compounded Annually. During the months of September, October, November, December It'll only accumulate Interest But no payments and principal. Principal is 100000. How Do I calculate Payments and interest. I need help with a specific command that I am using in a new game that I am creating inside of Minecraft. The command is:  /give @p sign 1 0 {BlockEntityTag:{Text1:"{"text":" [MF2]","color":"gold","clickEvent": {"action":"run_command","value":"tellraw @a [""{"text":"[MF2]  ","color":"gold"},{"selector":"@p","color":"dark_aqua"},{"text":" is now an admin of the server!","color":"white"}]"}}",Text3:"{"text":"Click to join Admin","color":"dark_aqua","clickEvent": {"action":"run_command","value":"scoreboard teams join admin @p"}}"},display: {Name:"Custom Sign"}}   If I take out the /tellraw command then the command works fine, but I need the command in there to announce to the game that a new admin has joined.  With the tellraw command, the error message is the following:  Data tag parsing failed: Unexpected token 't' at: text":" [MF2]","color":"gold","clickEvent":{"action":"run_command","value":"tellraw @a [""{"text":"[MF2] ","color":"gold"}, {"selector":"@p","color":"dark_aqua"},{"text":" is now an admin  of the server!","color":"white"}]"}}",Text3:"{"text":"Click to join Admin","color":"dark_aqua","clickEvent": {"action":"run_command","value":"scoreboard teams join admin @p"}}"   If anyone knows how to fix this, please let me know. Today I gave a .  This results of course in a negative score for today.   Since then I don't get any more notifications for new rep in the new top-bar on meta.    Only after resetting the rep indicator by clicking on it I get new notifications. I am trying to create a beamer animation using tikz, but I can't even get basic rotating of a tikz image working as desired.  I have a rectangle specified by  \draw[rounded corners,dotted] (-3.5,0) rectangle (-0.5,2);   I would like to rotate this rectangle about the point (-1,.5) (which is near the bottom right corner of the rectangle).  I've tried:  {\rotatebox[origin=c,x=-1,y=.5]{130}{             \draw[rounded corners,dotted] (-3.5,0) rectangle (-0.5,2);}}   But this produces an error.  If I just use the origin=c option, it compiles, but it rotates the rectangle about the point (0,0).  I've also tried it with just the x=-1,y=.5 (without the origin option), and it fails to compile.  I have searched the documentation, which is where I learned about the options x=xdim and y=ydim.  However, I can't find a single example demonstrating how these options should be used.  Any suggestions would be greatly appreciated.    Also, if there is a better command for rotating things that will be more suitable for use in a beamer animation, please let me know.  Thanks! If you make a search for something that returns more than 10,000 items in result. For example, search for  return 161,338 results on MSE. But if you select a page where 10,000+ result should be shown:        In the edge case  shows zero results:        But this is actual for any page where per_page * page_number is more than 10,000.  Though this does not happen for Stack Overflow in English. It looks like all other sites are affected.  Related bug report on ruSO.meta: I dont have a clue about the proof in the reverse implication on the iff statement.  I will show what I have by now:  1) A cofinite topology implies that any infinite subset in $X$ is dense. Let $U\in\tau$ and is cofinite topology so $U=X-\bigcup_{k=1}^{n}\{x_k\}$.  Let $V\in X$ an infinite subset then $$V\cap U=V\cap(X-\bigcup_{k=1}^{n}\{x_k\})=(V\cap X)-(V\cap \bigcup_{k=1}^{n}\{x_k\})=V-(V\cap \bigcup_{k=1}^{n}\{x_k\})$$  and cause $|V|\ge\aleph_0$ and $|\bigcup_{k=1}^{n}\{x_k\}|=n\in\Bbb N\,$ we have that $|V\cap \bigcup_{k=1}^{n}\{x_k\}|\le n$. And finally is obvious that $V-(V\cap \bigcup_{k=1}^{n}\{x_k\})\ne\emptyset$ so any infinite subset is dense on $X$.  2) A cofinite topology implies a $T_1$-space. Let $x, y\in X$ and $U\in\tau: U=X-\{y\}$ so $x\in U\land y\notin U$. We can define too $V\in\tau:V=X-\{x\}$ so $x\notin V\land y\in V$ then a cofinite topology is a $T_1$-space.  But my problem is that I dont have a clue to prove the reverse implication i.e. if we have a $T_1$-space where every infinite subset is dense then it is a cofinite topology. Some hint? Some advice or correction in the proof of above? Thank you in advance.    I will complete the proof with the advice of @Cameron Buie.  1) A $T_1$-space implies that any finite subset is closed. Let the singleton $\{x\}\subset X$. Then $\overline{\{x\}}=\{x\}\cup\{x\}'$ where $\{x\}'=\{y:(\forall U\in\tau : y\in U)\land x\in U\}$, but because we are in a $T_1$-space exist some $U$ for any points $x,y\in X: x\in U\land y\notin U$ so $\{x\}'=\emptyset$ then $\overline{\{x\}}=\{x\}$ and is closed.  This means that for every $T_1$-space it cofinite sets are open.  2) If any infinite subset is dense on $X$ it means that the closure of any infinite subset is $X$ so the only closed sets are finite (and $X$ itself), so the topology is cofinite. I need an appearing effect for text like the one (in javascript) here .  However I don't know how to insert js code into LaTeX (apart from using the AcroTeX Bundle) and that would also force me to use Acrobat Reader, so I'd like to implement a similar effect in Beamer. Is it possible?  (of course I would love to see alternative approaches to this) Using [Authorize] without SimpleMembershipProvider Let $A = \{ 1,2,3,4 \}$ Let $F$ be a set of all functions from $A \to A$.  Let $S$ be a relation defined by : $\forall f,g \in F$ $fSg \iff f(i) = g(i)$ for some $i \in A$  Let $h: A \to A$ be the function $h(x) = 1 $ for all $x \in A$.   How many functions $g \in F$ are there so that $gSh$ ?  My solution : $gSh$ means that $g(i) = h(i)$ for some $i \in A$. So $g(i) = 1$.  So number 1 always needs to connect to some x - 4 choices.  Then we have $3$ left-over numbers that can connect to $4$ numbers each.  So solution is $4 \cdot 4 \cdot 4 \cdot 4$. Is this correct at all? Thanks in advance !! :) How do we get the last day of the month from a given date Is there a function or method to give the last day of a month? For example if the date is 27 feb 2013, the last date should be 28 feb 2013 , it become 29 if its a leap year. if the date was 2 jan then it should return 31 Jan.  If there is no function then any ideas on how we can get this?  Thanks Finding a 2x2 Matrix raised to the power of 1000 Let $A= \pmatrix{1&amp;4\\ 3&amp;2}$. Find $A^{1000}$.  Does this problem have to do with eigenvalues or is there another formula that is specific to 2x2 matrices? Splitting of prime ideals in algebraic extensions I'm reading Algebraic Number Theory by Jurgen Neukirch. I have some problems with some of the exercises in Section 9 of Chapter 1.  They are:  1) If $L / K$ is a Galois extension of algebraic number fields with non-cyclic Galois group, then there are at most finitely many non-split prime ideals of $K$.  2) Let $L / K$ be a finite (not necessarily Galois) extension of algebraic number fields and $N / K$ the normal closure of $L / K$. Show that a prime ideal $p$ of $K$ is totally split in $L$ if and only if it is totally split in $N$.  I have worked on them for a long time but couldn't get any idea of it.   Can you please help? Thank you! $|a_{n+1}-a_n| \leq \frac{1}{2} |a_{n}-a_{n-1}|$. I'm trying to show that $(a_n)$ is convergent by showing that $(a_n)$ is Cauchy.  let $|a_2 - a_1 |  =x$.   $|a_3-a_2| \leq \frac{1}{2}x$  $|a_4-a_3| \leq \frac{1}{2}|a_3-a_2|\leq \frac{1}{4}x$  In general, for every $n$:  $|a_{n+1}-a_n| \le \frac {1}{2^{n-1}}x$  Let $\epsilon &gt;0$  for every $m,n &gt; 0 $, say $m&gt;n$ the following holds:  $$|a_m-a_n| = |a_m-a_{m-1} + a_{m-1} - a_{m-2} \dots a_{n+1}- a_n| \le$$  $$|a_m-a_{m-1}| + |a_{m-1} - a_{m-2}| + \dots |a_{n+1}-a_n| \leq \frac{x}{2^{m-2}} + \frac{x}{2^{m-3}} + \dots + \frac{x }{2^{n-1}}$$.  I can say that for big enough $n,m$, $|a_m-a_n|&lt;\epsilon$ and therefore, this sequence is Cauchy? It sounds not good enough to me yet I don't know what else to do here. phpmyadmin not working due to missing extensions I am about to use phpmyadmin on Ubuntu 16.04. But it shows that the page is not working. the error log says error 500   PHP Fatal error:  require_once(): Failed opening required '/usr/share/php/php-gettext/gettext.inc' (include_path='.:/usr/share/php') in /usr/share/phpmyadmin/libraries/select_lang.lib.php on line 477   At first it says that the mysqli|mysql extension is missing. but after sleepless hours I forget what I've been done to it. I am using php7. What is the non-parametric equivalent of a two-way ANOVA that can include interactions? Hi I am trying to find the non-parametric equivalent of a two-way ANOVA (3x4 design) which is capable of including interactions. From my reading in Zar 1984 "Biostatistical analysis" this is possible using a method put forth in Scheirer, Ray, and Hare (1976), however, according to other posts online it was inferred that this method is no longer appropriate (if it ever was).  Does anyone know what method would be appropriate for doing so, and if so the corresponding functions in R or Stata?