Items tagged with digits


I have $ signs suddenly apearing down the side of my document. They are randomly formatting numbers. Don't know how I turned it on. How to undo?  Do they affect calculation accuracy or are they purely dislap formatting




My professor insists for a homework problem that we write down a number answer to this one problem which boils down to...

I'm aware that's incredibly small. So much so that when trying to get a value to display using the command

at its max, it's still 0.00000000000000..0 as an answer.

I might just give up and write down the exponential form. But I was just curious if there is a way to get a number in scientific notation.


I'm just doing a small project/HW for school where I am trying to create a histogram of the appearance of the digits of Pi. My problem is that I lose connection with the Maple Kernel whenever I go over 1000 digits. Why? Is this because my function scales badly? Any help would be appreciated.

Thanks in advance.


floor(n/10^(ceil(log10(n)-k))) mod 10;






Hi, anyone know hot i need to continue my command to get 462 from [4,6,2]?

Thank you~=]]


When I subtract (in base 10) 235 (octal digits) from its reverse I get  [-1,-1,2]. converting this list to number equals 189 (base 10)....divisible by 7. [I would think the list would be [9,8,1] ;

in wolfram alpha 532 base 8 - 235  base 8 = 189 base 10 ).

Converting 189 to octal yields 275. All this is done correctly in Maple.

Now when I add 275 base 8 to 572 (edit: not 575 as I had before) base 8 I should get 1067 base 8, but I don't....

for sure i've done something silly

(Some) prime reciprocals have an interesting property. the repeating sequence has length p-1.

eg 7, has repeats after 6.


17 has repeats after 16


of course some primes don''t have this property....

So what I need the experts here is for some code

myproc(17)=16, (and the sequence) 0588235294117647

my go:pinched from

PriDigits := "" || (op(1, evalf(1/17, 50)));

reps := StringTools[Repeats](PriDigits);

lngth := seq(op(3, A), A in [reps]);

the leading 0 (which is part of the sequence)  is a problem.....





i need Maple to respond   0.015241578750190521 by adjusting Digits number dynamically. I don't want to adjust  the Digits Number to a fixed value.


This is not actually a question, but an interesting problem found in the recent book (2nd edition, 2015):
Mathematica®: A Problem-Centered Approach
by  Hazrat Roozbeh

I hope that you will enjoy the problem too.

Define the functions f, h : N --> N by
f(n) = the sum of the squares of the digits of n; e.g. f(25) = 2^2 + 5^2 = 29.
h(n) = min {f(n), f(f(n)), f(f(f(n))), ... };  e.g. h(7)  = min{49,97,130,10,1} = 1.

A natural number n is happy if h(n) = 1.
Find all the happy ages, i.e., happy numbers up to 100.
Conclude that happy ages are mostly before one gets a job or after retirement!

Hi everybody,

Ever since i updated to maple 2015, the output of calculations display a disproportionate amount of zeros. For instance:

If i write:


i get:


Is there anyway to make maple NOT display the last 10 zeros? I've tried Tools ->Options ->Precision -> Round screen display to X. But then it rounds all results to that X amount of digits, wich is also anoying. Like, if i set X to be 10, it'll write 3.000000000 instead of just 3.

Hope someone can help me :-)


Hi all,

I write this code with some matricial calculations.

There are two important parameters N and Digits (in red in the code).

For N=8, I can do the calculation with Digits=10. For N=10, to get the results (without overflow), I should give Digits=30.

I want to do the calculation for N=100 and higher.

I do not know how to do this. I have a PC with 4G of RAM.

Thank you


How to find the maximum natural number n s. t. the sum of its cubed digits is greater than or equal to n? Of course, with Maple. The same question for the sum of the  digits to k-th power. Here are my unsuccessful attempts:
1.Optimization:-Maximize(n, {n <= convert(map(c ->c^3, convert(n, base, 10)), `+`)}, assume = integer);

Error, invalid input: `convert/base` expects its 1st argument, n, to be of type {integer, list(integer)}, but received n

2. for n while n <= convert(map(c ->c^3, convert(n, base, 10)), `+`) do print(n) end do;


I found this problem in a book about mathematica.
I want repeat it with maple.
But even Digits=1400, the exact value of s@x=70 is still different with the result(0.633319) on that book.
How to resolve this problem?
I want some help.


I have a pair of markov matrices that are 250x250 and 500x500 in size. I am raising these matrices to high powers, like 10^17 by 10^12. (I'm using a do loop.) If I set digits:=15, Maple will use 100% of the processor that is available. If I set digits:=16+ Maple will only use 1 thread of my processor. Why? It is the same matrix same program. The only thing that changes is the digits of accuracy. This seems exactly backwards from what it should be. As a result, my AMD9590 processor will run full blast when I choose 15 digits of accuracy and gets the biggest matrix done in 1-2 hours. If i set the accuracy to 17 digits, it takes half a day or more to do the same thing!!! 2 digits of greater accuracy should not take an additional 20 hours!



for example i want to save the Square root of 2 to 1000000 decimal place to an ascii text file ...

i used the writeto command after evalf[100](sqrt(2)) for but it contains line breaks and \ character in output !

but i only need the pure continues 1000000 digits !

please guide me on this simple request ?

1 2 3 Page 1 of 3