Hi guys, i'd tried the following transformation :

We knows that ((a^(1/n))^1/m) is equal to a^(1/n*m), well, when i enter the expresion in symbolic mode (Using the 2D Keypad) the CP300 show ((a^(1/n))^1/m) as result and not the expected one a^(1/n*m). My questions are, im doing something wrong??, the CP300 have something wrong?? or the answer is just like that ??

Regards to all the Gang

# Cp300 The Simpliest Thing Seems No Such

Started by
Nexus
, May 06 2004 07:31 PM

4 replies to this topic

### #1

Posted 06 May 2004 - 07:31 PM

### #2

Posted 06 May 2004 - 08:30 PM

did you use the simplify command?

### #3

Posted 06 May 2004 - 09:06 PM

Yes i did use both, the simplify and the expand commands (On the Interactive and action menues) with the same result, however, for other transformations, for instance : rational expression (a/b/c) the CP300 works ok.

Curious isn't it ??

Curious isn't it ??

### #4

Posted 07 May 2004 - 05:53 AM

Hi.

I think the ClassPad cannot simplify the expression because it doesn't know whether ((a^(1/x))^(1/y) is define. As we know, in the difinition of y=a^x, a must greater than 0 and a <> 1. In this case, a must > 0 and a<>1, so the ClassPad cannot do any thing. Try with simple one : (a^x)^c, it cannot give a^(x*c).

If you try: judge((a^x)^c=a^(x*c)), it will give undefied.

I think the ClassPad cannot simplify the expression because it doesn't know whether ((a^(1/x))^(1/y) is define. As we know, in the difinition of y=a^x, a must greater than 0 and a <> 1. In this case, a must > 0 and a<>1, so the ClassPad cannot do any thing. Try with simple one : (a^x)^c, it cannot give a^(x*c).

If you try: judge((a^x)^c=a^(x*c)), it will give undefied.

### #5

Posted 07 May 2004 - 02:40 PM

Tanks for your comment but, the criteria applied here is very simple : If i have an expression that represent an arithmetic LAW (Just like i did show in my post), the machine must be capable of represent such law in its simplest form. As i wrote in my question, the machine works fine with others expresions, for instance :

a

--- a

b = -------

------ b * c

c

it represent a very basic arithmetic LAW, and the machine solve it without problem, even, a, b, c, are not defined, but when i try to do the same witn other arithmetics LAW, especially : Roots, Rationalization, Power, etc... the machine just transform the expression in other form but not show the expression in the form that such LAW demands. These examples are Elemental Arithmetics!! i no want to think that my CP300 can't solve such kind of problems !!!.

a

--- a

b = -------

------ b * c

c

it represent a very basic arithmetic LAW, and the machine solve it without problem, even, a, b, c, are not defined, but when i try to do the same witn other arithmetics LAW, especially : Roots, Rationalization, Power, etc... the machine just transform the expression in other form but not show the expression in the form that such LAW demands. These examples are Elemental Arithmetics!! i no want to think that my CP300 can't solve such kind of problems !!!.

#### 0 user(s) are reading this topic

0 members, 0 guests, 0 anonymous users