The moment of inertia of a massive object about a given axis describes how its mass is distributed about that axis. I understand that a rotating black hole of a given mass and angular velocity possesses angular momentum, and one would think that it therefore possesses a certain moment of inertia about its axis of rotation. My question is this: can knowledge of that moment of inertia tell us anything about how the black hole's mass is distributed about its axis of rotation?
My question is in the title: Do black holes have a moment of inertia?  I would say that it is: $$I ~\propto~ M R_S^2,$$ where $R_S$ is the Schwarzschild radius, but I cannot find anything in the literature.
I googled it but I couldn't find the answer... maybe I didn't seek it in the proper way. My question is if &quot;to&quot; must be repeated in sentences such as the following ones:   In the past, women used to do the housework and to take care of children.  The aim of this meeting is to control their progress and to discuss the new working plan.    If I had to bet, I would omit the second to... But I am not sure about it. Hi I make this class A amplifier but how to replace R5 (10 ohm/10 W) with transistor because its getting really hot and how to achieve up to 10 Watt with +/- supply. I have +/-25v with 4A please help What is the status of TTF support in Internet Explorer? I'm looking for a fantasy book I read about 10 years ago. I don't remember a lot of it, but there are a few things I still know:   The setting was in medieval times. There was no traveling dimensions. I can't recall whether there was magic or not. It wasn't on Earth, but on some invented world. I believe it was a trilogy, with a focus on the son of some nobility. The goal for the characters was to collect a certain number of stones or gems (I believe there were 5 of them), all in certain colours. Every stone has a certain power attached to it. I believe it started out with one or two characters, but the group grew and every character had a certain colour stone at the end. What is important about the gems is that they are unique. It's not part of a bigger magic system, but they are artefacts from somewhere.   There are some minor incidents I can recall vividly:   They build up a fellowship with some stereotypical fantasy builds: an old school fighter, a minstrel, a female archer and probably more. At one point, they mention that if one of the guards in a country falls asleep on duty, he will be kept awake by his garrison/brothers in arms for seven days. At some point the minstrel falls asleep, and the old fighter teaches him how to stay awake. They travel through a forest full of leeches and other insects to reach one of the stones. Also, I seem to recall there was a member of an underground evil organisation among the nobility, who tried to poison someone and were able to do that because they built up an immunity to the poison.   Does anyone has a clue what this series might be?   Suggestions by kind people, but not what I'm looking for, are:   The Seventh Tower Deltora Quest Diadem Westria Sword of Heavens series Showing $\sum\limits_{p \in P} \frac{1}{p}$ where $P$ is the set of all primes is divergent Make display of reputation in revisions list consistent with the user card display The user card in the revision list, for example , shows the exact amount of reputation:  This is not consistent with how the flair works on (all?) other places in the site, e.g. under a post. There, the amount is displayed in units of thousands (k):  (or, in , millions (m).) It used to be consistent, see e.g. : I need to label the four corners of a dataframe as shown in the image. Can this be done with dynamic text scripts? Prove: $\lim\limits_{n \to \infty} \int_{0}^{\sqrt n}(1-\frac{x^2}{n})^ndx=\int_{0}^{\infty} e^{-x^2}dx$ I'd like your help with the following claim to prove:  $$\lim_{n \to \infty} \int_{0}^{\sqrt n}\left(1-\frac{x^2}{n}\right)^ndx=\int_{0}^{\infty} e^{-x^2}dx.$$  I think I should use the claim:     Let $a,b$ two real numbers and $\{f_n\}$ a sequence of continuous functions on $\left[a,b\right]$  which converges uniformly to $f$ on $[a,b]$. Then    $$\lim_{n\to\infty}\int_a^bf_n(t)dt=\int_a^bf(t)dt.$$   But for this, I must prove that $(1-\frac{x^2}{n})^n$ uniformly converges to $e^{-x^2}$.  How do I do that? One of the hardest and trickiest things to do is to prove this uniformly converges.. every function has its own way. I believe that the more examples I'll see the easiest it will be. Thanks again! ElasticSearch doesn't start after installing 5.6.4 While doing some flagging (yes, I'm a little bit addicted) I stumbled upon the user . At first the case seemed clear, Spammer, but...and that's a big one, he seems to be a productive member of SU and SO (his account on SF isn't there anymore, but it's still in the Data-Dump of the explorer, not sure what happened).  He does never seem to link against StarWind-Software, except with his name and profile. He also  that he's a developer there...so...at what am I looking here? I can't really place him somewhere. Solve the following equation in positive integers $x$ and $y$ How to break multi digit number into separate digits in VHDL? I found the method .But I do not know how to perform this in VHDL. Let a fixed point number (12 downto -19) like 3456.478396 I need break this number entirely into separate numbers 3456.478396 --> 3,  4, 5,  6,  (dot) ,  4,  7,  8,  3,  9,  6...  into 11 integer type variables. How to perform this in VHDL?  signal example : sfixed(4 downto -4); --'example' contains 9.75 then it is storage as "01001.1100". --simply example ="10011100". --10011100 --&gt; integer 156   How to get back original 9.75 number from 156 to separate into single digits?  I USED,  library ieee; library ieee_proposed; use ieee.std_logic_1164.all; use ieee.numeric_std.all; use ieee_proposed.float_pkg.ALL; use ieee_proposed.fixed_pkg.ALL; use ieee_proposed.fixed_float_types.ALL; I have a couple of eggs that I've picked up from some Pokestops (I'm lucky enough to live above one).   I walk a lot. I get to work through a 2 mile walk / train journey every day, so I should be picking up loads of steps for the eggs I have. However, because I'm normally always running late... for everything, I have to rush everywhere, so I walk at an above average pace.   Today I've walked around 5 miles, but the game has registered 100 metres. Is this because I walk too fast, or because of something else?  It's worth pointing out that I have the app open when walking... mostly because I have to catch them all. (This made me miss a train this morning... luckily I was early :D) Comparison theorem for ODE Here is something I'm trying to prove:     Conjecture: Suppose $f'(x) \leq \phi(f(x), x)$ and $f(a)=\alpha$. Suppose $g'(x)=\phi(g(x),x)$ and $g(a)\geq \alpha$. Then $f(x)\leq  g(x)\,\,\forall x$.   It definitely seems like it should be true, and I don't think we even need continuity of $\phi$.  (Edit: a user has correctly pointed out that we should require $\phi$ be locally Lipshitz in the first variable, uniformly with respect to the second variable. Let's add that assumption.)   I can prove it in the case that the inequality is strict. I'll place my proof below the fold. How can I extend it to weak inequality?  If it's wrong, I'd love to see a counterexample. A reference is fine; I have the book by Teschl, for example.  A similar question with stronger assumptions was asked .     Proposition: Suppose Suppose $f'(x) &lt; \phi(f(x), x)$ and $f(a)=\alpha$. Suppose $g'(x)=\phi(g(x),x)$ and $g(a)\geq \alpha$. Then $f(x)\leq  g(x)\,\,\forall x$.  Proof: Suppose not. Suppose WLOG there is a $b&gt;a$ such that $f(b)&gt;g(b)$. Let $c:=\inf \{x&gt;a:f(x)&gt;g(x)\}$. By definition of the derivative we have $f'(c)\geq g'(c)$, a contradiction, since $f'(c)&lt;\phi(f(c),c)=\phi(g(c),c))=g'(c)$. How to convert Local time to UTC time in Delphi? and how to convert it back from UTC to local time? How to search based on part of file name in Google Drive I'd like to be able to find all files in my Google drive that contain the string "_INSTRUCTION_" in the file name. Is there a way to do this?  EDIT 1: When I search for "RMA2013", I should get a dropdown with several options. As you can see, there are several Word and .pdf files with the phrase "RMA2013". Still I get no dropdown help:   And even if I click the search button, I get nothing: Requirements for a clan war? so i have a 30A disconnect available for use at a customer site for running 2 5HP motors ( at 480V)  the only question i have though is if the line is sized for a 10HP motor would both the 5HP motors need additional fuse protection?   Or could i get away without having addtional fuses protecting the motors ? Deploying a static site on AWS EC2/nginx: what am I doing wrong? If I take the $k \in \mathbb{N}$ power of 10 and mod it by a large prime, I notice that the remainders repeat at some point.  For instance $10^k mod~7$ seems to repeat every $8$th value of $k$.  Given $k$ (the power of ten), and a large prime number $p$, how can I compute the size of the cycle?  I tried writing a python script that computes the first instance of a repeat. However, I don't know if this works since a single instance of a repeat may not necessarily mean a full cycle.