Other provided information: 'Let A and B be square matrices of the same size.'  The last question for my Linear Algebra assignment involves providing matrices $A$ and $B$ that satisfy the above requirement, as well as 'Give a valid identity for $(A + B)^2$' and I do not see any theorem or example from my text that helps me break this problem down. So far I have been guessing random matrices to no avail and I know there must be a methodical solution to this.  What do I need to know in order to approach this problem?
The below statement is a true/false exercise.  Statement: For all square matrices A and B of the same size, it is true that $(A + B)2 = A^2 + 2AB + B^2$.  My thought process: Since it is not a proof, I figure I can show by example and come to a valid conclusion based on such example.  My work:  Come up with a square matrix A and B let both be a 2 by 2 matrix(rows and cols must be same).  Matrix $A$:  $A = \begin{array}{ccc} 3 &amp; 5 \\ 4 &amp; 6 \\ \end{array} $  Matrix $B$:  $B =  \begin{array}{ccc} 5 &amp; 8 \\ 9 &amp; 4 \\ \end{array} $  $A + B =  \begin{array}{ccc} 8 &amp; 13 \\ 13 &amp; 10 \\ \end{array}$  $(A + B)^2 =  \begin{array}{ccc} 233 &amp; 234 \\ 234 &amp; 264 \\ \end{array}$  $A^2 =  \begin{array}{ccc} 29 &amp; 45 \\ 36 &amp; 56 \\ \end{array}$  $(AB) =  \begin{array}{ccc} 60 &amp; 44 \\ 74 &amp; 56 \\ \end{array}$  $2(AB) =  \begin{array}{ccc} 120 &amp; 88 \\ 234 &amp; 112 \\ \end{array}$  $B^2 =  \begin{array}{ccc} 97 &amp; 72 \\ 81 &amp; 88 \\ \end{array}$  $A^2 + 2AB + B^2 =  \begin{array}{ccc} 246 &amp; 205 \\ 265 &amp; 256 \\ \end{array}$  Based my above work, the answer is false.   Is there another way to approach the problem? It seems like a lot of work needed to be done for a true/false question which raised my suspicion about whether there is a better way to look at the problem.
How do we initialise unpacked arrays in Verilog? Suppose I declare an unpacked array of size say 8 bits wide. reg b[7:0];  If I want to assign b[7] = 1,b[6] = 1, b[5] = 1, ......b[0] = 1, then apart from assigning value to each bit is there a way to assign any combination of bits say 8'bA8, to b? For instance if I execute this code(below) in verilog: module tb();     reg [7:0]a;     reg b[7:0];     initial begin         $monitor(&quot;a = %b,b = &quot;,a);         a = 8'hA8;         b = 8'hA8; // Line 7     end endmodule  I get this error: C:\iverilog\bin&gt;iverilog -o a test.v test.v:7: error: Cannot assign to array b. Did you forget a word index? 1 error(s) during elaboration.  I am using Icarus Verilog on a command prompt on Windows 10 operating system. One of my friends argues that princessship is the only word which has 3 identical letter comes together (s) ,but I think there is no word such as princessship.  Can anyone tell me whether this is a real word, and if there are any more English words which have 3 letters consecutively? Any thoughts on a semidecadian badge for people with five years service and an average of N points per year? Given that Stack Overflow is close to its fifth birthday as a public site, has any thought been given to a 'semidecadian' badge for people who have:   been registered with the site five years (a semi-decade, hence the name), scored more than N points per year on average (where N might be 1000).   The idea behind 'average of N points per year' is to allow slow starters to gain the badge eventually, rather than ruling them out in year 1.  The details are obviously subject to tweaking.  This might be a gold badge (the platinum version would be the decadian badge, with a larger value of N required — and no-one eligible for another 5 years or so).  These would complement the current Yearling badge (which is silver). How come if $\ i\ $ not of the following form, then $12i + 5$ must be prime? I know if $\ i\ $  of the following form $\ 3x^2 + (6y-3)x - y\ $ or $\ 3x^2 + (6y-3)x + y - 1, \ \ x,y \in \mathbb{Z}^{+},i \in \mathbb Z_{\ge 0}$,  then $\ 12i + 5\ $ must be composite number, because:  $12(3x^2 + (6y-3)x + y - 1) + 5 = 36x^2 + (72y - 36)x + (12y - 7) = (6x + 12y - 7)(6x  + 1)$  How come if $\ i\ $ not of the following form $\ 3x^2 + (6y-3)x - y\ $ and $\ 3x^2 + (6y-3)x + y - 1\ $,  then $12i + 5$ must be prime? $\ x,y \in \mathbb{Z}^{+},i \in \mathbb Z_{\ge 0}$.  For example: $\ 5 = \ 3*1^2 + (6*1-3)*1 - 1\ $ ,when $\ x = y = 1\ $, as proved before,$\ 5*12+5\ $ must be composite number;  $\ 0, \ 1. \ 2.\ 3.\ 4\ $ can't of the following form $\ 3x^2 + (6y-3)x - y\ $ and $\ 3x^2 + (6y-3)x + y - 1\ $,  $\ 12*0 + 5 = 5\ $, $\ 5 $ is prime,$\ 12*1 + 5 = 17\ $, $\ 17 $ is prime, and so on, Consider the functional equation problem $$ f : \mathbb R \to \mathbb R \text , $$ $$ f \left( a ^ b \right) = f ( a) ^ { f ( b ) } \text , $$ when $ a , b \in \mathbb R $, $ a , b \ge 0 $. So far the only solution I have is the trivial $$ f ( x ) = x \text . $$ Does there exist any other possible solution? Even if the $ f $ doesn't have a closed form in terms of elementary functions, is there some way I could derive a series or an alternative expression for it? I tried to get a little more creative: $$ f ( w ) = f \left( w ^ { \frac 1 w } \right) ^ { f ( w ) } \text , $$ which nests deep into $$ f ( w ) = f \left( w ^ { \frac 1 w } \right) ^ { f \left( w ^ { \frac 1 w } \right) ^ { f \left( w ^ { \frac 1 w } \right) ^ \vdots } } \text , $$ which is equivalent to $$ \ln \big( f ( w ) \big) = \ln \bigg( f \left( w ^ { \frac 1 w } \right) \bigg) f ( w ) \text . $$ I was hoping to generate some sort of series using this. Too long in Primary Fermentation? What's the maximum amount of time for primary fermentation, assuming the beer is going straight to bottles next? Will it over ferment and then fail to carbonate, if left too long in a carboy? Number of Pairs of Subsets Find the number of Pairs $(A,B)$ of subsets of $[n]$ such that $A ⊆ B$? I just need clarification in my thought process. My professor's wording at times can through me off. I just want to know if I am on the right track. We will have $3$ regions: 1.Outside $B$ 2.Inside $A$ 3. Inside $B$, Outside $A$ I believe the number of pairs is $3^n$ but I am not sure. Any help would be appreciated. How can I verify a Google authentication access token?  I need to somehow query Google and ask: Is [given access token] valid for the [example@example.com] Google account?  Short version: It's clear how an access token supplied through the  can be used to then request data from a range of Google services. It is not clear how to check if a given access token is valid for a given Google account. I'd like to know how.  Long version: I'm developing an API that uses token-based authentication. A token will be returned upon provision of a valid username+password or upon provision of a third-party token from any one of N verifiable services.  One of the third-party services will be Google, allowing a user to authenticate against my service using their Google account. This will later be extended to include Yahoo accounts, trusted OpenID providers and so on.  Schematic example of Google-based access:    The 'API' entity is under my full control. The 'public interface' entity is any web- or desktop-based app. Some public interfaces are under my control, others will not be and others still I may never even know about.  Therefore I cannot trust the token supplied to the API in step 3. This will be supplied along with the corresponding Google account email address.  I need to somehow query Google and ask: Is this access token valid for example@example.com?  In this case, example@example.com is the Google account unique identifier - the email address someone uses to log in to their Google account. This cannot be assumed to be a Gmail address - someone can have a Google account without having a Gmail account.  The Google documentation clearly states how, with an access token, data can be retrieved from a number of Google services. Nothing seems to state how you can check if a given access token is valid in the first place.  Update The token is valid for N Google services. I can't try a token against a Google service as means of verifying it as I won't know which subset of all Google's services a given user actually uses.  Furthermore, I'll never be using the Google authentication access token to access any Google services, merely as a means of verifying a supposed Google user actually is who they say they are. If there is another way of doing this I'm happy to try. What's the batched Refactor Fields tool "field mapping" syntax in QGIS? In QGIS, there is this nice tool "Refactor Fields" in the Processing Toolbox :    Using it on a single layer is fairly straightforward.  However, when you plan on using it in a batch mode, one can see the "Fields mapping" textbox. I'm looking for an example of the syntax to be used there.  I haven't found any specific documentation yet. How can I query the name of the current SQL Server database instance? It is a bit of a "chicken or egg" kind of query, but can someone dreamup a query that can return the name of the current database instance in which the query executes? Believe me when I say I understand the paradox: why do you need to know the name of the database instance if you're already connected to execute the query? Auditing in a multi-database environment.  I've looked at all the @@ globals in Books Online. "SELECT @@servername" comes close, but I want the name of the database instance rather than the server. I've been reading a lot about dual-booting, and it seems as easy as loading Windows and then loading Linux with GRUB, but everybody says that Windows loves to trash GRUB when it gets the opportunity. What are some steps I can take to prevent this from happening (other than using Windows' bootloader, I want to keep this as simple as possible)? Intuition for $\,c\mid a,b \iff c\mid \gcd(a,b)$ Downloading PlayOnLinux I'm downloading PlayOnLinux to run Paint Tool SAI, but I cannot open PlayOnLinux. When I click on it to open it, a dialog box comes up that says: "PlayOnLinux cannot find curl (from cURL) You need to install it to continue". How do I install this?   I'm referring to this article: How do I check if a given string is a legal/valid file name under Windows? I want to include a batch file rename functionality in my application. A user can type a destination filename pattern and (after replacing some wildcards in the pattern) I need to check if it's going to be a legal filename under Windows. I've tried to use regular expression like [a-zA-Z0-9_]+ but it doesn't include many national-specific characters from various languages (e.g. umlauts and so on). What is the best way to do such a check? Here's an example of a short conversation between me and a native speaker via text messages:  A: I'm so exited for this app B: Yeah, me too A: We start tomorrow B: OK   Shouldn't it be "We are starting tomorrow"?! How to replace one char with another in all filenames of the current directories? Indecomposable limit ordinals A limit ordinal $\gamma&gt;0$ is said to be indecomposable iff $\nexists\alpha,\beta&lt;\gamma$ such that $\alpha+\beta=\gamma$.  In view of this definition, I’m trying to prove the equivalence of the following statements for limit ordinals $\gamma$:  (1) $\gamma$ is indecomposable.  (2) $\alpha+\gamma=\gamma$ $\forall\alpha&lt;\gamma$.  (3) $\gamma=\omega^\alpha$ for some $\alpha\in\mathrm{ON}$.  I’ve been able to get $(1)\implies(2)$ and $(3)\implies(1)$, but I have nothing more than scratch work for $(2)\implies(3)$.  Any suggestions would be appreciated. Topologist's Sine Curve: A rigorous proof of why $\overline{S} = S \cup V$ Let $S$ and $V$ be the following subsets of $\mathbb{R}^2$.  $$ S = \left\{ \ x \times \sin \frac{1}{x} \ \colon  \ 0 &lt; x \leq 1 \ \right\}, \qquad V = \left\{ \ 0 \times y \ \colon \ -1 \leq y \leq 1 \ \right\} = \{ 0 \} \times [-1, 1]. $$ Then how to show rigorously that the closure $\overline{S}$ of $S$ is given by  $$ \overline{S} = S \cup V? $$  By rigorously, I mean using the smme kind of argument as is used in real analysis or topology, such as in (most of) the proofs in Rudin or Munkres.   Intuitively, it is clear that as $x \to 0+0$, then $\sin \frac{1}{x}$ will fluctuate its full range of $[-1, 1]$, and for any point $0 \times y$, where $y \in [-1, 1]$, there will be points of $S$ arbitrarily close to it.   But I'm unable to rigorously show this. When is $2^n \pm 1$ a perfect power Is there an easy way of showing that $2^n \pm 1$ is never a perfect power, except for $2^3 + 1 = 3^2 $?  I know that   gives the result directly, but I'm hopefully for a more elementary method.    I can show that it is never a square, except for $2^3 + 1$.  Proof: Cases $n=1, 2, 3$ are easily dealt with. Henceforth, let $n\geq4$.  $2^n -1 \equiv 3 \pmod{4}$ hence is never a square.     If $2^n +1 =x^2$, then $2^n = (x-1)(x+1)$ and both of these are powers of 2. Thus we must have $(x-1) = 2, (x+1) = 4$. This gives the solution of $2^3 + 1 = 3^2$.    Let's now do an odd prime.  Say $2^n +1 = x^p$. Then $2^n = x^p - 1 = (x-1)(x^{p-1}+x^{p-2} + \ldots +1)$, so both terms are powers of 2. We have $ x = 2^m+1$ is odd. But the other term is the sum of $p$ odd numbers, hence is odd. Since this is clearly greater than 1, we get a contradiction.  Say $2^n -1 = x^p$. Then $2^n = x^p + 1 = (x+1)(x^{p-1} - x^{p-2} + \ldots -x +1 )$, so both terms are powers of 2. We have $x = 2^m -1$ is odd. But the other term is the sum of $p$ odd numbers, hence is odd. Since $x^p + 1 \neq x+1$ except for $p=1$, this means that the term is greater than 1. Hence we get a contradiction. Adventurer enters an other-dimensional realm where he repeatedly dies unexpectedly and wakes up in reality