Non-Cubers say the darndest things!

U good at maths? Hav u taken any a levels? I assume u r doing gcse cos ur same age as me. U entered for the maths challenge, the ukmt one? I got into the summer school which is like last 40. 57/60 in the second round. I'm excited cos me mathematician too, me Chinese, me very good!

Well it's good you're proud. Yes ive done the challenge and olympiad, done (i)gcse early, learning weird stuff. Also am teaching our class add maths a bit. Nice results, though i'm not entirelt sure what you're on about.
I'm not actually obsessed with just maths (only specific topics) so I'm just learning cool stuff like fourier descriptors and multiplication algorithms. If you understand the shonhage-strassen algorithm for some reason though, please message me, I'm trying to write a program with it but number theoretic transforms and using 85 as a root of 1 makes no sense to me.
 
Last edited:
Well it's good you're proud. Yes ive done the challenge and olympiad, done (i)gcse early, learning weird stuff. Also am teaching our class add maths a bit. Nice results, though i'm not entirelt sure what you're on about.
I'm not actually obsessed with just maths (only specific topics) so I'm just learning cool stuff like fourier descriptors and multiplication algorithms. If you understand the shonhage-strassen algorithm for some reason though, please message me, I'm trying to write a program with it but number theoretic transforms and using 85 as a root of 1 makes no sense to me.

I was on about the imok, intermediate mathematical Olympiad and kangaroo.

Admittedly I have never heard of shonhage strassen algorithm, but I googled it quickly, i kind of understand it, but knowing next to nothing about Fourier transformation don't help I Guess. It seem like that there is a lot of carrying on going on where you have to do, not huge amount, but quite a bit of calculation. I imagine a computer will be able to do it really fast, but it don't look much shorter than the original, long multiplication.
Anyway I have an idea of how it works but is there a proof?

This might be a noob thing to say but where do you need to use 85 as a root of 1? It's just taking the cyclic convolution of the two large integers, carry them on, and work the final sum out using mod? This might be completely bs and I might have understood wrong, however.

U mentioned u took maths challenges, how did u do?
 
I was on about the imok, intermediate mathematical Olympiad and kangaroo.

Admittedly I have never heard of shonhage strassen algorithm, but I googled it quickly, i kind of understand it, but knowing next to nothing about Fourier transformation don't help I Guess. It seem like that there is a lot of carrying on going on where you have to do, not huge amount, but quite a bit of calculation. I imagine a computer will be able to do it really fast, but it don't look much shorter than the original, long multiplication.
Anyway I have an idea of how it works but is there a proof?

This might be a noob thing to say but where do you need to use 85 as a root of 1? It's just taking the cyclic convolution of the two large integers, carry them on, and work the final sum out using mod? This might be completely bs and I might have understood wrong, however.

U mentioned u took maths challenges, how did u do?

Meh i got a distinction in the olympiad.
So shonhage-strassen is a *lot* faster than the naïve algorithm. Why do we need 85 and 337? So a fourier transform is a transform which makes use of the roots of unity (we're, as you say, talking about cycles, see). But instead of using e^(2ipi k/ N) we are using something to do with 85, and instead of using the real numbers we're using some sorta ring to do with the number 337. This is what the FFT is. Convolution the way we do it as mortals is too slow, and O(n^2) is useless for huge calculations.
And surely using mod is more complex than multiplication itself? As for pointwise multiplication I can't see how that can be less complex. As for proof, read their paper on it,
/offtopic

PM me if you've any ideas. Gimme an example of your cyclic convolution... Spose if we used roots of unity rather than a physical ring it makes more sense. Also stop using "u".
 
Last edited:
U good at maths? Hav u taken any a levels? I assume u r doing gcse cos ur same age as me. U entered for the maths challenge, the ukmt one? I got into the summer school which is like last 40. 57/60 in the second round. I'm excited cos me mathematician too, me Chinese, me very good!
I got into the summer school too (I'm going in two days)! Except I only got 2/60 in the second round...
 
Today my friend said he was watching Rubik's cube videos on YouTube. He was on "Monkeyman's" page. (He was referring to monkeydude1313)
He asked me if he was one of the top people in the world. I said he was fast but there are people that can sub10 the cube.
He told me the fastest solve he ever saw was a 9 second solve behind the back.

That actually can be possible...
 
I don't know about others, but for me, I don't think anyone who says these things is stupid, nor do I try to make them feel so, but it's funny to us since we know better. Don't make radical generalizations, because I'm pretty sure most of us have similar views, especially if you're going to make a new user just for the purpose of this one post.

Good one!
 
Story of my life. I take all AP classes, and don't have a 4.0. Honestly, these days, I think that extracurriculars are more important than classes (In terms of getting into college).

It really depends on what college/university you're planning to enter. Some care a lot about your marks and others care more about the other things especially if they stand out.
 
I was standing in line with my youngest son for the Polar Express in the original Legoland. I solved my cube many times and got all of the above statements in many different languages (and many times as there was always new people around me as the line moved)
 
Back
Top