Here's something for you Math Wiz's out there.

CorCentral

Banned
Feb 11, 2001
6,415
1
0
It's not a problem I'm looking solved for school. I graduated 13years ago LOL.
A friend of mine said to use any means possible so here I am :)


(x+1)*2*343*52352/2-X^33253653=x+32342345235323+X^9999/322
 

Vertimus

Banned
Apr 2, 2004
1,441
0
0
A computer can do that anyday.

I'm not seeing anything special in this problem except number crunching.
 

BrokenVisage

Lifer
Jan 29, 2005
24,771
14
81
I don't see what the big deal is, just a couple extrapolations here and there to find what x equals.
 

Vertimus

Banned
Apr 2, 2004
1,441
0
0
You've got to suck majorly at math to find problems like these interesting. It's like back in 2nd grade where people keep asking "what's 9999999 times 999999910101112"?

 

eigen

Diamond Member
Nov 19, 2003
4,000
1
0
Originally posted by: david46675
uh
graph them on the TI-83 and see where the lines intersect?

No look at that first term a TI-83 couldnt handle it.If you havent figured it out in a while I will get the supercomputer to work on it...
 

david46675

Senior member
Jun 9, 2005
404
0
0
Originally posted by: eigen
Originally posted by: david46675
uh
graph them on the TI-83 and see where the lines intersect?

No look at that first term a TI-83 couldnt handle it.If you havent figured it out in a while I will get the supercomputer to work on it...

ur right, i didnt look closely...
btw OP, ask ur friend what 99999999999*2394781392847109234 is ;)
 

RaWrulez

Senior member
Mar 4, 2001
968
0
0
Your search - (x+1)*2*343*52352/2-X^33253653=x+32342345235323+X^9999/322 - did not match any documents.
 

Torched

Member
Jun 23, 2004
107
0
0
every time (x+1)*2*343*52352/2-X^33253653=x+32342345235323+X^9999/322 a kitten dies!

Poor, poor kitten :(
 

eLiu

Diamond Member
Jun 4, 2001
6,407
1
0
This problem isn't THAT simple. Computers work in finite precision.

The exponent is HUGE. Round off problems in double precision will be significant. Just be glad it's just a monomial. I THINK that w/o "infinite precision" numbers (like in Maple or Mathematica), you won't get a truly accurate number because next to X^33253653, x^1 is gonna have some issues.

I'm not sure if a precanned algorithm in like C could handle this. I mean precanned algorithms have trouble with stuff like (x+19)*(x+18)*...*(x+2)*(x+1)*x. Find all 20 roots of that...it's a more complicated problem than you think.
 

eigen

Diamond Member
Nov 19, 2003
4,000
1
0
Originally posted by: eLiu
This problem isn't THAT simple. Computers work in finite precision.

The exponent is HUGE. Round off problems in double precision will be significant. Just be glad it's just a monomial. I THINK that w/o "infinite precision" numbers (like in Maple or Mathematica), you won't get a truly accurate number because next to X^33253653, x^1 is gonna have some issues.

I'm not sure if a precanned algorithm in like C could handle this. I mean precanned algorithms have trouble with stuff like (x+19)*(x+18)*...*(x+2)*(x+1)*x. Find all 20 roots of that...it's a more complicated problem than you think.

That why I told him I would send it up to the supercomputer I have acess too.I can allocate up to 6 nodes to work on this...
 

chuckywang

Lifer
Jan 12, 2004
20,133
1
0
Originally posted by: eLiu
This problem isn't THAT simple. Computers work in finite precision.

The exponent is HUGE. Round off problems in double precision will be significant. Just be glad it's just a monomial. I THINK that w/o "infinite precision" numbers (like in Maple or Mathematica), you won't get a truly accurate number because next to X^33253653, x^1 is gonna have some issues.

I'm not sure if a precanned algorithm in like C could handle this. I mean precanned algorithms have trouble with stuff like (x+19)*(x+18)*...*(x+2)*(x+1)*x. Find all 20 roots of that...it's a more complicated problem than you think.

You could always just iterate.