Kaish

1,818 reputation

119

bio	website
	location
	age
visits	member for	9 months
	seen	3 hours ago
stats	profile views	512

	1,818 reputation	bio	website		visits	member for	9 months
119 badges		location			seen	3 hours ago

summary answers questions tags badges favorites bounties reputation activity

772 Actions

suggestions reviews revisions comments badges posts accepts all

5h	revised	Show that $\left( \frac{q}{p} \right) \equiv q^{(p-1) / 2} \mod p$, where $\left( \frac{q}{p} \right)$ is the Legendre Symbol edited body
5h	comment	Show that $\left( \frac{q}{p} \right) \equiv q^{(p-1) / 2} \mod p$, where $\left( \frac{q}{p} \right)$ is the Legendre Symbol I just had a thought, here, we (or you) prove that it is either $\pm 1 \mod p$, but the symbol isn't supposed to show that. An element can be a quadratic reisudue and be $-1 \mod p$ and it can not be a quadratic residue and be $-1 \mod p$, so how does this show that's what the symbol is?
6h	revised	Identify all $a \mod 35$ such that $35$ is a pseudoprime to base $a$ added 8 characters in body
6h	revised	Identify all $a \mod 35$ such that $35$ is a pseudoprime to base $a$ edited body
8h	comment	Shortcut in calculating examples of elements of a given order? So, to put it in other words, I first find the primitive element, $g$. Then, lets say I want an element of order $10$, I do $30/10 = 3$, and so I find $k$ such that $\gcd(k,g) = 1$ and $\gcd(k,30) = 3$ and then just do $g^3$?
9h	asked	Shortcut in calculating examples of elements of a given order?
10h	comment	Show that $\left( \frac{q}{p} \right) \equiv q^{(p-1) / 2} \mod p$, where $\left( \frac{q}{p} \right)$ is the Legendre Symbol Oh, I meant I did it in this question when I used Fermat to show that $a^2 \equiv (blah)$, can that bit not be used again?
10h	comment	Show that $\left( \frac{q}{p} \right) \equiv q^{(p-1) / 2} \mod p$, where $\left( \frac{q}{p} \right)$ is the Legendre Symbol Whats $e$? Just some random integer that gives us $b \mod p$?
10h	comment	Show that $\left( \frac{q}{p} \right) \equiv q^{(p-1) / 2} \mod p$, where $\left( \frac{q}{p} \right)$ is the Legendre Symbol I've already shown that $x^2 \equiv 1 \mod p$ so I can then just say from here we can see that $x \equiv \pm 1 \mod p$?
10h	comment	Show that $\left( \frac{q}{p} \right) \equiv q^{(p-1) / 2} \mod p$, where $\left( \frac{q}{p} \right)$ is the Legendre Symbol @JyrkiLahtonen Yeah, its that group. What's the difference?
10h	revised	Show that $\left( \frac{q}{p} \right) \equiv q^{(p-1) / 2} \mod p$, where $\left( \frac{q}{p} \right)$ is the Legendre Symbol added 15 characters in body
10h	accepted	Identify all $a \mod 35$ such that $35$ is a pseudoprime to base $a$
10h	asked	Show that $\left( \frac{q}{p} \right) \equiv q^{(p-1) / 2} \mod p$, where $\left( \frac{q}{p} \right)$ is the Legendre Symbol
11h	accepted	Find what values of $n$ give $\varphi(n) = 10$
11h	comment	Identify all $a \mod 35$ such that $35$ is a pseudoprime to base $a$ You mean it must divide $\varphi(7) = 6$, not $\varphi(6)$
23h	comment	Identify all $a \mod 35$ such that $35$ is a pseudoprime to base $a$ @AndréNicolas Oh, so once I have these conditions, I still have to solve them for $x$? I.e chinese remainder theorem (unless it's easy to spot). Also, was my $\gcd$ "cheat" correct?
1d	asked	Identify all $a \mod 35$ such that $35$ is a pseudoprime to base $a$
1d	comment	Find what values of $n$ give $\varphi(n) = 10$ @TobiasKildetoft You mean using fundamental theorem of arithmetic? Also, can I keep editing the question with what I'm doing so you can see if I'm making mistakes anywhere?
1d	asked	Find what values of $n$ give $\varphi(n) = 10$
1d	comment	If $17 \mid \frac{n^m - 1}{n-1}$ find the values of $n$ where $m$ is even but not divisible by $4$ Think you misread it slightly lol, I need the $n$ values, not the $m$ ones. Unless that was a typo on your part?