2
votes
1answer
73 views

A problem about the discrete logarithm

suppose there are a multiplicative cyclic group $F_p^*(p \;is\;big\; prime)$, and $G=\langle g \rangle(g \;is\; a\; generator)$ is a subgroup of it and $G$'s order is $q(q\;is\;big\;prime \;and ...
1
vote
1answer
357 views

Quadratic forms and prime numbers in the sieve of Atkin

I'm studying the theorems used in the paper which explains how the sieve of Atkin works, but I cannot understand a point. For example, in the paper linked above, theorem 6.2 on page 1028 says that if ...
4
votes
1answer
105 views

Partitioning polynomials in $\mathbb{Z}[x,y]$ by the primes they represent

Suppose you have a set $S\subset\mathbb{Z}[x,y].$ How can one efficiently partition the polynomials into sets such that the primes represented by the polynomials in any given set are identical? For ...
26
votes
2answers
819 views

Elementary proof that $2x^2+xy+3y^2$ represents infinitely many primes?

We did in class $x^2+y^2$, which was easy, and we had for homework $2x^2+2xy+3y^2$, which I did (its values (if not square) must be divisible by form primes, or of the form $x^2+5y^2$, and clearly ...