All Questions
5
questions
6
votes
4
answers
612
views
Pascal Triangle calculation with BigIntegers
On a well known programming challenges website(CW) there is a Kyu2 eggs height problem that can be solved utilizing a variation of Pascals Triangles properties.
The problem asks to solve ...
- 160
5
votes
4
answers
2k
views
Project Euler #5 - Lowest common multiple of 1 through 20
This is my code. All comments welcome. Last time run it only took 335 milliseconds:
...
user34073
4
votes
1
answer
796
views
Project Euler #12 very long runtime
Project Euler Problem 12 asks to find the value of the first triangular number to have over 500 divisors, where the \$n\$th triangular number is \$\sum_{i=1}^{n} i\$.
The sequence of triangle ...
15
votes
3
answers
2k
views
Wow that's a big integer! What's its largest prime factor?
I see that there are a few other people who have tackled Project Euler Problem #3. I hope you're not all sick of that question yet. I've not taken a look at those yet (purposely), but am about to now. ...
- 30.8k
4
votes
1
answer
2k
views
Truncating an integer from left to right and right to left
Project Euler problem 37 says:
The number 3797 has an interesting property. Being prime itself, it is possible to continuously remove digits from left to right, and remain prime at each stage: 3797,...
- 637