Explore >> Select a destination
|
You are here 
|
karmanyaah.malhotra.cc | ||
| | | | |
andrea.corbellini.name
|
|
| | | | | [AI summary] The post provides an in-depth explanation of elliptic curve cryptography, covering key concepts like scalar multiplication, the discrete logarithm problem, and the double-and-add algorithm. It emphasizes the importance of the discrete logarithm being a hard problem, which is crucial for the security of elliptic curve cryptography. The post also touches on the Weierstrass normal form, which simplifies the equations for scalar multiplication and point addition. The author concludes by mentioning the next post will focus on finite fields and the discrete logarithm problem, with examples and tools for exploration. | |
| | | | |
njwildberger.com
|
|
| | | | | Our paper "A Hyper-Catalan Series Solution to Polynomial Equations, and the Geode" is now available at Taylor and Francis Online. It will appear next month in print form in the American Mathematical Monthly. Here is the link to the paper: https://www.tandfonline.com/doi/full/10.1080/00029890.2025.2460966 From the Abstract: The Catalan numbers?? ??count the number of subdivisions of a polygon... | |
| | | | |
mathematicaloddsandends.wordpress.com
|
|
| | | | | The function $latex f(x) = x \log x$ occurs in various places across math/statistics/machine learning (e.g. in the definition of entropy), and I thought I'd put a list of properties of the function here that I've found useful. Here is a plot of the function: $latex f$ is defined on $latex (0, \infty)$. The only... | |
| | | | |
mathematicaloddsandends.wordpress.com
|
|
| | | I recently came across this theorem on John Cook's blog that I wanted to keep for myself for future reference: Theorem. Let $latex f$ be a function so that $latex f^{(n+1)}$ is continuous on $latex [a,b]$ and satisfies $latex |f^{(n+1)}(x)| \leq M$. Let $latex p$ be a polynomial of degree $latex \leq n$ that interpolates... | ||
