Difference between revisions of "User:Johnxyz1"
(→Major Contributions) |
|||
(9 intermediate revisions by the same user not shown) | |||
Line 1: | Line 1: | ||
+ | <math>\huge\mathcal{JOHN}</math> | ||
+ | |||
+ | ==Major Contributions== | ||
+ | *''[[Tree (graph theory)]]'' | ||
+ | *''[[Reverse Polish notation]]'' | ||
+ | *''[[LaTeX:Packages]]'' | ||
+ | *''[[Basic Programming With Python]]'' | ||
+ | |||
==Favorites== | ==Favorites== | ||
Line 8: | Line 16: | ||
Favorite Typesetting Software: <cmath>\text{\LaTeX}</cmath> | Favorite Typesetting Software: <cmath>\text{\LaTeX}</cmath> | ||
+ | |||
+ | <math>\textit{Remark.}</math> | ||
+ | <cmath>\text\LaTeX>\text{Word}>\text{Canva}</cmath> | ||
+ | <cmath>\text{\LaTeX}+\textsf{beamer}>\text{Powerpoint}>\text{Canva}</cmath> | ||
+ | |||
Favorite Operating System: Linux (although I am rarely on one) | Favorite Operating System: Linux (although I am rarely on one) | ||
Line 34: | Line 47: | ||
− | == | + | |
+ | ==Personal== | ||
Complementary casework example: https://artofproblemsolving.com/wiki/index.php/2024_AMC_8_Problems/Problem_25 | Complementary casework example: https://artofproblemsolving.com/wiki/index.php/2024_AMC_8_Problems/Problem_25 | ||
Line 43: | Line 57: | ||
Example: 2024 AMC 8 Problems/Problem 13. In this problem you can treat going up as \(U\) and going down as \(D\). Since you have to end up on the ground in \(6\) steps you have \(3\) U's and \(3\) D's; same as above. There are some special cases --- begin with U end with D and invalid stuff. | Example: 2024 AMC 8 Problems/Problem 13. In this problem you can treat going up as \(U\) and going down as \(D\). Since you have to end up on the ground in \(6\) steps you have \(3\) U's and \(3\) D's; same as above. There are some special cases --- begin with U end with D and invalid stuff. | ||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− |
Latest revision as of 14:32, 21 September 2024
Contents
Major Contributions
Favorites
Favorite topic: for which I am reading AOPS intermediate book on
Favorite color:
Favorite software:
Favorite Typesetting Software:
Favorite Operating System: Linux (although I am rarely on one)
typesetting
Below are some stuff I am doing to practice . That does not mean I know all of it (actually the only ones I do not know yet is the cubic one and the one)
Source code for equations:
https://1drv.ms/t/c/c49430eefdbfaa19/EQw12iwklslElg9_nCMh0f0BVthxSSl-BOJAwsXtGbbhPg?e=1LfZJm
Personal
Complementary casework example: https://artofproblemsolving.com/wiki/index.php/2024_AMC_8_Problems/Problem_25
Representing Actions as Permutations
The idea is that if you must do a fixed number of operations of multiple types, you can make those operations letters, and permutate them. For example, if you have a grid of \(4\times 6\) and you want to walk from one corner to the opposite one, WLOG you need to go up \(4\) times and right \(6\) times. You can do that in any order, so basically you are arranging
UUUURRRRRR
which simplifies the problem.
Example: 2024 AMC 8 Problems/Problem 13. In this problem you can treat going up as \(U\) and going down as \(D\). Since you have to end up on the ground in \(6\) steps you have \(3\) U's and \(3\) D's; same as above. There are some special cases --- begin with U end with D and invalid stuff.