<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title>Bing: Primitive Cell Examples</title><link>http://www.bing.com:80/search?q=Primitive+Cell+Examples</link><description>Search results</description><image><url>http://www.bing.com:80/s/a/rsslogo.gif</url><title>Primitive Cell Examples</title><link>http://www.bing.com:80/search?q=Primitive+Cell+Examples</link></image><copyright>Copyright © 2026 Microsoft. All rights reserved. These XML results may not be used, reproduced or transmitted in any manner or for any purpose other than rendering Bing results within an RSS aggregator for your personal, non-commercial use. Any other use of these results requires express written permission from Microsoft Corporation. By accessing this web page or using these results in any manner whatsoever, you agree to be bound by the foregoing restrictions.</copyright><item><title>What are primitive roots modulo n? - Mathematics Stack Exchange</title><link>https://math.stackexchange.com/questions/795414/what-are-primitive-roots-modulo-n</link><description>The important fact is that the only numbers $n$ that have primitive roots modulo $n$ are of the form $2^\varepsilon p^m$, where $\varepsilon$ is either $0$ or $1$, $p$ is an odd prime, and $m\ge0$</description><pubDate>Wed, 15 Apr 2026 09:55:00 GMT</pubDate></item><item><title>Show that $2$ is a primitive root modulo $13$.</title><link>https://math.stackexchange.com/questions/1667355/show-that-2-is-a-primitive-root-modulo-13</link><description>I thought $\varphi (12)$ counts the number of coprimes to $12$.. Why does this now suddenly tell us the number of primitive roots modulo $13$? How have these powers been plucked out of thin air? I understand even powers can't be primitive roots, also we have shown $2^3$ can't be a primitive root above but what about $2^9$?</description><pubDate>Thu, 09 Apr 2026 08:58:00 GMT</pubDate></item><item><title>calculus - Why is "antiderivative" also known as "primitive ...</title><link>https://math.stackexchange.com/questions/3064488/why-is-antiderivative-also-known-as-primitive</link><description>While antiderivative, primitive, and indefinite integral are synonymous in the United States, other languages seem not to have any equivalent terms for antiderivative. As others have pointed out here How common is the use of the term "primitive" to mean "antiderivative"?, some languages such as Dutch only use the term, primitive.</description><pubDate>Mon, 06 Apr 2026 01:45:00 GMT</pubDate></item><item><title>Finding a primitive root of a prime number</title><link>https://math.stackexchange.com/questions/124408/finding-a-primitive-root-of-a-prime-number</link><description>How would you find a primitive root of a prime number such as 761? How do you pick the primitive roots to test? Randomly? Thanks</description><pubDate>Fri, 10 Apr 2026 16:20:00 GMT</pubDate></item><item><title>elementary number theory - Find all the primitive roots of $13 ...</title><link>https://math.stackexchange.com/questions/1815832/find-all-the-primitive-roots-of-13</link><description>Primes have not just one primitive root, but many. So you find the first primitive root by taking any number, calculating its powers until the result is 1, and if p = 13 you must have 12 different powers until the result is 1 to have a primitive root.</description><pubDate>Wed, 08 Apr 2026 22:21:00 GMT</pubDate></item><item><title>Prove that , any primitive root $r$ of $p^n$ is also a primitive root ...</title><link>https://math.stackexchange.com/questions/170648/prove-that-any-primitive-root-r-of-pn-is-also-a-primitive-root-of-p</link><description>Suppose that $r$ is not a primitive root modulo $p$, so there is some $b&lt;p-1$ such that $r^b\equiv 1\bmod p$. In other words, there is some integer $t$ such that $r^b=1+pt$.</description><pubDate>Wed, 15 Apr 2026 23:45:00 GMT</pubDate></item><item><title>elementary number theory - Order, primitive roots modulo 19 ...</title><link>https://math.stackexchange.com/questions/4543726/order-primitive-roots-modulo-19</link><description>Explore related questions elementary-number-theory modular-arithmetic primitive-roots See similar questions with these tags.</description><pubDate>Sat, 11 Apr 2026 19:25:00 GMT</pubDate></item><item><title>euclidean algorithm - Proof of Euclid's formula for primitive ...</title><link>https://math.stackexchange.com/questions/3284909/proof-of-euclids-formula-for-primitive-pythagorean-triples</link><description>I have been reading about Pythagorean triples from the wiki page link here. It says that a pythagorean triple consists of 3 positive integer's $ a, b, c $ such that $ a^2 + b^2 = c^2 $. Also if a...</description><pubDate>Tue, 14 Apr 2026 14:14:00 GMT</pubDate></item><item><title>finite fields - Understanding Primitive Polynomials in GF (2 ...</title><link>https://math.stackexchange.com/questions/312186/understanding-primitive-polynomials-in-gf2</link><description>After you have one primitive polynomial, you often want to find other closely related ones. For example, when calculating generating polynomials of a BCH-code or an LFSR of a Gold sequence (or other sequence with known structure) you encounter the following task.</description><pubDate>Sun, 05 Apr 2026 10:14:00 GMT</pubDate></item><item><title>complex analysis - Do holomorphic functions have primitive ...</title><link>https://math.stackexchange.com/questions/4404697/do-holomorphic-functions-have-primitive</link><description>There is a very deep connection between the shape of $\Omega$ and the existence of primitives on $\Omega$. For now, let's assume that $\Omega$ is connected. Then it can be shown that every holomorphic function $\Omega\to\mathbb C$ has a primitive if and only if $\Omega$ is simply connected. Meaning that $\Omega$ has no holes. Geometrically speaking, if $\Omega$ has a hole, then we could ...</description><pubDate>Sun, 12 Apr 2026 22:52:00 GMT</pubDate></item></channel></rss>