I'm not sure if I'm on the right track with this problem. So far I've said: 264=(232)2≡−1 (mod p). Then by Fermat's two square theorem p=2 or p≡1 (mod 4). We know p≠2 because p|(264+1). Then p≡1 (mod 4). From here I'm unsure on how to proceed.
Subscribe to:
Post Comments (Atom)
real analysis - How to find limhrightarrow0fracsin(ha)h
How to find limh→0sin(ha)h without lhopital rule? I know when I use lhopital I easy get $$ \lim_{h\rightarrow 0}...
-
Ok, according to some notes I have, the following is true for a random variable X that can only take on positive values, i.e P(X\int_0^...
-
Self-studying some properties of the exponential-function I came to the question of ways to assign a value to the divergent sum $$s=\sum_{k=...
-
The question said: Use the Euclidean Algorithm to find gcd (1207,569) and write (1207,569) as an integer linear combination of 1207 ...
No comments:
Post a Comment