I have the following number.  23.45   There are two parts of this number. 23 and 45. What is the mathematical name of the 23 part?
Sorry for asking such a basic question - but is there an actual term for the numbers that appear before and after the decimal point?  Example:  25.18  I know the 1 is in the tenths position, the 8 is in the hundredths position. are there singular terms which apply to all of the numbers that appear both before and after the decimal point?  I'm building a billing system, storing dollars and cents as integers (in separate columns), but for other currencies "dollars" and "cents" are not the correct terms = ).  Thanks!
Should you pick a baby up everytime it cries? My husband and i have differing opinions on this. I don't believe in the term 'spoilt'. I would be very happy if my daughter was 'spoilt' in the sense that she expects to be treated with the highest possible respect and love and affection in all her relationships.   Also it would not bother me if she think she is special and unique (that's exactly what I want her to think). Mother's face is a mirror for the baby - through the mother's reactions and attention, the child learns that she is a lovable and valuable human being.   I spend all my time with my baby when she is awake. I play games with her, I smile, and laugh, and I never ever let her cry. I rush to pick her up immediately, even if it's the middle of the night, I force myself to get up, no matter how tired I am (I admit it's hard sometimes, and I do let her cry for 10-20 seconds sometimes, but never more). Ubuntu with spyware? Richard Stallman states that Ubuntu "has installed surveillance code". See:   Is this true?   I agree with him that "Any excuse Canonical offers is inadequate....". Proving Cauchy condensation test "He walks as if he is drunk." Grammatically correct ? Any difference in meaning from "...as if he were drunk."? Is it grammatically correct to use an indicative verb after "as if", or "as though" for that matter?        I've heard someone say: "He walks as if he is drunk."  Would there have been any difference if he had said "He walks as if he were drunk."?   A second example might be:        It looks as if it is going to rain.   It looks as if it were going to rain. My web application has a login page that submits authentication credentials via an AJAX call. If the user enters the correct username and password, everything is fine, but if not, the following happens:   The web server determines that although the request included a well-formed Authorization header, the credentials in the header do not successfully authenticate. The web server returns a 401 status code and includes one or more WWW-Authenticate headers listing the supported authentication types. The browser detects that the response to my call on the XMLHttpRequest object is a 401 and the response includes WWW-Authenticate headers. It then pops up an authentication dialog asking, again, for the username and password.   This is all fine up until step 3. I don't want the dialog to pop up, I want want to handle the 401 response in my AJAX callback function. (For example, by displaying an error message on the login page.) I want the user to re-enter their username and password, of course, but I want them to see my friendly, reassuring login form, not the browser's ugly, default authentication dialog.  Incidentally, I have no control over the server, so having it return a custom status code (i.e., something other than a 401) is not an option.  Is there any way I can suppress the authentication dialog? In particular, can I suppress the Authentication Required dialog in Firefox 2 or later? Is there any way to suppress the Connect to [host] dialog in IE 6 and later?    Edit Additional information from the author (Sept. 18): I should add that the real problem with the browser's authentication dialog popping up is that it give insufficient information to the user.  The user has just entered a username and password via the form on the login page, he believes he has typed them both correctly, and he has clicked the submit button or hit enter. His expectation is that he will be taken to the next page or perhaps told that he has entered his information incorrectly and should try again. However, he is instead presented with an unexpected dialog box.  The dialog makes no acknowledgment of the fact he just did enter a username and password. It does not clearly state that there was a problem and that he should try again. Instead, the dialog box presents the user with cryptic information like "The site says: '[realm]'." Where [realm] is a short realm name that only a programmer could love.  Web broswer designers take note: no one would ask how to suppress the authentication dialog if the dialog itself were simply more user-friendly. The entire reason that I am doing a login form is that our product management team rightly considers the browsers' authentication dialogs to be awful. How to name an item using /give command in MCPE? I'm looking for a free RAW editor/converter on Windows. Can you tell me some strong/weak points of them comparing with Capture NX and/or Adobe Photoshop Elements?       - conversion &amp; EXIF  - white balance  - registration not possible anymore   EXIF editing would be a nice bonus.  Related: Homotopy functions I'm new here. Can anyone give me a hint in this problem? Please.  Let $X$ be a topological space. If $f,g$ are continuous function of $f,g\colon X\to S^n$  which $f(x)\neq -g(x)$ for all $x$ in $X$, show $f$ and $g$ are homotopics. I try to show a homotopy using $$q(x) = \frac{f(x)+g(x)}{\|f(x)+g(x)\|}$$ it's well defined, but i'm stuck. Let's say we have one black hole that formed through the collapse of hydrogen gas and another that formed through the collapse of anti-hydrogen gas. What happens when they collide? Do they (1) coalesce into a single black hole or do they (2) "annihilate" into radiation?  One would expect (1) to be the case if the No Hair Theorem were to hold. So I guess what I'm really asking for is a modern understanding of this theorem and its applicability given what we know today. Show that the ring of all rational numbers, which when written in simplest form has an odd denominator, is a principal ideal domain. Show that the ring of all rational numbers $m/n$ with $n$ an odd integer is a principal ideal domain.  We haven't really discussed principal ideal domains. I've heard that this is easy, but I just lack the basic knowledge of what a principal ideal domain is. Prove that $(n+1)^{n-1}<n^n$ How would one prove that  $$(n+1)^{n-1}&lt;n^n \ \forall n&gt;1$$  I have tried several methods such as induction. Modify obj after import using python I am trying to modify an object after importing it. This post is related to   import bpy full_path_to_file = "C:\\Users\\xyz\\Documents\\test.obj" bpy.ops.import_scene.obj(filepath=full_path_to_file) # create the material mat = bpy.data.materials.new('MaterialName') mat.diffuse_color = (1.0,0.0,1.0) mat.diffuse_shader = 'LAMBERT' mat.diffuse_intensity = 1.0  # get the object obj = bpy.data.objects['Cube']  # get the material mat = bpy.data.materials['MaterialName']  # assign material to object obj.data.materials.append(mat)   I wanted to add a material to the imported object but that is not happening. So I tried to scale it even that is not happening.  I realized that no operation is being performed on the imported objects. But the same operations are executing on the objects that are created (i.e. not imported).  Any help would be appreciated. In the 90's I read a book about two children (I think they were siblings, boy and girl) who climbed a tree. At the end they found a door to another world. After some time the (fantasy) worlds switched to another one. Once they got stuck in a world, because the world went on traveling and therefore the door couldn't be reached anymore. They met many curious individuals during their adventures.  It's a completed novel for kids. I've read it in German, but I can't remember if the author was a German one, so it might've been available in English as well. It was a fairly thick book.  EDIT: After some thought I remember a pancake kind of person Fundamental group of the torus I'm trying to get my head round the following calculation of the fundamental group of the torus, using Seifert Van-Kampen (I know it's easier to do this by considering covering spaces, but I'm trying to learn the Seifert Van-Kampen method).   Consider the torus $T$ as the unit square in $\mathbb R^2$ with opposite edges identified. Let $A$ be an open disc (say of radius $1/4$ about the origin), and $\overline{A}$ be it's closure. Let $B$ be complement of $A$, so that $A \cap B = S^1$. Then we have $T = A \cup B$ where $A$ and $B$ are a neighbourhood deformation retract pair, so we can use Van Kampen. It is clear that $\pi_1(A) = \{e \}$ and $\pi_1(A \cap B) = \mathbb Z$. So we need to find $\pi_1(B)$. Observe that $B$ deformation retracts onto the boundary of the square which, after identification, is homeomorphic to $S^1 \vee S^1$; in this way we see that $B$ and $S^1 \vee S^1$ are homotopy equivalent (inclusion in one direction, the retraction in another), and so $\pi(S^1 \vee S^1) = F_2$ (which can be calculated by Van Kampen, or by using the theory of covering spaces). So, by Van Kampen, $\pi_1(T) \cong F_2 *_{\mathbb Z} \{e\}$. This is the quotient of $F_2$ by the normal closure of the image of $l_* : \pi_1(A \cap B) \to \pi_1(B)$ (where $l_*$ is the homomorphism induced from the inclusion map $l : A \cap B \hookrightarrow B$). The following is causing me confusion: The generator of $\pi_1(A \cap B)$ is homotopic in $B$ to a loop of the form $u.v.\overline{u}.\overline{v}$, where $u$ and $v$ represent the two generators of $F_2$. So $\pi_1(T) \cong \langle a,b ; aba^{-1}b^{-1} \rangle$, the free abelian group on two generators.  Any explanation or geometric intuition would be really appreciated. Thanks Explicit formula for Bernoulli numbers by using only the recurrence relation It is not hard to show, by induction on $m\in\mathbb N$, that there exist a sequence $(B_n)_{n\geq0}$ of rational numbers such that  $$\sum_{k=1}^nk^m=\frac1{m+1}\sum_{k=0}^m\binom{m+1}kB_k\,n^{m+1-k},\ \style{font-family:inherit;}{\text{for all}}\ n\geq1\,.$$  These are the Bernoulli numbers of the second kind, that is, $B_1=+1/2$. A corollary of the proof (by induction) of the fact above is a recurrence formula for such numbers $B_n$, which are known as Bernoulli numbers:  $$\sum_{k=0}^{n-1}\binom nkB_k=0\,.\tag{$\ast$}$$  On the other hand, there are a number of explicit formulae for $B_n$, which are obtained using the equality $\frac x{e^x-1}=\sum_{n=0}^\infty B_n\,\frac{x^n}{n!}$; see  and . For example:  $$B_n=\sum_{k=0}^n\frac1{k+1}\sum_{r=0}^k(-1)^r\binom krr^n\,.\tag{$\ast\ast$}$$  Is there some clever way to manipulate the recurrence $(\ast)$ in order to obtain $(\ast\ast)$? On Windows 10 Professional, with the November update (Build 10586, Version 1511) , is there any possibility to completely remove Windows Defender ?  I don't want to just disable Windows Defender.  I want to completely uninstall from my system. As a new user without much rep, what should I do if someone else has already asked a question I have, but it has no answers? Executing a certain action for all elements in an Enumerable $A$ is a $n\times n$ matrix such that $ A^m = 0 $ for some positive integer $m$.   Show that $A^n = 0$.   My attempt: For $n &gt; m$, it's obvious since matrix multiplication is associative.  For $n &lt; m$, $A^n\times A^{m-n} = 0$; not sure what to do next. Also I know that $\det A = 0$. Is it possible to find power armor in the wasteland? If you send somebody out in the wasteland for long enough with good enough luck, is it possible to find power armor or any other legendary gear?