Reputation
Next privilege 125 Rep.
Vote down
Badges
1 10
Impact
~8k people reached

  • 0 posts edited
  • 0 helpful flags
  • 4 votes cast
Feb
18
accepted Determine the number of paths of length 2 in a complete graph of n nodes
Feb
14
awarded  Notable Question
Feb
2
awarded  Commentator
Feb
2
comment Determine the number of paths of length 2 in a complete graph of n nodes
so what is big O notation for that? or a equation for that answer?
Feb
2
asked Determine the number of paths of length 2 in a complete graph of n nodes
Oct
24
awarded  Popular Question
Jul
2
awarded  Curious
Apr
7
accepted efficient algorithm to place people in a specific order
Apr
3
asked efficient algorithm to place people in a specific order
Feb
25
awarded  Tumbleweed
Feb
18
awarded  Custodian
Feb
18
reviewed Approve finding a unique integer using mod
Feb
18
asked finding a unique integer using mod
Feb
6
awarded  Popular Question
Jul
21
comment RREF guide without gaussian elimination/faster method
and if u look at this carefully it looks the column correspondence property
Jul
21
comment RREF guide without gaussian elimination/faster method
that is true, but for that you use a calculator or a computer to calculate that big of a problem. This is for small matrices.
Jul
21
comment RREF guide without gaussian elimination/faster method
I looked in a book and found a matrix but i didnt know the answer
Jul
21
accepted finding the basis of an eigenspace
Jul
21
asked RREF guide without gaussian elimination/faster method
Jul
21
answered RREF guide without gaussian elimination/faster method