Explore >> Select a destination
|
You are here 
|
walkingrandomly.com | ||
| | | | |
www.futilitycloset.com
|
|
| | | | | A pangram is a sentence that uses each letter of the alphabet exactly once: CWM FJORD BANK GLYPHS VEXT QUIZ. "Carved symbols in a mountain hollow and on the bank of a fjord irritated an eccentric person." They're a bit awkward in English, so here's the same idea using numbers. Each of these (valid) equations uses the digits 1-9 exactly once: 42 × 138 = 5796 27 × 198 = 5346 39 × 186 = 7254 48 × 159 = 7632 28 × 157 = 4396 4 × 1738 = 6952 4 × 1963 = 7852 Even better: The numbers... | |
| | | | |
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). | |
| | | | |
colleenyoung.org
|
|
| | | | | 1 post published by Colleen Young on July 29, 2020 | |
| | | | |
thimbron.com
|
|
| | | [AI summary] The blog post humorously compares the state of the Greek language to a collection of preserved moths and butterflies, suggesting that its current form is a static, lifeless version of its former vitality. | ||
