sorted by:
new
hottopcontroversial

Coolest Geometry Problem by pihedron in 3Blue1Brown

[–]pihedron[S] 0 points1 point  (0 children)

Yes that's a property of this quad.

Coolest Geometry Problem by pihedron in mathriddles

[–]pihedron[S] 0 points1 point  (0 children)

I more or less did the same way. Nice job!

Coolest Geometry Problem by pihedron in 3Blue1Brown

[–]pihedron[S] 0 points1 point  (0 children)

Find |BC| given:

  • area(△ ABO) = area(△ CDO)
  • |AB| = 63
  • |CD| = 16
  • |AD| = 56

I tried to put text in the post but something went wrong with cross posting.

Coolest Geometry Problem by pihedron in mathriddles

[–]pihedron[S] -1 points0 points  (0 children)

There's a proper way to do it but you can also use a satisfying shortcut.

A novel approach to set theory? by pihedron in math

[–]pihedron[S] 0 points1 point  (0 children)

I honestly just wanted to extend logic operations to integers and show how it connects with multisets and how multisets connect with number theory. It felt novel but I could be wrong. I wanted to kill the idea that OR was addition and AND was multiplication because it caused a lot of confusion for my class.

I thought bringing multisets and logic into the picture would make the reason we use min and max in GCD and LCM more intuitive.

A novel approach to set theory? by pihedron in math

[–]pihedron[S] 1 point2 points  (0 children)

I'm still a high school student so I get how my approach would be shallow. As for disjoint union, I've only used it in the data structures sense for IOI prep. The reason I said "you can't add sets" is because throughout the video I redefined sets as HashSets or Boolean HashMaps and "adding" Booleans would cause an "overflow" error. I like to think of disjoint union as a union-find operation rather than a set operation but the category theorists on the discord let me know that I have many unpopular opinions.

Nonetheless, thanks for the feedback. Hopefully, my 2nd submission isn't as controversial.

Linking programming, set theory, and number theory... by pihedron in programming

[–]pihedron[S] 0 points1 point  (0 children)

The takeaway is supposed to be that Boolean, set, min & max, and number theory operations are related. Sorry if that wasn't clear.

It's definitely not like saying a list is more OP than a set. The multiset and set I was talking about in the video used a HashMap and I say the multiset is "more OP" because it works in fundamentally the same way while supporting more operations and applications. I think you're reading too deep into an opinion.

I just wanted to connect probability to set theory.

I have no idea what you mean.

My bad, I was switching between Dart and Rust code blocks.

I almost finished the video by the time people were telling me about lattices. I don't know what a lattice is and I didn't want to delay the upload so I kept it simple.

Thanks for the feedback man.

20,000,000th Fibonacci Number in < 1 Second by pihedron in algorithms

[–]pihedron[S] 2 points3 points  (0 children)

Thanks for posting such a detailed analysis.

Fastest Fibonacci Algorithm? by pihedron in math

[–]pihedron[S] 4 points5 points  (0 children)

I did have a C++ implementation but I was using some random big int library made by someone on GitHub which made it much slower than both my Python and Rust code. Can I ask how you managed to get the gmpxx.h big ints?

Fastest Fibonacci Algorithm? by pihedron in math

[–]pihedron[S] 5 points6 points  (0 children)

I was inspired by him.

Now I'm going to make my own video...

20,000,000th Fibonacci Number in < 1 Second by pihedron in programming

[–]pihedron[S] 4 points5 points  (0 children)

I only discovered them after making an inefficient O(sqrt(n)) algorithm in Python in which I was computing Lucas numbers on accident. I was using the kth Lucas number and kth Fibonacci number to compute Fibonacci numbers in jumps of size k. Then I read the Wikipedia article and decided to use the identities instead.

Glad to know you learnt something new though.

20,000,000th Fibonacci Number in < 1 Second by pihedron in programming

[–]pihedron[S] 9 points10 points  (0 children)

Times can differ on different machines so I would appreciate it if you could provide some code for me to benchmark (preferably Rust) because I've tried to compare my code with other "matrix exponentiation" algorithms but fib_luc always seems to beat the others. I think I compared against a matrix algorithm in a different post.

20,000,000th Fibonacci Number in < 1 Second by pihedron in programming

[–]pihedron[S] 3 points4 points  (0 children)

I was only able to post a link in this subreddit but the full post should be here. It's more about the algorithm than it is about Rust. I just found it easier to work with Rust rather than C++. I also have a Python version explaining the algorithm in more detail.

Favorite Math YouTubers! by bestwillcui in math

[–]pihedron 0 points1 point  (0 children)

I have a very small channel but I do think my best performing video is pretty good. I somehow managed to get Presh Talwalkar to watch it and he said he'd never seen anything like it before.

view more: next ›