If $F$ is field such that $|F|=q=p^n$, $(m,p)=1$ and $E$ is the splitting field of $x^m-1\in F[x]$ then $[E:F]$ is the minimum positive integer $k$ such that $m \mid (q^k-1)$. I have no any idea on this. But I really want to know how to prove this. Thanks!
Let $k$ be a finite field of order $q$ in characteristic $p$, let $n$ be a positive integer not divisible by $p$, and let $K$ be the splitting field of $X^n-1$ over $k$. Prove that $[K:k]$ equals the smallest positive integer $d$ such that $n\mid q^d-1$.  My approach: It's easy to show that if $k$ is a finite field of order $q$ with $\text{char} \ k=p$ then $k=\mathbb{F}_{q}$ with $q=p^m$ with $m\geq 1$. If $K$ is the splitting field of $X^n-1$ over $k$ then $K=\mathbb{F}_{q^r}$ for some suitable $r\geq 1$.  Let $\alpha \in K=\mathbb{F}_{q^r}$ be a root of $X^n-1$ then $\alpha^n-1=0$ and $\alpha\neq 0$.   Thus, $\alpha^n=1$ and $\alpha \in \mathbb{F}^{\times}_{q^r}$ where $\mathbb{F}^{\times}_{q^r}$ is the cyclic group of order $q^r-1$.  But I have some difficulties:  1) From $\alpha^n=1$ it follows that $o(\alpha)\mid n$. How to show that $o(\alpha)=n$? I was trying to show it using that $(n,p)=1$ but I failed.  Remark: Because if we can show that $o(\alpha)=n$ then the desired result follows immediately from cyclicity of multiplicative group of field $\mathbb{F}_{q^r}$.  I have spent one day in order to come up with this approach. So please do not duplicate this question and can anyone show how to answer my question, please.  Detailed explanation would be great!
How to tell how many CPUs (cores) you have on Windows 7 Optimum Bone To Water Ratio For Pork and Beef Stocks I am tinkering with my stock recipes.   For pork stock I have been using 8 cups of water over a roasted trotter, a roasted backbone section with about 4 inches of rib attached, and a 1/4 inch slab of roasted pork belly.   For the beef stock I have been using 8 cups of water over an equivalent amount of roasted beef bones (knuckles and backbone/rib).   This gives a very flavorful stock and, for cost reasons, I want to determine how much I can reduce the concentration (by adding more water) without reaching too watery a taste.   Does anybody have any guidance on this topic? Sum of the series $1+\frac{1\cdot 3}{6}+\frac{1\cdot3\cdot5}{6\cdot8}+\cdots$ apt-get install vs pip install I am a bit confused about the cases in which the above commands must be used when downloading python packages. I was trying to download a package named pyudev in accordance with an answer with this . I executed this command :  sudo pip install python-pyudev   but received the following message :  Downloading/unpacking python-pyudev    Could not find any downloads that satisfy the requirement python-pyudev Cleaning up... No distributions at all found for python-pyudev Storing complete log in /home/vineet/.pip/pip.log   However the following worked fine :  sudo apt-get install python-pyudev   When is apt-get supposed to be used to install packages and when is python-pip used? Checking for a null int value from a Java ResultSet This is a question thats been bothering me a while. I don't even know if it makes sense or not (like if it is a physics question or becoming a philosophical one). But here it goes. The crux of my question basically is that we all know that we can't see light (like in its photon or electromagnetic wave form) directly when it is traveling past us. However, we also know that the way we see objects is by light reflecting off them. This then means that we are "seeing" the light reflecting from the object which then sends the signal to our brain saying that we are seeing a particular object. We know that both light traveling past us and light reflected from objects are made of photons (so they are the same kind)? So then my question is that what is happening to the photon of a light after it is reflected from the objects, that causes us to see it or the object, but on the other hand we can't see light as it is directly traveling past us. I have been stuck in a problem, that has thrown my brain out of the coding. This problem is at very high priority and I need the solution as early as possible. Problem is as :  There are exactly N advertising boards on the highway. Now a company want to advertise on some of these advertising boards(each advertising board costs some money) .  Company strategy is that, they want at least 'K' advertisement should be there among M consecutive advertising boards. But at the same time Company want to pay minimum for its advertisement .  Now, what is the total number of ways, different ways Company can advertise meeting its minimum cost strategy.  As for Example: N= 3, M = 2, K=1 ==> there is only one way for minimum cost, ie. 0C0 , where '0' denotes No company advertisement, and 'C' denotes company advertisement board.  Similarly, for N =4, M =2, K =1 ==> there is 3 possible ways, ie. C0C0, 0C0C, 0CC0.  Hope to get a reply from someone soon. Thanks. Formatting OGR VRT file to convert CSV to KML? I am attempting to get a nice KML for simple review of POI/geocoding from a CSV. I a using ogr2ogr and a VRT. You can see the VRT file below, with two attempts to get this right.  Basically, the issue is using ogr2ogr -f KML ... with the VRT w/o renaming results in a lot of "SimpleData" tags in the KML.   I'd like to get some CSV fields as the KML Placemark "Name" and "Description", concatenated fields, actually. -dsco NameField=RegionName option in ogr2ogr, but I don't see a way to concatenate fields into name, e.g Street, City, State..  In the .vrt below, the SrcSQL field results in no records. It does open, but with layer info. The Field tag (when not commented out) does result all records with in the new alias, but the "name" is the only field that comes through, it drops all other fields.  Is there a way to concatenate fields using ?  Of course, perhaps ogr is not capable of concatenation ...  &lt;OGRVRTDataSource&gt;     &lt;OGRVRTLayer name="roofing-poi2"&gt;         &lt;SrcDataSource&gt;roofing-poi2.csv&lt;/SrcDataSource&gt;         &lt;GeometryType&gt;wkbPoint&lt;/GeometryType&gt;         &lt;LayerSRS&gt;WGS84&lt;/LayerSRS&gt;         &lt;GeometryField encoding="PointFromColumns" x="Longitude" y="Latitude"/&gt; &lt;!--         &lt;Field src="StreetAddress" name="name" /&gt; --&gt;         &lt;SrcSQL&gt;SELECT StreetAddress as name&lt;/SrcSQL&gt;     &lt;/OGRVRTLayer&gt; &lt;/OGRVRTDataSource&gt; I am using LaTeX with the article document class. The Bibtex bibliography style that I am using is agsm, part of the Harvard family of bibliography styles.  I have two questions:  (1) If I cite an entry of type @book, then in the reference list I get publisher, address. I would like to re-arrange this order to address: publisher. Which part of agsm.bst should I modify?  (2) I would like to change single quotation marks ' ' to double quotation marks " " for setting off the title of entries of type @article. Which part of agsm.bst should I focus on? Reducibility of polynomials modulo p What are the differences between 32-bit and 64-bit systems?  If you have used both of them, what kind of sharp differences have you experienced?   Would it be a problem to use 32-bit programs on 64-bit systems in some cases? Binary search (bisection) in Python Is there a library function that performs binary search on a list/tuple and return the position of the item if found and 'False' (-1, None, etc.) if not?  I found the functions bisect_left/right in the , but they still return a position even if the item is not in the list. That's perfectly fine for their intended usage, but I just want to know if an item is in the list or not (don't want to insert anything).  I thought of using bisect_left and then checking if the item at that position is equal to what I'm searching, but that seems cumbersome (and I also need to do bounds checking if the number can be larger than the largest number in my list). If there is a nicer method I'd like to know about it.  Edit To clarify what I need this for: I'm aware that a dictionary would be very well suited for this, but I'm trying to keep the memory consumption as low as possible. My intended usage would be a sort of double-way look-up table. I have in the table a list of values and I need to be able to access the values based on their index. And also I want to be able to find the index of a particular value or None if the value is not in the list.  Using a dictionary for this would be the fastest way, but would (approximately) double the memory requirements.  I was asking this question thinking that I may have overlooked something in the Python libraries. It seems I'll have to write my own code, as Moe suggested. Prove there are k consecutive non-squarefree integers So, I've got a question for class that asks me to prove the existence of arbitrarily long runs of consecutive integers where $\mu(n)$ is zero.   I've started the proof, but I need a bit of help midway through.  Assume there exists a run of length n, which we currently assume is the longest possible chain.  If we induct on n, we can assume there is a run of the form $m_1p_1^2, m_2p_2^2, ..., m_np_n^2$ (where each of the $p_i$ are prime).  If I add $M =  lcm(m_1p_1^2, m_2p_2^2, ..., m_np_n^2)$ to each number, I get another run of length n.  So here's where the issue starts. When I talked to my advisor about it, he referenced a theorem where there exists a prime $p$ congruent to $1\ mod\ M$.  I am unfamiliar with this theorem, so I'm not sure how to use this information. Any chance I can get some help? Or else is there a simpler way to go about this problem? Maximizing expected value of coin reveal game I was asked this question today in an interview and am still not sure of the answer. The question is as follows.   Part one:  Say I have flipped 100 coins already and they are hidden to you. Now I reveal these coins one by one and you are to guess if it is heads or tails before I reveal the coin. If you get it correct, you get $\$1$. If you get it incorrect, you get $\$0$. I will allow you to ask me one yes or no question about the sequence for free. What will it be to maximize your profit?  My approach for this part of the problem was to ask if there were more heads than tails. If they say yes, I will just guess all heads otherwise I just guess all tails. I know the expected value for this should be greater than 50 but is it possible to calculate the exact value for this? If so, how would you do it?   Part two: Same scenario as before but now I will charge for a question. I will allow you to ask me any amount of yes or no questions as I go through this process for $\$1$. What is your strategy to maximize your profit?  I was not sure about the answer to this part of the question. Would the best option be to guess randomly? I think the expected value of this should be 50. I am not sure about the expected value of part one but if it is greater than 51, I think I could also use that approach. Anyone have a good idea for this part? Documents with typical LaTeX errors I am giving a LaTeX course and have the idea to let the students find and solve problems within a few documents. Basically they shall learn how to create minimal examples and read error messages.  However, currently I have no document with 'typical' errors around.  If someone has such examples from him- or herself or within this forum I would like to have the code or link. It does not matter if its short or long. It should just be enough to let the students play with it for some minutes. Safari Extension to Manage Tabs? How do I fix a "Problem with MergeList" or "status file could not be parsed" error when trying to do an update? How to populate UIList with all material slot in scene? 2.8 Chatroom owners can star their own messages I was able to star my own message by pinning it and unpinning it.  Pinning a message adds a star, even to your own messages, but when the pin is removed, the star remains. Rounded corners in TikZ trees.