vv

12570 Reputation

19 Badges

8 years, 241 days

MaplePrimes Activity


These are answers submitted by vv

add8 := (x,y) -> convert( convert(x,decimal,octal) + convert(y,decimal,octal),  octal,decimal );
add8(275,575);  # 1072

 

(The addition must be done in base 10).

Note that lists are added componentwise.

Here is a general but not very efficient procedure.
Of course it would be much better to solve the equation only once, but in this case, the solutions must be verified and the special cases must be considered.

inteq:=proc(f,x,vpar)
local vab,ab,s,T,r,n:=0;
indets(f,name) minus {x}; vab:=[op(%)];
T:=combinat[cartprod]([ [seq(vpar)] $ nops(vab) ]);
while not T[finished] do
   ab:=T[nextvalue]();
   s:=solve(eval(f, vab=~ab),x);
   if s=x then print(vab=ab,"identity!") fi;
   s:=select(type,[s],integer);
   if s<>[] then n:=n+1; r[n]:=[ab,s];DocumentTools[Tabulate]([n]) fi;
   #if s<>[] then n:=n+1; print(n,[vab=ab,x=s]) fi
od;
n,vab,x,eval(r);
end:

inteq(a*x + b = sqrt(c*x + d),x,-2..2);

            [a, b, c, d] = [0, 0, 0, 0], "identity!"
            [a, b, c, d] = [0, 1, 0, 1], "identity!"

                     176, [a, b, c, d], x,

 

 

Factorizing f7 ==>

p1-t1  or  p2-t2  or  p3-t3  is an integer multiple of Pi.

For p1-t1 = 0 (or Pi), from f1 and f2 ==> two spirals, namely

plots[spacecurve]([2.350000000*cos(t1), 2.350000000*sin(t1), t1], t1=-Pi..Pi);
plots[spacecurve]([-.350000000*cos(t1), -.350000000*sin(t1), t1], t1=-Pi..Pi);

For p2-t2 = 0 (or Pi) you get two spirals in (x,y,t2) etc.  If you want here (x,y,t1), t2 must be expressed wrt t1.

Note that the (x,y) projection is contained in 6 circles.

with(combinat, cartprod):
n:=2:
A:=Array((1..3) $ n):

T:=cartprod([[1,2,3]$n]):
while not T[finished] do
i:=T[nextvalue]();
A[i[]]:=i;  # or ... whatever
end do;

If you have Maple >= 2015, you may use the size option:

plot( max(sin(x),0)^2*sin(16*x), x=0..8*Pi, numpoints=10000,size=[1200,300]);

 

 

# b(m)=m-1/2;
c:=m -> convert(m,symbol):
a:=m -> a(m-1)*b(m-1)/(b(m)*c(m)):    a(0):=a0:

a(8);

a(11);

(case A only).

Obviously sup f = oo  (for a1 --> oo).

f is increasing wrt a1.
f(2,a2,a3) is increasing wrt a3.
So, min f = min f(2,a2,3)
and is easy.

are tough! Usually the sum cannot be computed exactly.

Instead of your series we may take

a:=1/(i^4+j^4);

S:=Sum(Sum(a,i=1..infinity),j=1..infinity);


(this differs by yours by constant which is easy to compute).

value(S); does not work, as expected

Unfortunately Maple cannot approximate its sum dirrectly.

evalf(S); #does not work (unexpected!)

But the inner sum can be computed exactly, ==> 

evalf(  sum(sum(a,i=1..infinity),j=1..infinity) );

So, the series seems to be convergent, but this is not a proof.

( It is not difficult to see that se series is convergent using  a <= 1/i^2 * 1/j^2 ).

Another way for convergence:

S is convergent iff J < oo, where

J:=Int(Int(a,i=1..infinity),j=1..infinity):

Unfortunately J cannot be computed directly. 

value(J); # does not work

We must use:

int(a,i=1..infinity) assuming j::posint:
int(%,j=1..infinity);

so, J<oo and hence S<oo.

To compute a partial sum and verify numerically the sum:

eval(  'evalf'( 'add'('add'(a,i=1..N),j=1..N)),  N=1000);
     0.7617308252

(close to the value obtained earlier).

 

 

with(IntegrationTools):
f:=t^2*exp(-t)/ln(t):
J1:=Change(Int(f,t=0..1-a),t=(1-a)*x,x):
J2:=Change(Int(f,t=1+a..infinity), t=(1+a)/x,x):
simplify(limit(combine(J1+J2),a=0));

evalf(%);

      2.153547692

 

f := (i,j) -> `if`(j=1, i^2, i^3):
Matrix(10,2,f);

The system is too complicated to be solved. Use fsolve instead, it works.

Do the same for "Cello" (and conclude).

Definitely the error is due to your "..." (not shown).

You may have used it incorrectly, but Groebner solves at once your problem.

sys:=O1*O3*f7-f1, O1*O3*f1-f7, O1*O3*f8-f2, O1*O3*f2-f8, O1*O3*f5-f3, O1*O3*f3-f5, O1*O3*f6-f4, O1*O3*f4-f6, O1*O4*f8-f1, O1*O4*f1-f8, O1*O4*f7-f2, O1*O4*f2-f7, O1*O4*f6-f3, O1*O4*f3-f6, O1*O4*f5-f4, O1*O4*f4-f5, O1*O2*O3*f6-f1, O1*O2*O3*f1-f6, O1*O2*O3*f5-f2, O1*O2*O3*f2-f5, O1*O2*O3*f8-f3, O1*O2*O3*f3-f8, O1*O2*O3*f7-f4, O1*O2*O3*f4-f7, O1*O2*O4*f5-f1, O1*O2*O4*f1-f5, O1*O2*O4*f6-f2, O1*O2*O4*f2-f6, O1*O2*O4*f7-f3, O1*O2*O4*f3-f7, O1*O2*O4*f8-f4, O1*O2*O4*f4-f8:

oo:=O1^2-1,O2^2-1,O3^2-1,O4^2-1:

Groebner[Basis]([sys,oo], plex(f1, f2, f3, f4, f5, f6, f7, f8,  O1, O2, O3, O4)):
select(has,%,[seq(f||i,i=1..8)]);

 

Maybe they used Mathematica. 

[ just wanted to be malicious :-) ]

Edit. More seriously, using some vector letters (as polygons)

 

First 101 102 103 104 105 106 107 Last Page 103 of 112