Problem 55680. AZPC Oddly Triangular: Small N Part 1 of 5
AZPC created the Oddly Triangular contest on 9/7/22. The challenge is to find the longest sequence of N odd digits such that sum(1:value) is composed of only odd digits. The contest ended on 9/8/22 as Rokicki created a 3.6 million digit solution with the implication that an infinite length pattern had been determined. [N=2, 17, sum(1:17)=153]
This challenge sequence shall step thru the steps and processing types to find Rokicki's result.
This challenge is to find all solutions with lengths 1 thru 7.
M=OddlyTri_1(N,Q) where N=digit length, Q=number of solutions, M is a vector of the Q values.
Solution Stats
Solution Comments
Show commentsProblem Recent Solvers5
Suggested Problems
-
1453 Solvers
-
Number of 1s in a binary string
8170 Solvers
-
690 Solvers
-
Given a matrix, swap the 2nd & 3rd columns
1009 Solvers
-
interesting center of magic matrix
103 Solvers
More from this Author294
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!