Home
Forums
New posts
Search forums
What's new
New posts
Latest activity
Log in
Register
What's new
Search
Search
Search titles only
By:
New posts
Latest activity
Menu
Log in
Register
Install the app
Install
Forums
What's new
JavaScript is disabled. For a better experience, please enable JavaScript in your browser before proceeding.
You are using an out of date browser. It may not display this or other websites correctly.
You should upgrade or use an
alternative browser
.
Latest activity
What's new
New posts
Latest activity
Steven G
replied to the thread
Solve dy/dx= 6e^y sin3x when y=0 and x=0
.
Yes, I can solve it. This being a math help forum no one here will solve this problem for you. If you had read the posting guidelines...
A moment ago
blamocur
replied to the thread
Is there a systematic classification of the most common computer science algorithms?
.
You might want to look at complexity classes of algorithms, including time complexity.
A moment ago
E
eipi45
replied to the thread
dividing a load of work correctly
.
This is a ratio question. The ratio of work is A:B = 75:50 So to answer the question , divide the 15 students in the ratio 75:50
16 minutes ago
L
Lalala
posted the thread
Solve dy/dx= 6e^y sin3x when y=0 and x=0
in
Differential Equations
.
Can anyone solve dy/dx= 6e^y sin3x when y=0 and x=0. I cannot get the answer which is y=-ln|-2cosx+3|
35 minutes ago
K
khansaheb
replied to the thread
Is there a systematic classification of the most common computer science algorithms?
.
If you can make list/s of algorithms that you have in mind (e.g. sorting algorithms, factorization algorithm, knapsacks, fluid flow...
Today at 7:21 PM
K
khansaheb
replied to the thread
dividing a load of work correctly
.
Did you realize that you "could have" made several important & implicit assumptions - which "could be" as follows: 'A' teaches subject...
Today at 7:10 PM
F
fresh_42
replied to the thread
Is there a systematic classification of the most common computer science algorithms?
.
I think computation classes are the closest you can get simply because algorithms depend on their purpose. You can hardly compare a...
Today at 5:08 PM
M
Metronome
posted the thread
Is there a systematic classification of the most common computer science algorithms?
in
Advanced Math
.
In combinatorics, the twentyfold way (and better known predecessor the twelvefold way) classifies counting problems via a single...
Today at 4:50 PM
Dr.Peterson
replied to the thread
Could someone please help? best 6 papers turned in by 28 classes are re-read by organizers to ensure marking is correct.
.
Yes, that's how I read it, though one has to read through it a couple times to understand it. I imagine this is probably part of a...
Today at 12:13 PM
A
Agent Smith
reacted to
babyblueyeon's post
in the thread
Could someone please help? best 6 papers turned in by 28 classes are re-read by organizers to ensure marking is correct.
with
Like
.
Today at 12:12 PM
A
Agent Smith
replied to the thread
Could someone please help? best 6 papers turned in by 28 classes are re-read by organizers to ensure marking is correct.
.
Dunno, combinatorics ain't my strong suit. I like the question format.
Today at 12:12 PM
A
Agent Smith
reacted to
blamocur's post
in the thread
Could someone please help? best 6 papers turned in by 28 classes are re-read by organizers to ensure marking is correct.
with
Like
.
The op says "six best papers", so I am assuming that only papers with the ratings of 83 and 76 are in the stack. I don't know why they...
Today at 12:08 PM
blamocur
replied to the thread
Terrence Howard Math?
.
... characteristic is two ?
Today at 10:59 AM
blamocur
replied to the thread
Terrence Howard Math?
.
Ooops :(
Today at 10:57 AM
F
fresh_42
replied to the thread
Terrence Howard Math?
.
Almost. \lim_{n\rightarrow \infty}\left(1+\frac{1}{n^2}\right)^n = 1. And we can certainly define 1^\infty :=\lim_{n \to \infty} 1^n =...
Today at 10:37 AM
Forums
What's new
This site uses cookies to help personalise content, tailor your experience and to keep you logged in if you register.
By continuing to use this site, you are consenting to our use of cookies.
Accept
Learn more…
Top