You are not logged in.
Hello everyone
I have read before ( but I don't know where ) about something calld "newten theory" which is about roots and equations.
Can you give me a resource about this theory or any information that can help?
I think the theory is about finding the conclussion of equations root in n term
for example
if X1 ,X2,X3,X4,X5,.................,Xn are roots for the equation
aX^n+bx^(n-2)+............................+c=0
by using this theory we can find the conclusion of x1^n+x2^n+................+xn^n=?? directly.
Thank you.
Hi FERMAT'S;
That might be difficult. Hold on please.
Here is a sevener:
What forum?
how ?
did you do it by egyptian fraction theory ??????
actually I found this quastion in a math forum
Find a,b,c,d,e,f,g if they are natural numbers N = 1,2,3,..................
and
7/30 = 1/a + 1/b + 1/ c + 1/d + 1/ e + 1/f + 1/g
yes
as an egyptian fraction
last thing
How to expand the fraction . for example
5/121 is divided in two ways . the first one is longer than the other
can you expalin it with a small example like
7/30 .
Divide it to 7 fractions.
Thank you
yes I it was my fault
I used it in a worng way
but I got it
Thank you so much . I appreciate it
allways put it in possitive ?? right
can you look at this
http://en.wikipedia.org/wiki/Greedy_algorithm_for_Egyptian_fractions
(simplifying the second term in this replacement as necessary). For instance:
7/15 = 1/3+2/15 ???
the remainder should be 1
that means it should be
7/15 = 1/3 + 1/45 , should not it ? According to the rulle
It does not make sens but the rule says that
-3/45=-1/15
right
Hi everyong
could please explain me what does y mod x mean ??
and find
(-15 mod 6 ) / ( 15 . 3 )
by the way
thank you so much .
I knew it from someone .
and I read it again in a Teaching Package.
but I don't have this package now > so I want to be sure aout this infornmation.
hi bobbym
thank you for your comment
could you please the method that I wrote above ? and tell me if it true
thanx
WoOoOoW
tHaNk YoU So MuCh
are there the solutions ?
I read one before that says .
if X is integer
to know if X is prime or not .
First find a square number that is biger tahn X and let's call it y ^2
so
root(x ) <y
second, divide X on all the square number between 2 - y
now , if the result is integer number so X is not prime . if it is not so x is a prime number .
I hope if this right .
Hi everyone
could u please write me the methods those to know if the number is prime number ?
Hi everybody
do u know a good book for ( Number theory )) basices , and has some of BIMO quastions ??
woOoOow
I will think about it , thank u for the hint for a new problem
I tried to prove this rule >>> (n-1+j)C j , I wondered from where the Combinations came ?
I have quastion is there a link for IMO training in this forum.:
thank u so much
actually I read a rule says
if x1,x2,x3,........,xn Integers numbers but not negative
so the number of solutions for x1+x2+x3+x4+........+xn=j
is
(n-1+j)C j
I Wanna be sure if is it right ?
ok thanx for that
what about if we say a+b+c+d=8
how many solutins there are ?
Sorry there was a mistake in the quastion
I fixed the mistake
thank u
I got the same bobbym's answer
65780 ways = 26C5
thank u for the quastion
:
if x,y,z are Integers numbers but not negative (0,1,2,3,4,5,6...........))
(( if u have other sentence better than this please tell me ))
how many solutions there are in this formulas.
x+y+z=2
and what are they ??
I know it is easy question , I just wanna be sure of something
thanx :):):)
thank u too, genesh moderator
and it is my pleasure to be a member in this big forum of informations.:)
thank u bobbym