Is it possible to create an event handler for changes in values of variables?
Triggering actions when a variable is set
W.K.T, any user(with more than 2k rep) can review 20 suggested edits per day.  Today I saw the newly appointed moderator  reviewed more than 20.    Is it possible for moderators to review more than the daily limited count?  If yes, can any moderators can do it at any time?  I didn't see this before. Prevent direct access to a php include file I have a php file which I will be using as exclusively as an include. Therefore I would like to throw an error instead of executing it when it's accessed directly by typing in the URL instead of being included.  Basically I need to do a check as follows in the php file:  if ( $REQUEST_URL == $URL_OF_CURRENT_PAGE ) die ("Direct access not premitted");   Is there an easy way to do this? Why does range(start, end) not include end? Problem with ListVectorPlot3D What is the difference between 32-bit and 64-bit Ubuntu? I've heard the 64-bit platform performs better and can detect more than 4GB of RAM. Also, while some apps haven't ported to 64-bit yet, ia32-libs lets a 64-bit machine run them.  If so, why not promote 64-bit over 32-bit? Prove: If $a\mid m$ and $b\mid m$ and $\gcd(a,b)=1$ then $ab\mid m$ "Stack Overflow requires external JavaScript from another domain" message Calculate Time Remaining Is the set of all finite sequences of letters of Latin alphabet countable/uncountable? How to prove either? Today in Coding/Cryptography class, we were talking about basic definitions, and the professor mentioned that for a set $A=\left \{ \left. a, b, \dots, z \right \} \right.$ (the alphabet) we can define a set $A^{*}=\left \{ \left. a, ksdjf, blocks, coffee, maskdj, \dots, asdlkajsdksjfs \right \} \right.$ (words) as a set that consists of all finite sequences of the elements/letters from our $A$/alphabet. My question is, is this set $A^{*}$ countably or uncountably infinite? Does it matter how many letters there are in your alphabet? If it was, say, $A=\left \{ \left. a \right \} \right.$, then the words in $A^{*}$ would be of form $a, aa, aaa, \dots$ which, I think, would allow a bijection $\mathbb{N} \to A^{*}$ where an integer would signify the number of a's in a word. Can something analogous be done with an alphabet that consists of 26 letters (Latin alphabet), or can countability/uncountability be proved otherwise? And as mentioned before, I am wondering if the number of elements in the alphabet matters, or if all it does is change the formula for a bijection.   P.S. Now that I think of it, maybe we could biject from $\underset{n}{\underbrace{\mathbb{N}\times\mathbb{N}\times\mathbb{N}\times\dots\times\mathbb{N}}}$ to some set of words $A^{*}$ whose alphabet $A$ has $n$ elements? Thanks! Using ArcPy to convert .txt to shapefile with coordinate system? I tried to define my coordinate system on creating the shapefile but when I zoom to layer I don't see my features and ArcGIS crashes. I know it's not in the coordinate system I defined for it but it shows the coordinate under properties but doesn't reflect when I zoom to layer. Here is my python code:  import arcpy  newfcName ="newfc.shp"   outpath = r"C:/FLOOD/IKEJA AND KOSOFE"  # Declaration arcpy.env.overwriteOutput=True  arcpy.env.workspace= outpath  # Create new Shapefile and add FIELDS newfc = arcpy.CreateFeatureclass_management(outpath, newfcName, "Point") # get the coordinate system by describing a feature class dsc = arcpy.Describe("newfc.shp" )  coord_sys = dsc.spatialReference  try:        # run the tool    arcpy.DefineProjection_management(newfcName , coord_sys)     # print messages when the tool runs successfully    print(arcpy.GetMessages(0))  except arcpy.ExecuteError:    print(arcpy.GetMessages(2))  except Exception as ex:    print(ex.args[0])  arcpy.AddField_management(newfc, "X", "STRING", field_length = 50) arcpy.AddField_management(newfc, "Y", "STRING", field_length = 50) arcpy.AddField_management(newfc, "Z", "STRING", field_length = 50) arcpy.AddField_management(newfc, "I", "FLOAT", field_length = 50)  # Reference Cursors cursor=arcpy.da.InsertCursor(newfc, ["X", "Y", "Z", "I"])  # Read File  a = open("C:/FLOOD/IKEJA AND KOSOFE/DEM/532722.txt","r")  inputF = a.readlines()  for line in inputF:     xCoordinate, yCoordinate, zValue, iValue = line.split(" ")      newRow = (str(xCoordinate), str(yCoordinate), str(zValue), float(iValue))      cursor.insertRow(newRow)  a.close() All matrices which commute with all $2\times 2$ matrices I would like to find all matrices which commute with all $2\times2$ matrices.  I started solving problem in this way:    1) I have this matrix $A$ with real numbers: $$A=\left[\begin{array}{cc}a &amp;b\\c &amp;d\end{array}\right]$$ 2) Matrix which commute with matrix $A$ is matrix $B$: $$B = \left[\begin{array}{cc}e&amp; f\\ g &amp;h\end{array}\right]$$ 3) When i solve the equation $AB=BA$, I get this: $$\left[\begin{array}{cc}ae+bg&amp;af+bh\\ce+dg&amp;cf+dh\end{array}\right]=\left[\begin{array}{cc}ea+cf&amp;eb+df\\ga+ch&amp;gb+dh\end{array}\right]$$  How I can get the general look of wanted matrix? If $Ax = Bx$ for all $x \in C^{n}$, then $A = B$. Let $A$ and $B$ are $n\times n$ matrices and $x \in C^{n}$.  If $Ax = Bx$ for all $x$ then $A = B$. To prove this I have selected  $x$ from Euclidean basis B = {$e_{1},e_{2},...,e_{n}$}. Then $Ae_{i} = Be_{i}$ implies $i^{th}$ column of A = $i^{th}$ column of B for all $1 \leq i \leq n$. Hence $A = B.$    Is this proof complete? Note: This question was asked at a time when C# did not yet support optional parameters (i.e. before C# 4).  We're building a web API that's programmatically generated from a C# class. The class has method GetFooBar(int a, int b) and the API has a method GetFooBar taking query params like &amp;a=foo &amp;b=bar.   The classes needs to support optional parameters, which isn't supported in C# the language. What's the best approach? Does Ubuntu come with a preinstalled or automatic firewall? If not, do I need one?   I've read some articles about the advantages of Linux over other operating systems about security (no need to have antivirus, ...) but would like to be sure. Why shouldn't I use "Hungarian Notation"? Find a real function $f:\mathbb{R}\to\mathbb{R}$ such that $f(f(x)) = -x$? I've been perusing the internet looking for interesting problems to solve. I found the following problem and have been going at it for the past 30 minutes with no success:     Find a function $f: \mathbb{R} \to \mathbb{R}$ satisfying $f(f(x)) = -x$ for all $x \in \mathbb{R}$.   I am also wondering, can we find $f$ so that is continuous?  I was thinking of letting $f$ be a periodic function, and adding half the period to x each time. I had no success with this, and am now thinking that such a function does not exist.  Source: I am part of a “study team” that authored a paper. How do I list in in my CV? In Russian we have idiom/saying "To shoot out of cannon into sparrows" (literal translation) which is used to convey an idea of applying too drastic measures to small problems. I believe there should be some native-English equivalents to this saying. Can you share if there are any? To an an external observer it appears that time has stopped for photon. But this relation is reflexive, so for an observer travelling with the photon it appears the universe has stopped everywhere.  Is this right?  Space also gets distorted parallel to the direction of motion, but not perpendicular to it.   Does this mean that for an observer travelling with a photon sees spacetime as a flat plane?  Note 1: I'm using language vividly not literally when I say a photon experiences space and time. Not that I'm against idealist or panpyschist interpretations of matter or energy come to that.  Note 2: Since it's been pointed out that an inertial frame can't be boosted into the frame of a photon and moreover there is no limiting behaviour here - no matter what frame you are boosted into, light will always appear to travel at c. Nevertheless, when an external observer watches a train chasing a photon by gradually increasing its speed, he will note that the train speed is approaching the speed of the photon (but will never match it) and when he looks at the clock inside the train he will not too that it is gradually slowing down (but never actually stops). Using this picture, we can attempt the thought experiment - if not one that can be carried out - of what a world looks like to a photon. Proof of Equivalence Relation $R=\{(a,b)\in\Bbb N^2: 5\mid (2a+3b)\}$ Given a set of natural numbers ($\Bbb N$), and the relation $R=\{(a,b)\in\Bbb N^2: 5\mid (2a+3b)\}$. Is $R$ an equivalent relation?   My answer: Yes, because $2a + 3b$ is divisible by $5$, if and only if, $2a + 3b − 5b$ is divisible by $5$.  Is my reasoning right?   If it is not, then how do I prove that this is an equivalent relation?