Here you can solve interesting problems using whatever programming language you like. Also you will earn SBI and sometimes STEM by doing so.
Also you might learn new things by doing so.
The tasks will be rather hard to solve without a programmable computer and some programming skills, but if you want to add a few million numbers by hand or similar, I would still give you the reward.
No upvote, No resteem, No follow required!
I will give the prize randomly to those who solved the problem.
If two pieces of code are to closely related I might consider the later of them as copied which results in no prize for that person.
You have 4 days to solve it.
Even though this is about computation I will also accept algebraic solutions if you find one.
In order to get accepted you need to somehow attach your code.
This time the problem is about performance:
I want you to find two different way of approximating π using a computer.
Measure for each of the methods how much time is needed to get it correct to the nth digit ranging n from 0 to 10. 0 meaning that the result is 3.xxx . The result from 10 should be included.
Graph the result.
Compare the time of both methods.
Also take a look at how the time changes compared to the number of digits.
And then tell me which one you would use for
- approximating π to a few digits(10-50)
- approximating π to a lot digit(a lot more than 100).
in a performance critical application.
If there already have been other entries before yours, you have to use at least one unique technique of approximating pi. There are infinitely many different ways to approximate π, so that rule shouldn't make it impossible to join.
If you don't know enough techniques, feel free to ask.
In case no one gets a result(which I doubt), I will give away the prize to the person who makes the most constructive description why the problem is too hard in your opinion.