All Questions
4
questions
3
votes
1
answer
193
views
Euler Transform on Leibniz Series of Pi
So i read about simple series for Pi named Leibniz Series for Pi. Here is its Link:-
Series . I made a program for it and soon realised that it converges very slows . So i did Euler accelerate for ...
0
votes
1
answer
261
views
Recursive Function to Produce Constrained List of Integer Partitions
I have modified a recursive function designed to print all the integer partitions of a positive integer to create a function that returns all partitions of the "number" parameter if they ...
2
votes
1
answer
64
views
Make a given number by adding given numbers
I have created a code that checks if a number can be made by adding different quantities of given numbers and if so returns the quantities. Is this the best way to do this or is there a more efficient ...
- 285
1
vote
1
answer
137
views
Decomposing a number as a sum of two products using tree recursion
Below is the problem taken from page6 here.
The TAs want to print handouts for their students. However, for some unfathomable reason, both the printers are broken; the first printer only prints ...
- 3,351