pimp88z

15 Reputation

3 Badges

9 years, 217 days

MaplePrimes Activity


These are questions asked by pimp88z

Dear mapleprimes users,

I have a problem with the LeastSquaresPlot(A0,[p, sec ]) function, for the vector A0, then it gives the error:

Error, (in Student:-LinearAlgebra:-LeastSquaresplot) all points must evaluate to numeric values.

I tried to convert the vector A0 to numeric values, but I didn`t succeed yet. I take A0 = vector(1..10,2) as an example, but still I get nothing.

Thanks for the help!

Yours

 

Dear mapleprimes users,

I have a problem concerning this function:

Naief := proc(A::integer,B::integer, p::posint)
local x, a:= A mod p, b:= B mod p;

 for x from 1 to p-1 do
    if a^x mod p = b then return x end if
end do;
print(¨No solution.¨)

end proc

It works fine for what it should do, finding x for a^x = b mod p by inserting x from 1 to p-1 until it finds an
apprioperate x.

My problem is concerning its computation time, which I like to calculate with:

Codetools:- Usage(Naief(a,b,p), output = [cputime], quiet, iterations= 2^12)

The problem is that keeps repeating

alot even when a,b and p are immensely huge. I don`t know how to fix it, because I need real CPUtimes which increase
a,b and p increase. I get the idea that the values of the CPUtime are not realistic.

 

Thanks for the help!

 

 

 

Dear mapleprimes users,

I have a problem with this function:

B is the length of my array

A := Array(1..B,0);

for i from 1 to B do
p = nextprime(i)

a = primroot(p)

A[i] := A[i] + convert((Usage(mlog(b,a,p,method=indcalc), output=[cputime,output],quiet)[1],decimal,15))
end do;

A;

My idea is to create an array A with all the CPUtimes from the 1st prime til the Bth prime, and then plot it.

But my problem is that I get an error; Illegal use of an object as a name.

I don`t know what to do could you help me?

 

Thanks!

 

 

Hi all!

I have this function:

 



Problem is it doesn`t have any output, really anoying! Could you please help. Thanks guys!

I need to find only the x for which a^x = b mod p is a solution of.

I`ve written this program:



It determines the power of the Ithfactor, only one problem. When I try to compute the factor of 512 I get 2_2 (subscript) which is extremly stupid. I want to know how I can change my program so that it can give the power of every ith factor. Thanks!

1 2 Page 1 of 2