Search found 6 matches

by Cot-O-Bus
Wed Apr 03, 2019 6:34 pm
Forum: Combinatorics
Topic: Number of ordered ways of writing n as the sum of 3 triangular numbers
Replies: 0
Views: 4866

Number of ordered ways of writing n as the sum of 3 triangular numbers

Hello colleagues, I've implemented strait forward algorithm for case 3 according to page 6 On the representation of integers as sums of triangular numbers But it produces wrong results for n = { 3, 9, 12, 18, 21, 30, 34, 39, 45, 48, 57, 59, 63, 66, 67, 75, 84, 93 }. Can somebody give me a hint what ...
by Cot-O-Bus
Tue Feb 19, 2019 3:00 pm
Forum: Clarifications on Project Euler Problems
Topic: Problem 656
Replies: 9
Views: 1142

Re: Problem 656

I have had an errors at { 677, 730, 785, 842, 901, 962 }
Fixed.
Solved.

Thanks for collaboration.
by Cot-O-Bus
Mon Feb 18, 2019 6:46 pm
Forum: Clarifications on Project Euler Problems
Topic: Problem 656
Replies: 9
Views: 1142

Re: Problem 656

.
by Cot-O-Bus
Tue Nov 20, 2018 7:24 pm
Forum: Clarifications on Project Euler Problems
Topic: Problem 643
Replies: 8
Views: 2905

Re: Problem 643

Looks like expansion of PI-2, but...
by Cot-O-Bus
Mon Nov 05, 2018 7:40 pm
Forum: Clarifications on Project Euler Problems
Topic: Problem 641
Replies: 5
Views: 2103

Problem 641

Can any body confirm following sequence <snipped by moderator>?

Thank you.
by Cot-O-Bus
Thu Sep 27, 2018 9:31 am
Forum: Clarifications on Project Euler Problems
Topic: Problem 637
Replies: 3
Views: 950

Re: Problem 637

Correct sequence, should looks like:

Code: Select all

 
99999=>
1. 9999+9=10008=>
  2. 1+8 => 9
and f(99999,10)=2