query: Putnam 2005 A1 Solution
positive_passages.docid: 21612
positive_passages.text: How to prove this form of $n$?
negative_passages.docid: 27668
negative_passages.text: Finding nonnegative solutions to an underdetermined linear system
negative_passages.docid: 38811
negative_passages.text: Solutions to $\frac1{\lfloor x\rfloor}+\frac1{\lfloor 2x\rfloor}=\{x\}+\frac13$
negative_passages.docid: 23112
negative_passages.text: Solving an equation with rational expressions (step by step)
negative_passages.docid: 81012
negative_passages.text: Solution of a Sylvester equation?
negative_passages.docid: 62868
negative_passages.text: Birthday Problem: Difference between Canonical Solution and Approximation
negative_passages.docid: 24973
negative_passages.text: Possible A* Optimizations
negative_passages.docid: 36478
negative_passages.text: How can I solve this problem without having to do it by hand?
negative_passages.docid: 38612
negative_passages.text: Pathfinding - A* with least turns
negative_passages.docid: 68032
negative_passages.text: A Representation Theory Problem in Putnam Competition
negative_passages.docid: 39699
negative_passages.text: Solving a system of non-linear equations and obtaining a phase portrait
negative_passages.docid: 115827
negative_passages.text: Advanced airplane problem
negative_passages.docid: 82866
negative_passages.text: Calculating roots with bc_math or GMP
negative_passages.docid: 93123
negative_passages.text: Systems of linear equations to calculate $\alpha$ and $\beta$
negative_passages.docid: 21709
negative_passages.text: Nsolve gives solutions with a small complex part which can't be eliminated by chop command
negative_passages.docid: 978
negative_passages.text: Solving $ax \equiv c \pmod b$ efficiently when $a,b$ are not coprime
negative_passages.docid: 75864
negative_passages.text: How to correct my code for solving the Josephus problem?