Recent content by TalonStriker

you missed the part where I said that I didn't want trig functions.

Can anyone give me a function that (roughly) looks like the top or bottom one in the picture attached? And yes the limits is constant as x-> +/- infinity. I don't want a trig function like arctan since trig isn't really all that applicable for what I'm doing. I'm posting here since I...

I was able to fix it. Apparently i was using / in f() instead of ./. Thanks for your help.

Hey guys, I was just wondering if anyone knows how to set the initial conditions for ode45() if you know f(1.5) but NOT f(0) Currently I have >> ode45(f, [0 1 1.8 2.1], [1.5 .5]) But this creates the following error: ? Error using ==> funfun/private/odearguments @(T,Y)...

You don't need L'hopital's rule here since the numerator is always constant... The answer is more straight forward than you think... What's lim [x->infinity] 1/(x^2) ? edit: didn't notice that x was to the power of p...see office shredder's comment

Homework Statement 1) 100 of the 5-element subsets of {1, . . . , Y } have the same SUM. (Fill in Y . Make Y as small as you can, however you need NOT prove that it is smallest possible. You might need a calculator.) 2) Let FUNC be the set of all FUNCTIONS from N to N. Show that FUNC is...

I think c is some specialization constant... I posted in the other thread you created.

I am not familiar with combinations... what are they? A google search doesn't net me any useful results.

I could help you with number 2, you could make use of the "intersection of a subset rule." But you've got the basic idea nailed. Edit: I think that you could use Universal Modus Ponens for #1.

Homework Statement Prove that, for all n, for all m with 0 <= m <= n, the number of subsets of {1, . . . , n} of size m is the same as the number of subsets of {1, . . . , n} of size n − m. Homework Equations n/a The Attempt at a Solution My problem is that I don't know where to...

Hah, I'm taking a similar class. I have no clue on how to do (a). But (b) is really easy. I'll give you a hint and say that the universe is the natural numbers or even the integers if you wish. Find two properties of numbers such that if one is true, then the other isn't. (take advantage...

thanks!

Yes I can prove that m^{3} mod 7 = 0 implies mod 7 = 0. I assume that the next step would be set m=7k. Then plug it into the previous formula which would yield something like 7n^{3} = 7 * 49k^{3} using this I can prove that n % 7 = 0. So m/n has a common factor, which contracts one of the...

Hi guys, How would you prove that \sqrt[3]{7} is irrational without using the unique factorization thrm? I tried proving that \sqrt[3]{7} is rational but it didn't seem to get me anywhere... Thanks EDIT: Looks like I posted this in the wrong forum.