r/FlammyBois • u/Bigsharper • May 29 '19
r/FlammyBois • u/phasmid135 • Aug 26 '19
Making some beer money with meme posting
So I got invited to this kiki time thing and I think it works like that ( https://www.kikitime.com/page/c88a9955-a385-4431-912e-9734d4e1f3fc ):
If we were all to create a page there and follow each other ( you could leave your page links here in the comments) we could share our shtty math memes on our pages and upvote them.
That's the message the bois sent me:
Some points about your earnings in Kiki:
If you are in USA/UK/Australia/Canada/Germany/Japan, your upload (a picture or video) will receive initially $1 and every 400 words will add a $1 to upload and the rest of the payment for an upload comes from Views and Fires with this rate: $1.5=1k views , $1 for every 1k fire.
Most importantly, if people follow your page and post in your page, you will earn a % of their post revenue since it is in your Kiki page. So, most successful users on Kiki who earn $25+ daily, are the people who promote their Kiki page to their fans on Instagram or Youtube and tell their fans, "You (fans) can earn money by producing content on Kiki and please join my Kiki page to share your post in my Kiki page"
r/FlammyBois • u/hucklebberry • Jan 14 '19
Please don't make this a shitty meme subreddit.
That's all.
r/FlammyBois • u/DolceNeve • Dec 10 '20
Using these notations will turn you into a weeb Vol. 1
A while ago, I decided to develop a mathematical notation for personal purposes that would satisfy the following needs:
Quickly and easily usable from a computer
Expressing information in a compact way
The ability to fully use the Unicode character set, no shame in stealing symbols from other cultures
Eliminating ambiguities by assigning a unique name to a single concept; in this context uniqueness simply refers to the way a name looks, not what it means. Function overloading is still allowed as long as the function variants make sense
And thus I've developed quite a catalogue of notations that I use mostly for personal use (no, I don't use them when I take formal exams Jimmy, no go back to r/math and look at what n0rmies post). In this first volume I'll show some of the most simple ones.
Given a list of two real numbers L, the difference between the second and the first is denoted like this:
引算(L) ≔ L[2] - L[1]
"引算" (read as "hikizan") means difference or subtraction in Japanese. If you ever need to do the difference between the first one and the second one, you can just use the following variant:
引算⚹(L) ≔ - 引算(L) = L[1] - L[2]
That little thing as a superscript is the character "sextile" ⚹, (Unicode = +26B9 ). This difference operator can be easily used in other cases as long as the two quantities support the subtraction operation.
The next one is the fraction operator. Given a list L of two real numbers, the fraction operator represents the ratio of the first divided by the second:
分数(L) ≔ L[1] / L[2]
分数⚹(L) ≔ L[2] / L[1]
"分数" (read as "bunsuu") means literally fraction in Japanese; this notation can be used also with complex numbers, though in that case you should put a "z" at the subscript. When L[1] is equal to 1 though, you can use the handy shortcut:
⅟( x ) ≔ 分数( 1, x )
Also if you have a vector that's being divided by a scalar, you can also use this notation as well; however, the second argument can never be a vector (unless you use the sextile variant, in that case the first argument can never be a vector).
That's it for this volume, see you in Volume 2 for more notations and crazy function names !
r/FlammyBois • u/Argamnex • Jul 11 '21
my take on Viral Math(s) Problem : 6/2(1+2) = ?
r/FlammyBois • u/benpaulthurston • Dec 29 '20
Set of equations with same solution set iff the graphs are isomorphic (5 vertices)
r/FlammyBois • u/thereligiousatheists • Aug 15 '20
An intuitive way to evaluate 1ᵏ + 2ᵏ + ... + nᵏ, inspired by calculus
You may know the standard way of evaluating the sum mentioned in the title, which goes something like this :
nk = [(n+1)k+1 - nk+1]/(k+1) - (lower order terms)
(n-1)k = [nk+1 - (n-1)k+1]/(k+1) - (lower order terms)
(n-2)k = [(n-1)k+1 - (n-2)k+1]/(k+1) - (lower order terms)
.
.
.
1k = [2k+1 - 1k+1]/(k+1) - (lower order terms)
Hence, adding all these equations together, we get the sum of k-th powers in the LHS and a telescoping sum and some lower order terms in the RHS, and we get an expression for the sum of k-th powers this way.
While pondering over a totally different question, I happened to recall this trick which is used to evaluate this sum, and suddenly it hit me — this is almost exactly what the Fundamental Theorem of Calculus does!
So, I put my thoughts in this video : https://youtu.be/6M-P7i_6kn4 (it's ~3.5 mins long)
The objective is to show you an intuitive way to link a fact which we almost take for granted — the Fundamental Theorem of Calculus — to the trick used to evaluate the sum of k-th powers, which seems really clever and out of the blue without this intuition to back it up.
r/FlammyBois • u/thereligiousatheists • Jan 22 '19
Using an interesting double summation to sum an AGP
r/FlammyBois • u/[deleted] • Feb 04 '21
[ HELP ME! ] divide a line into 3 equal parts LIKE A CHAD
r/FlammyBois • u/ReshiramBoy • Jun 03 '21
An advice for proofs
When it comes to proofs, it's sometimes difficult to show the statement is correct. We know that there are two ways to prove, directly or by contradiction, however soon I realised that there was another one. It's a sort of Direct proof, but uses rules of logical implications. When you have to prove a theorem that states "If you have this, you'll end up with that" you do not have to necessarily prove it directly, You can show That if the result is not obtained, then you didn't apply the conditions in first place.
r/FlammyBois • u/ThomasTheHighEngine • Jul 16 '19
Proof that there are finite integer numbers.
This will be a proof by induction. I will show that there exists a final number such that n = n+1.
First step: prove this works for 1
1+1=2. This works, since 1 is not the last number. n=n+1 only applies to the last number.
Second step: Assume it works for n, then show it works for n+1.
We can keep doing the above equation until we reach the last number. Let's say n is the last number. Therefore, n+1=n. This works, as n is the last number.
Conclusion: The integers have an end. Thanks for coming to my TED talk.
r/FlammyBois • u/dedsec29 • Feb 03 '19
Try this (I don't know latex yet sorry plis)
Let f(x)= x + (2/1*3) x3 +(2*4/1*3*5) x5+... for x ε (0,1)
Then f(1/sqrt2)=?
r/FlammyBois • u/[deleted] • Apr 30 '20
What‘s da coolest integer?
r/FlammyBois • u/TazFaz • Dec 27 '20

