/explore
|
You are here 
|
mathspp.com | ||
| | | | |
mikespivey.wordpress.com
It's fairly well-known, to those who know it, that $latex \displaystyle \left(\sum_{k=1}^n k \right)^2 = \frac{n^2(n+1)^2}{4} = \sum_{k=1}^n k^3 $. In other words, the square of the sum of the first n positive integers equals the sum of the cubes of the first n positive integers. It's probably less well-known that a similar relationship holds... |
|
| | | | | ||
| | | | |
www.alfredo.motta.name
[AI summary] Alfredo Motta shares details about upcoming coding workshops in London covering Ruby, Rails, and Javascript to help attendees learn programming and enter the tech industry. |
|
| | | | | ||
| | | | |
www.jeremykun.com
Problem: Compute the product of two polynomials efficiently. Solution: import numpy from numpy.fft import fft, ifft def poly_mul(p1, p2): """Multiply two polynomials. p1 and p2 are arrays of coefficients in degree-increasing order. """ deg1 = p1.shape[0] - 1 deg2 = p1.shape[0] - 1 # Would be 2*(deg1 + deg2) + 1, but the next-power-of-2 handles the +1 total_num_pts = 2 * (deg1 + deg2) next_power_of_2 = 1 << (total_num_pts - 1). |
|
| | | | | ||
| | | | |
allouttabubblegum.wordpress.com
Keep an eye here, going to reactivate this blog. |
|
| | | |||
