Recurrence relation in matrix multiplication

Click For Summary
The discussion revolves around a recurrence relation for matrix multiplication, specifically T(n) defined for n <= 2 and n > 2. The relation is T(n) = b for n <= 2 and T(n) = 8T(n/2) + e(n^2) for n > 2. Participants seek clarification on the connection between the recurrence and matrix operations, as well as the meaning behind the attempted solution of O(n^(log2(7))). The conversation highlights the need for a complete problem statement to better understand the context. Overall, the thread emphasizes the importance of clear problem definitions in mathematical discussions.
priyarrb
Messages
1
Reaction score
0

Homework Statement



T(n)=b n<=2
8T(n/2)+e(n^(2)) n>2


Homework Equations





The Attempt at a Solution


O((n^log)2^(7))
 
Physics news on Phys.org
priyarrb said:

Homework Statement



T(n)=b n<=2
8T(n/2)+e(n^(2)) n>2


Homework Equations





The Attempt at a Solution


O((n^log)2^(7))
What does this have to do with matrices? Please give us the complete problem statement.

What are you trying to say in your attempt at a solution?
 
Question: A clock's minute hand has length 4 and its hour hand has length 3. What is the distance between the tips at the moment when it is increasing most rapidly?(Putnam Exam Question) Answer: Making assumption that both the hands moves at constant angular velocities, the answer is ## \sqrt{7} .## But don't you think this assumption is somewhat doubtful and wrong?

Similar threads

  • · Replies 11 ·
Replies
11
Views
2K
Replies
3
Views
1K
  • · Replies 3 ·
Replies
3
Views
2K
Replies
6
Views
1K
Replies
6
Views
2K
Replies
9
Views
2K
  • · Replies 8 ·
Replies
8
Views
2K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 4 ·
Replies
4
Views
1K
Replies
8
Views
3K