Advanced Math

For the highest-level (post-calculus) math questions that don't fall into any other category.
F
combinatorial algorithms: Let M(n,m) denote the complexity of the best algorithm for merging of a1<..<an, b1<..<bm series. Prove that M(3,6) <= 7.
Replies
2
Views
668
MaxWong
M
N
An Insignificant question: Find non-zero operator K so det[K(A+B)] = det[K(A)] + det[K(B)], A,B are 3-by-3 matrices
Replies
3
Views
512
Otis
Otis
M
Set theory
Replies
1
Views
434
Steven G
Steven G
N
Discrete math assignment
Replies
1
Views
349
MaxWong
M
L
matrix transformation to generate a sequence.
Replies
1
Views
340
MaxWong
M
C
Looking forward to a proof of convergence in an iterative process.
Replies
0
Views
359
chen2003qq
C
W
(1/9)^(2/3)
Replies
10
Views
1K
fresh_42
F
J
Subset of space
Replies
17
Views
1K
bradleyfaires
B
A
Logic riddle
Replies
0
Views
337
Anakonda
A
P
Please help to find the answer
Replies
4
Views
852
mario99
M
P
Please advise the to the answer
Replies
10
Views
2K
PA3040D
P
L
Math question related to science content
Replies
0
Views
175
letsmakeitagoodworld
L
M
How long for 3 people to paint together at different speeds
Replies
9
Views
5K
isabeldobson
I
V
Linear Mixed Model application
Replies
0
Views
176
Varnu
V
M
Is there a systematic classification of the most common computer science algorithms?
Replies
4
Views
683
Metronome
M
S
problem solving
2
Replies
20
Views
2K
fresh_42
F
K
Ppm calculation
Replies
0
Views
150
Knad
K
J
axiom of choice
Replies
0
Views
502
josediez
J
J
axiom of choice
Replies
0
Views
227
josediez
J
E
Euler's totient function: how to prove |Um*n| = |Um| cross |Un| implies gcd(m,n) =1 where |Um*n| means all numbers <m*n relatively prime to it
Replies
4
Views
674
blamocur
blamocur
You must log in or register to post here.
Top