Latest update

- Implementing the Sharpe's return-based style analysis on Python
- Regex-based parsing of a specifier for dice
- Handling COM exceptions / busy codes
- Improving read/write loops in Python
- Switching between ViewModels using IoC in a MVVM WPF application
- Is it okay to call private method in constructor and call class public method with object initializer?
- PPT generator using SOLID principles
- Building a graph using dictionary
- Embedding python into C++ program
- Web Scrape: Scraping StackOverflow's questions with nodejs
- How many times did the library fail Hermione?
- Kill the dark one and the giant, but leave the third - which did he mean?
- How did Dass Jennir and Kai Hudorra know that Beyhgor Sahdett was a traitor?
- Star Trek - Weapon of Peace
- Why did Dobby help Harry Potter?
- Why spare the White Walkers after the Battle for the Dawn?
- MS SQL Server: Transactional replication not working but no errors are present
- How to connect to a SQL Server from another computer using SSMS with only hostname?
- SQL Trigger Find Deleting Job Agent History
- Create a unique constraint on a column based on distinct value from another column in the same table

# Hasse bound for elliptic curves (glitches?)

2018-03-12 20:21:33

Hasse theorem says (in the simplest case), for any elliptic curve $E$ (with integer coefficients), the number of solutions mod $p$ is within $2\sqrt p$ of the number of points of a projective line $\mathbb P^1(\mathbb F_p)$ (i.e. $p+1$)

$$ |p+1-N_p| \leq 2\sqrt p $$

for all $p$ (not just asymptotically). I was playing around with it (by the simplest brute-force calculation) but I encountered a few cases, such as $y^2=x^3-1$, where it just goes over the Hasse bounds by a little bit, for a few primes.

https://beta.observablehq.com/@liuyao12/elliptic-curves-counting-solutions#Hasse

It must be a silly mistake somewhere. Then it is a shameless promotion on my part.