<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title>Bing: Primitive vs Reference Type Java</title><link>http://www.bing.com:80/search?q=Primitive+vs+Reference+Type+Java</link><description>Search results</description><image><url>http://www.bing.com:80/s/a/rsslogo.gif</url><title>Primitive vs Reference Type Java</title><link>http://www.bing.com:80/search?q=Primitive+vs+Reference+Type+Java</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>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>Thu, 02 Apr 2026 15:33:00 GMT</pubDate></item><item><title>The primitive $n^ {th}$ roots of unity form basis over $\mathbb {Q ...</title><link>https://math.stackexchange.com/questions/4896602/the-primitive-nth-roots-of-unity-form-basis-over-mathbbq-for-the-cyclo</link><description>We fix the primitive roots of unity of order $7,11,13$, and denote them by $$ \tag {*} \zeta_7,\zeta_ {11},\zeta_ {13}\ . $$ Now we want to take each primitive root of prime order from above to some power, then multiply them. When the number of primes is small, or at least fixed, the notations are simpler.</description><pubDate>Tue, 31 Mar 2026 19:46:00 GMT</pubDate></item><item><title>Primitive positive integer solutions of $a^4 + b^4 + c^4 = d^4 + kabcd$</title><link>https://math.stackexchange.com/questions/5122227/primitive-positive-integer-solutions-of-a4-b4-c4-d4-kabcd</link><description>Within the conventional range of $a \le b \le c \le 200$ and $d \le 1000000$, no primitive positive integer solution has been found for any of these 11 values of $k$, and constructing one using elliptic curve methods is extremely difficult.</description><pubDate>Mon, 16 Mar 2026 12:54:00 GMT</pubDate></item><item><title>Primitive and modular ideals of $C^ {\ast}$-algebras</title><link>https://math.stackexchange.com/questions/4694030/primitive-and-modular-ideals-of-c-ast-algebras</link><description>So $\ker\pi$ is primitive but not modular. To find a modular ideal that is not primitive, we need to start with a unital C $^*$ -algebra (so the quotient will be unital) and consider a non-irreducible representation.</description><pubDate>Tue, 31 Mar 2026 18:12:00 GMT</pubDate></item><item><title>A primitive root modulo p is a primitive root modulo $p^2$ if and only ...</title><link>https://math.stackexchange.com/questions/4539007/a-primitive-root-modulo-p-is-a-primitive-root-modulo-p2-if-and-only-if-gp</link><description>For what you are finally supposed to show, you now know that if $g$ is a primitive root mod $p^2$, $g^ {p-1} \not\equiv 1 \bmod p^2$ and $\textbf {vice versa}$.</description><pubDate>Sat, 04 Apr 2026 03:34:00 GMT</pubDate></item><item><title>abstract algebra - Finding primitive element of field extension ...</title><link>https://math.stackexchange.com/questions/3956314/finding-primitive-element-of-field-extension</link><description>Finding primitive element of field extension. Ask Question Asked 5 years, 3 months ago Modified 5 years, 3 months ago</description><pubDate>Sat, 21 Mar 2026 16:44:00 GMT</pubDate></item><item><title>Equivalent definition of primitive Dirichlet character</title><link>https://math.stackexchange.com/questions/4055365/equivalent-definition-of-primitive-dirichlet-character</link><description>A character is non-primitive iff it is of the form $1_ {\gcd (n,k)=1} \psi (n)$ with $\psi$ a character $\bmod m$ coprime with $k$. A character $\bmod p^2$ can be primitive with conductor $p$.</description><pubDate>Sat, 04 Apr 2026 01:33:00 GMT</pubDate></item><item><title>What is a primitive polynomial? - Mathematics Stack Exchange</title><link>https://math.stackexchange.com/questions/1324/what-is-a-primitive-polynomial</link><description>9 What is a primitive polynomial? I was looking into some random number generation algorithms and 'primitive polynomial' came up a sufficient number of times that I decided to look into it in more detail. I'm unsure of what a primitive polynomial is, and why it is useful for these random number generators.</description><pubDate>Fri, 03 Apr 2026 17:04:00 GMT</pubDate></item><item><title>Are all natural numbers (except 1 and 2) part of at least one primitive ...</title><link>https://math.stackexchange.com/questions/5107032/are-all-natural-numbers-except-1-and-2-part-of-at-least-one-primitive-pythagor</link><description>Hence, all odd numbers are included in at least one primitive triplet. Except 1, because I'm not allowing 0 to be a term in a triplet. I can't think of any primitive triplets that have an even number as the hypotenuse, but I haven't been able to prove that none exist.</description><pubDate>Wed, 18 Mar 2026 23:43:00 GMT</pubDate></item><item><title>abstract algebra - Primitive and Induced Dirichlet Characters ...</title><link>https://math.stackexchange.com/questions/4090116/primitive-and-induced-dirichlet-characters</link><description>The one called "Introduction to analytic number theory", Chapter $8$ on Dirichlet characters, induced moduli and primitive characters.</description><pubDate>Thu, 02 Apr 2026 22:28:00 GMT</pubDate></item></channel></rss>