# | User | Rating |
---|---|---|
1 | tourist | 3803 |
2 | jiangly | 3707 |
3 | Benq | 3627 |
4 | ecnerwala | 3584 |
5 | orzdevinwang | 3573 |
6 | Geothermal | 3569 |
6 | cnnfls_csy | 3569 |
8 | Radewoosh | 3542 |
9 | jqdai0815 | 3532 |
10 | gyh20 | 3447 |
# | User | Contrib. |
---|---|---|
1 | awoo | 163 |
2 | maomao90 | 160 |
2 | adamant | 160 |
4 | maroonrk | 152 |
5 | -is-this-fft- | 151 |
6 | atcoder_official | 148 |
6 | nor | 148 |
6 | SecondThread | 148 |
9 | TheScrasse | 146 |
10 | Petr | 144 |
Name |
---|
Note that multiplying c<d by −1 gives −c<−d. So we have a−c<b−d by our previous result. Shouldn't it be c>d in the first place?
Fixed, thanks!
cool blog now i know math $
deleted
This is great, I think it will help many newbies like me to understand fundamentals and common senses.
I stumbled on a question and it would be great if I could get some help with it. I need to find the sum of (floor(1*sqrt(2)) + floor(2*sqrt(2)) + ... + floor(n*sqrt(2))). To me, this looks really similar to Gauss' property with m = n * sqrt(2), I could be wrong though. It gives me almost right answer with just minor offsets for some values of n. Since, m needs to be an integer, is there any way that we can modify this formula? or is there any other approach you would recommend?
Edit1: https://math.stackexchange.com/questions/1622147/simplifying-sum-of-floor-functions
Edit2: https://mathproblems123.wordpress.com/2020/07/25/sum-of-floors-of-multiples-of-the-golden-ratio/