query: Converting a number theory question into involving vectors
positive_passages.docid: 146308
positive_passages.text: Solving 2-degree equations in 3 variables.
negative_passages.docid: 76510
negative_passages.text: vector identity for triple scalar product
negative_passages.docid: 45460
negative_passages.text: Proof verification of a number theory problem involving sequences.
negative_passages.docid: 66499
negative_passages.text: Finding a 2x2 Matrix raised to the power of 1000
negative_passages.docid: 148871
negative_passages.text: Sign of the vector (especially $g$) while calculating
negative_passages.docid: 116823
negative_passages.text: VERIFYING: Proving an $n \times n$ Matrix Vector Space
negative_passages.docid: 148906
negative_passages.text: Finding integers $m,n$ such that $(m-n)^2=4mn/(m+n-1)$
negative_passages.docid: 155636
negative_passages.text: Cross product of two vectors, given magnitudes and angle
negative_passages.docid: 12749
negative_passages.text: How to generate all possible combinations of vectors without caring for order?
negative_passages.docid: 83449
negative_passages.text: Proof with 3D vectors
negative_passages.docid: 129693
negative_passages.text: An interesting problem with "decomposing" natural numbers.
negative_passages.docid: 90691
negative_passages.text: Linear independence of vectors over larger fields
negative_passages.docid: 157717
negative_passages.text: What is a mathematical solution to this problem? (Project Euler #106)
negative_passages.docid: 50249
negative_passages.text: Pairs of numbers with a given LCM
negative_passages.docid: 132346
negative_passages.text: a linear algebra multiple choice problem
negative_passages.docid: 152852
negative_passages.text: How do I represent and work with n-bit vectors in Python?
negative_passages.docid: 150281
negative_passages.text: Am I on the right track to figure out this combinatorics problem?