@Karl His argument is that it depends on how you define things, and then defined $e^x$ by its power series, and $\pi$ as the ratio of a unit circle's circumference to its diameter.
because choosing specific definitions gonna convince me. :)
I'm planning to make a post about Schor's algorithm at some point over there, I did a class in quantum computing where we had to implement it in Mathematica and I still have some neat visuals somewhere. (i'm not eligible for the bounty though of course)
I need to remember, but IIRC one can make a lattice ordered by set inclusion called the "intersection algebra" of a ring, and an algorithm counting the minimum number of generators depends on the continued fraction expansion of a number associated to the algebra
of a rational number associated to the algebra, I should say. which is cool. most contfrac stuf you see is about infinite continued fractions
Hahaha, hope one doesn't show up in your bathroom! :-P I've got measure theory exam in 30 hours.... I don't think I'll be able to sleep till then... or atleast till 6 hours before it...
@AlexanderGruber Half the proofs I have to write tomorrow depend on choice.... I also have an algebra exam a fortnight later... I'll complain about different shit then... :-P
@Sawarnik cool....
@AlexanderGruber the PSA guideline appears to be new.. what changed?
@KarlKronenfeld I am using Nakayama's lemma to show that if $A$ is local and $M,N$ are finitely generated $A$-modules then $M\otimes_A N=0$ implies $M=0$ or $N=0$.
If $\mathfrak m$ is our maximal ideal, and $k:=A/\mathfrak m$, we have by associativity that, denoting $M_k=k\otimes_A M\simeq M/\mathfrak mM$
@PedroTamaroff, should I just say the rest of the function is smooth-just because? I mean 1 is obviously the problem point, but shouldn't I say something about the rest?
@FernandoMartin Maybe I am wrong then. Essentially, multiplying by elements of $A$ or of $A/\mathfrak a$ is the same in $M/\mathfrak aM$ and $N/\mathfrak aN$.
Question : Prove that if $y,z \in Q$ then $y^z \in A$
My attempt:
Definition 2.7.8 states that a number s is an algebraic number when there exists some $p \in Z[x]$ such that $p(s) =0$. Let us denote the set $ A = [x \in C: x $ is algebraic]
The set of all polynomials in x with coefficients fr...
I have to find a polynomial root of $\frac{a\b}^\frac{c}{d}$
nguh I donn't wanna edit
I mention the root in here http://math.stackexchange.com/questions/766935/prove-that-if-y-z-in-q-then-yz-in-a/766949?noredirect=1#comment1593438_766949
@usukidoll : $y = \frac{a}{b}$ where the $a,b$ are integers. So if you prove that integers to a certain power are algebraic then you already know that $1/b^{n}$ is algebraic since it's equal to $(b^n)^{-1}$
No, you start with smaller problems then build the bigger problem. It makes sense mostly that way
there ^ that's what I want. so I multiply all of that by $b^c$
but I feel like I'm skipping steps.. there's this identical problem that multiplies, rearrange the coefficents, and then muliply the last equation by the denominator
it's something like ... $p(x) =c_nx^n+c_{n-1}x^{n-1}+...+c_1x+c_0$
such that p(y) = 0 and there exist integers a and b such that $b \neq 0$ and $ y=\frac{a}{b}$
i have a question. If $f(x) = \tau(n*p^x) - \tau(n)\tau(p^x)$, where $(n,p)=1$ and $\tau$ is ramanujan's function. I am trying to show $f$ is always $0$, and I was advised to show $f(x)$ is a linear combination of $f(x-1)$ and $f(x-2)$ . How does this suffice.
@Mike I don't know if you are serious. But, in case not. I references a GY!BE song, and then Fernando commiserated with me on a more global level, and then you misunderstood. That's the world as I see it.
I also have another one... I might have some clue or not X>X
Let $a,b \in R$ where $ a < b$. Prove that there exist a rational number $c$ and an irrational number $d$ such that $ a <c<b$ and $ a<d<b$. Hint: consider decimal expansions of $a$ and $b$
Theorem 2.7.5 states that a real number is rational if and only if its decimal expansion terminates or has an infinitely repeating sequence of digits.
Set $I$ is irrational numbers
$I =[x \in R: x \notin Q]$
Set $Q$ is rational numbers
$Q = [ \frac{a}{b}:a,b, \in Z$ and $b \neq 0]$
oh geez if there is an irrational number d... the decimal expansion doesn't terminate D:
If the division process terminates, then we are done. Otherwise, since each
digit of the quotient determines in turn its duccessor, and since there are
at most $b-1$ possible remainders when dividing by $b$ (by the division
algorithim), some digit of the remainder must show up again, forcing a
sequence of digits to repeat forever. The length of the repeating cycle is
at most $b-1$
Since $d$ is irrational, the decimal expansion will terminate. Therefore,
for $r=0$, we have $a_1,a_2,...a_k$ where each $a_i \in
[0,1,2,3,4,5,6,7,8,9]$ and $a_k \neq 0$. Then
$ r = \frac{a_110^{k-1}+a_210^{k-2}+...+a_k}{10^k}$
@Chris'ssis I didn't see any connection with the calculations and the final question. Many people prefer red and hammer is a common tool could have been said in 1 line.
Let $a,b \in R$ where $ a < b$. Prove that there exist a rational number $c$ and an irrational number $d$ such that $ a <c<b$ and $ a<d<b$. Hint: consider decimal expansions of $a$ and $b$
Theorem 2.7.5 states that a real number is rational if and only if its decimal expansion terminates or has ...