\documentclass[12pt,a4]{article}

\usepackage{amsmath,amssymb,amsthm,bm}
\newcommand{\topictitle}[1]{\title{#1}\def\t@pic{#1}\setcounter{equation}{0}}
\newcommand{\topiccode}[1]{\topic{#1}{\t@pic}}
\renewcommand{\author}[1]{\def\auth@r{#1}}
\renewcommand{\date}[1]{\time{\auth@r\quad{#1}}}
\newcommand{\ve}[1]{\boldsymbol{\mathrm{#1}}}
\newcommand{\R}{\mathbb{R}}
\newcommand{\C}{\mathbb{C}}
\newcommand{\N}{\mathbb{N}}
\newcommand{\Z}{\mathbb{Z}}
\newcommand{\Q}{\mathbb{Q}}
\newcommand{\diff}{\mathrm{d}}
\renewcommand{\d}[1]{\,\mathrm{d}{#1}}
\newcommand{\ee}{\mathrm{e}}
\newcommand{\ii}{\mathrm{i}}
\newcommand{\pdhfrac}[2]{\mathchoice{\frac{#1}{#2}}{#1/#2}{#1/#2}{#1/#2}}
\newcommand{\dd}[2]{\pdhfrac{\mathrm{d}#1}{\mathrm{d}#2}}
\newcommand{\sdd}[2]{\pdhfrac{\mathrm{d}^2#1}{\mathrm{d}#2^2}}
\newcommand{\pd}[2]{\pdhfrac{{\partial}#1}{{\partial}#2}}
\newcommand{\spd}[2]{\pdhfrac{\partial^2#1}{{\partial}#2^2}}
\newcommand{\mpd}[3]{\pdhfrac{\partial^2#1}{{\partial}#2{\partial}#3}}
\renewcommand{\geq}{\geqslant}
\renewcommand{\leq}{\leqslant}
\renewcommand{\theequation}{\topicmark\arabic{equation}}

\begin{document}

\begin{center}
{\bf The University of Oxford}\\[5mm]

{\bf MSc (Mathematics and Foundations of Computer Science)}\\[5mm]

{\large\bf Elliptic Curves}\\[3mm]

{\bf Michaelmas Term 2017} 

\end{center}

\medskip

\noindent {\em The steps of (each) miniproject are for your guidance; if
you wish 
to take an alternative route to the desired goal, you are free to do so.
But, if 
you follow the suggested route and find yourself unable to carry out any
particular 
step, you may simply assume it so that you can continue with the
miniproject, 
but should make this assumption clear in your presentation.}


\medskip
\noindent {\em Please write or print on one side of the paper only.}\\[3ex]
\medskip

\begin{enumerate}
\item[(a)] If $\mathcal{E}$ is an elliptic curve defined over
$\mathbb{Q}$, we begin by asking whether one can have
$\mathcal{E}(\mathbb{F}_p)\cong\mathcal{E}(\mathbb{F}_q)$ for distinct
primes $p$ and $q$.  Show by example that this can happen when $p=5$
and $q=7$.  Prove in contrast that it can never happen for $p=101$ and $q=151$.
\bigskip

\item[(b)] Suppose that the elliptic curve $\mathcal{E}_{a,b}$ is
  given  by $y^2=x^3+ax+b$ with $a,b\in\mathbb{Z}$.  Give an example
  of congruence
  conditions on $a$ and $b$ which will ensure that $\mathcal{E}_{a,b}$
  has only trivial torsion (over $\mathbb{Q}$).  Deduce that a
  positive proportion of elliptic curves over $\mathbb{Q}$ have
  trivial torsion, in the sense that if
\[N(X):=\#\{(a,b)\in\mathbb{Z}:|a|,|b|\leq X,\,\mathcal{E}_{a,b}\mbox{
  has trivial torsion}\}\]
then
\[\liminf_{X\rightarrow\infty} X^{-2}N(X)>0.\]
Do you expect the proportion of curves with non-trivial torsion groups
to be positive, or zero?  You should discuss your
answer, {\bf but you are not expected to prove anything}.
\bigskip

\item[(c)] For any integer $n\in\mathbb{N}$ we write $\omega(n)$ to
  denote the number of distinct prime factors of $n$, so that
  $\omega(36)=2$, for example.  Let $\mathcal{E}: y^2=x(x^2+ax+b)$ 
be an elliptic curve with $a,b\in\mathbb{Z}$ satisfying $b>0$ and $a^2-4b>0$.
Show how to give a bound for the rank of $\mathcal{E}$ in terms of
$\omega(b)$ and $\omega(a^2-4b)$.

If $b$ and $a^2-4b$ are distinct primes, under what circumstances can
you show that $\mathcal{E}$ must have rank zero? Can you say anything
about the rank being zero in the case in which $b=p_1p_2$ and 
$a^2-4b=p_3$, for distinct primes $p_1,p_2,p_3$? 

Prove that if
$b$ and $a^2-4b$ are distinct primes, then the torsion group must 
have size at most 
100, and say to what extent this bound can be improved.
\bigskip

\item[(d)] 
Let $E_n$ be the elliptic curve
$$y^2=x^3-nx.$$
where $n$ is a non-zero integer. 

\medskip


(i) Let $Q\in E_n(\Q)$. Write $Q=(a/d^2, b/d^3)$, where $a,b,d$ are coprime 
integers. Find explicitly a constant $C_1$ that depends only on $n$ and $Q$ 
such that
$$h(P+Q)\leq 2h(P)+C_1$$
for all $P \in E_n(\Q)$.
\medskip

(ii) Find explicitly a constant $C_2$ that depends only on $n$ such that
$$h(2P)\geq 4h(P)-C_2$$
for all $P\in E_n(\Q)$.
\medskip

(iii) Find $n$ such that $E_n(\Q)$ has positive rank for which you can determine
 completely a set of generators for $E_n(\Q)$.
\end{enumerate}

\end{document}