Math Is Fun Forum
You are not logged in.
- Topics: Active | Unanswered
Pages: 1
#1 Jokes » A pun about finals » 2023-12-15 07:45:31
- iiooasd1217
- Replies: 0
What did the Greek mathematician say after his students passed the test?
"You all passed the Phi-nal"
#2 Re: Introductions » Cause the math is in my head and I've followed where its lead. » 2023-11-25 14:41:50
iiooasd1217 wrote:I own a small business where I build anything I get paid to.
whats a cool/interesting/weird thing that you've built recently?
I have recently built a flair drum, a computer, several other instruments and more along those lines.
#3 Introductions » Cause the math is in my head and I've followed where its lead. » 2023-11-17 07:27:14
- iiooasd1217
- Replies: 3
I am a mathematician, engineer, and musician. I like big numbers and I like small numbers. I like good music and I hate bad music. I own a small business where I build anything I get paid to. My favorite paradox is currently Gabriels Horn (even though that is still solvable, but that's a story for another day). I am fairly good at coding, but hope to get better.
My favorite composer is Andrew Lloyd Webber because of his musical Love Never Dies. Thanks!
#4 Re: Puzzles and Games » Fibonacci Number and Perfect Squares » 2023-11-16 15:41:50
I just wanted to say thank you for looking into this. I am an avid coder but sometimes I need help! This is so much fun to see other people looking into problems that I have been thinking about for some time now.
#5 Dark Discussions at Cafe Infinity » Quantum Computers Breaking Computability » 2023-11-16 07:29:09
- iiooasd1217
- Replies: 0
I figured this out around a year ago and was too lazy to make a paper. I thought I would post it here instead. Have fun with existential dread! 
Alan Turing was one of the best minds in history. In his days he wrote a paper regarding the incompleteness theory. This theory said that maths was incomplete. Turing proved this with a thought experiment. Imagine an algorithm T(x) that would tell you if an algorithm, x, was complete (0 if incomplete 1 if complete). Now imagine an algorithm U(x) that always does the opposite result of T. When you put T(U) you will get a paradox where T outputs both a 1 and a 0. That's impossible... Right?
NO!!!
Try this same problem with a quantum algorithm. What do you get? A working system! The system would have a qbit with a superposition between 1 and 0! Do quantum particles break maths?
Thank you for reading this sorta-rant. Enjoy your existential dread. Good luck! 
#6 Puzzles and Games » Fibonacci Number and Perfect Squares » 2023-10-31 09:19:38
- iiooasd1217
- Replies: 3
This is a puzzle I have been thinking about more than I would like, so I thought I could share it. How many perfect squares are in the Fibonacci sequence? This problem can be extended to other P-Fibonacci sequences and the tribonacci. Here's a hint. 1 and 144 are two examples of perfect squares in the Fibonacci sequence.
Pages: 1