You are not logged in.
hi ganesh
703-a Kaprekar number
hi aishwarya,
you can do it like an equation.
hi ganesh
ok thanks for trying.
630=2*3*3*5*7=97+101+103+107+109+113 which are consecutive primes
let's try this: x[0]=sqrt(5) and x[n+1]=sqrt(5+x[n])
when i get boring just tell me.i like learning new things.
can you tell me how to get a general term of a sequence.
then that's all i need. btw i get 0.
dont' think so. i know how to use it when x is not a power.
ihaven't learned anything here at school,just like to search
i know l'Hopital's rule.
yeah it wasn't that hard to divide -1 by -1
could you answer post #52
561
if HCF(561,b)=1 then b^560 is congruent to 1 modulo 561
thanks for your help
what would happen if it were
thanks
if i understood correctly this woud be the numerator:
hi
call me dumb but still not getting it
hi bobbym
thought so but how?
i forgot it should be
hi bobbym,
changed it,i'm just starting with this so i got confused
hi all
bob bundy, what i ment was is there anything you can do if you had something like this:
PS i did this one in 6 tries
hi
I would like to know how to do matrices because i didn't understand anything about them in the topic you posted.
unrelated to this what limit rules apply for powers?
if you don't have anything to do maybe you could help me a little bit with this. just so i can get the hang of it.