Recent content by mathmadx

Hello friends, The problem I am trying to solve sounds simple, but I still haven't been able to find the solution: Find a prime divisor of 1111111111111 (13 ones), also known as a repunit. I know the answer(53, 79 and some big prime), but I have no idea how Mathematica calculated those values...

May you use taylor series?

Hello, I think I have a solution, but I am not sure, especially because I haven't used the pigeonhole principle:(By the way: Some things you list under data (x=pm+a etc), you have to show that, that isn't given.) We can always say that there is a x such that x=pn+a (for some p). ( Notice your...

Dear all, a question which has puzzled me for some days: (Assume that all are differentiable enough times): Calculate: \frac{\mathrm{d} }{\mathrm{d} x}\int_{g(x)}^{h(x)} f(x,t) dt

Hi guys, I need to show that: \int_{0}^{\infty } \frac{x^{a}}{(x+1)^2} \dx = \frac{\pi a}{\sin(\pi a)} , where -1<a<1. The problem is, that although a hint is given,the path of integrating it, I have difficulty what they really mean with "cut line, branch points, multivalued functions" etc...

Lol, :) Ok, I am sure you can give some more advice concerning Physics. Though, I must admit: I was also very interested in graphics related things, and enjoyed making a ray tracer which included things like reflection and refraction. Gaming is also sure an interest of mine. Though, the...

Dear all , I am a twenty years old maths/physics student, who has done his first year well with minimal effort. I know from myself that I am smart enough to do theoretical physics, which IS really hard I hear.. When I was at high school two years ago, I was extremely motivated in calculus...

Ok, thanks, however, it's still a bit blurry to me why the fact that they can't be all the same implies that there is such an integer n..

Dear all, The question I've been struggling with is supposed to be solved using the way Lagrange's thm was proven( with number of cosets and stuff). However, it remains a mystery how to do it: Let G be a finite group and H<G with |G|=m|H|. Proof that g^{m!} \in H, \forall g \in G

We know by cauchy that the order of G is in the form 2^k. Applying this combined with the fundamental theorem is the proof.

No sarah! I have no idea what all those other people are saying: They are saying sth like" You need to understand how natural numbers are defined to use them". Of course this is nonsens- needing abstract algebra for understanding Quaternions!? No way. I know that book u are talking about is...

You know Lagranges theorem..? Consider the subgroup generated by g,- what's his order?. Well, if you like carefully at what " generates" means, youll see that the order of the subgroup generated by g is also p.

Well; simply make the second blah in the first line a -blah,- it remains a " blah" doesn't it? :) The " trick" you mention makes use of a determinant to calculate aXb .

No one who can provide some insights..?

I am sorry, I am not able to see it. I keep on thinking about the fact that m products of Z_2 has order 2^m, which is supposed to be equal to n( the order of the group G..) I don't even get your advice: How can we tell the identity where to go!? The identity(of G) should always go to...