libcmb-3.5.6 and cmd-3.9.5-rc-2 released:
#libcmb https://t.co/gFAZthtFng
#cmb https://t.co/RwTC9s37Yk
Fixed clang warnings under #CentOS#Linux
Tested on #FreeBSD 9.3-12.0, CentOS 6.10-7.6, Mac OS X 10.6-10.14
@Math_files In my mind, the answer is yes, because when you asked “what comes after 3” my first thought was not “4” but instead “ok, give me the previous numbers in the sequence so that I may derive the formula to predict the next number in the sequence” and failing that, I would presume “3”
Bob, the guy that made it, says it was pretty challenging and he in no-way told the router to contour it in any specific way but just let the math generate the G code. It came out matching the Wolfram contour renderings exactly. A credit to Bob’s ingenuity!
The libcmb algorithm was carved in wood by a local CNC developer, and it is soon coming off display after 36 months, coming back home to me where I will soon be able to share it here and I am very excited about this
@yisongyue@gautamcgoel Happened to a friend at UCB a little over a week ago. My advice was that there is nothing worse than moving goal posts and that the silver lining is that the stated requirements are a sign they have firmly planted the goal posts, so go get ‘em
The libcmb algorithm was carved in wood by a local CNC developer, and it is soon coming off display after 36 months, coming back home to me where I will soon be able to share it here and I am very excited about this
Did you know that combinatorics appears in mechanical engineering? If you have ever designed a machine linkage system, you have unknowingly used combinatorics https://t.co/DSdGym6KdQ
RSA algorithm in a poem, by Daniel G. Treat.
Take two large prime numbers, q and p.
Find the product n, and the totient ϕ .
If e and ϕ have GCD one
and d is e's inverse, then you're done!
For sending m raised to the e
reduced mod n gives secre-c.
Only if you add another fruit, say 🍉, to ask the question 🍎/( 🍌 + 🍍 + 🍉) + 🍌/( 🍎 + 🍍 + 🍉) + 🍍/( 🍎 + 🍌 + 🍉) + 🍉/( 🍎 + 🍌 + 🍍) = 4 do some solutions exist due to the combinatorics nature of the arithmetic at-play
You might not realize it at first, but the “Apple, Banana, Pineapple math problem” is actually a combinatorics study in disguise. Using libcmb, one can prove the relationship between the coefficients and declare that for even counts of set items, there are zero realm solutions!
cmb -k3 $( seq 1 1024) | awk '{printf "%s = %.20f\n", $0, $1/($2+$3) + $2/($1+$3) + $3/($1+$2)}' | awk '$NF>3.99999&&$NF<4.00001' # No exact match to 4.0 exists no matter how big you make the upper bound or if you enable repetition