Problem 55695. AZPC Oddly Triangular: N=8/9 Digits 3/7/9 Part 2 of 5

Created by Richard Zapor

Solve Later

{"parts":[{"partUri":"/matlab/document.xml","contentType":"application/vnd.mathworks.matlab.code.document+xml","content":"<?xml version=\"1.0\" encoding=\"UTF-8\"?><w:document xmlns:w=\"http://schemas.openxmlformats.org/wordprocessingml/2006/main\"><w:body><w:p><w:pPr><w:pStyle w:val=\"text\"/><w:jc w:val=\"left\"/></w:pPr><w:hyperlink w:docLocation=\"\"><w:r><w:t>AZPC</w:t></w:r></w:hyperlink><w:r><w:t> created the </w:t></w:r><w:hyperlink w:docLocation=\"\"><w:r><w:t>Oddly Triangular</w:t></w:r></w:hyperlink><w:r><w:t> 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]</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/><w:jc w:val=\"left\"/></w:pPr><w:r><w:t>This is step two of the steps and processing types to find Rokicki's result.</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/><w:jc w:val=\"left\"/></w:pPr><w:r><w:t>This challenge is to find a solution subset with lengths 8 and 9 that only use the digits 3/7/9 in M. The sum(1:M(i)) may only use odd digits. Normal double variables will not suffice for the N=9 solution as the eps is 8 for the sum. There are 8 length 8 solutions if all odd digits are allowed. Rokicki focused on patterns using only 3/7/9 to reduce his search space.</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/><w:jc w:val=\"left\"/></w:pPr><w:r><w:t>Usage of matlab java math can be seen in the Test Suite. A function zcombvec is given in the function template to facilitate creation of all vectors that only use the 3/7/9 digits. Usage of zcombvec is not required.</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/><w:jc w:val=\"left\"/></w:pPr><w:r><w:t>M=OddlyTri_379(N,Q) where N=digit length, Q=number of solutions, M is a double vector of the Q values.</w:t></w:r></w:p></w:body></w:document>","relationship":null}],"relationships":[{"relationshipType":"http://schemas.mathworks.com/matlab/code/2013/relationships/document","target":"/matlab/document.xml","relationshipId":"rId1"}]}

<div style = "text-align: start; line-height: 20.4333px; min-height: 0px; white-space: normal; color: rgb(0, 0, 0); font-family: Menlo, Monaco, Consolas, monospace; font-style: normal; font-size: 14px; font-weight: 400; text-decoration: rgb(0, 0, 0); white-space: normal; "><div style="block-size: 246px; display: block; min-width: 0px; padding-block-start: 0px; padding-top: 0px; perspective-origin: 407px 123px; transform-origin: 407px 123px; vertical-align: baseline; "><div style="block-size: 63px; font-family: Helvetica, Arial, sans-serif; line-height: 21px; margin-block-end: 9px; margin-block-start: 2px; margin-bottom: 9px; margin-inline-end: 10px; margin-inline-start: 4px; margin-left: 4px; margin-right: 10px; margin-top: 2px; perspective-origin: 384px 31.5px; text-align: left; transform-origin: 384px 31.5px; white-space: pre-wrap; margin-left: 4px; margin-top: 2px; margin-bottom: 9px; margin-right: 10px; "><a target='_blank' href = "/#null"><span style=""><span style="">AZPC</span></span></a><span style="block-size: auto; display: inline; margin-block-end: 0px; margin-block-start: 0px; margin-bottom: 0px; margin-inline-end: 0px; margin-inline-start: 0px; margin-left: 0px; margin-right: 0px; margin-top: 0px; perspective-origin: 40px 8px; transform-origin: 40px 8px; unicode-bidi: normal; "><span style=""> created the </span></span><a target='_blank' href = "/#null"><span style=""><span style="">Oddly Triangular</span></span></a><span style="block-size: auto; display: inline; margin-block-end: 0px; margin-block-start: 0px; margin-bottom: 0px; margin-inline-end: 0px; margin-inline-start: 0px; margin-left: 0px; margin-right: 0px; margin-top: 0px; perspective-origin: 270.5px 8px; transform-origin: 270.5px 8px; unicode-bidi: normal; "><span style=""> 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]</span></span></div><div style="block-size: 21px; font-family: Helvetica, Arial, sans-serif; line-height: 21px; margin-block-end: 9px; margin-block-start: 2px; margin-bottom: 9px; margin-inline-end: 10px; margin-inline-start: 4px; margin-left: 4px; margin-right: 10px; margin-top: 2px; perspective-origin: 384px 10.5px; text-align: left; transform-origin: 384px 10.5px; white-space: pre-wrap; margin-left: 4px; margin-top: 2px; margin-bottom: 9px; margin-right: 10px; "><span style="block-size: auto; display: inline; margin-block-end: 0px; margin-block-start: 0px; margin-bottom: 0px; margin-inline-end: 0px; margin-inline-start: 0px; margin-left: 0px; margin-right: 0px; margin-top: 0px; perspective-origin: 229.5px 8px; transform-origin: 229.5px 8px; unicode-bidi: normal; "><span style="">This is step two of the steps and processing types to find Rokicki's result.</span></span></div><div style="block-size: 63px; font-family: Helvetica, Arial, sans-serif; line-height: 21px; margin-block-end: 9px; margin-block-start: 2px; margin-bottom: 9px; margin-inline-end: 10px; margin-inline-start: 4px; margin-left: 4px; margin-right: 10px; margin-top: 2px; perspective-origin: 384px 31.5px; text-align: left; transform-origin: 384px 31.5px; white-space: pre-wrap; margin-left: 4px; margin-top: 2px; margin-bottom: 9px; margin-right: 10px; "><span style="block-size: auto; display: inline; margin-block-end: 0px; margin-block-start: 0px; margin-bottom: 0px; margin-inline-end: 0px; margin-inline-start: 0px; margin-left: 0px; margin-right: 0px; margin-top: 0px; perspective-origin: 372.5px 8px; transform-origin: 372.5px 8px; unicode-bidi: normal; "><span style="">This challenge is to find a solution subset with lengths 8 and 9 that only use the digits 3/7/9 in M. The sum(1:M(i)) may only use odd digits. Normal double variables will not suffice for the N=9 solution as the eps is 8 for the sum. There are 8 length 8 solutions if all odd digits are allowed. Rokicki focused on patterns using only 3/7/9 to reduce his search space.</span></span></div><div style="block-size: 42px; font-family: Helvetica, Arial, sans-serif; line-height: 21px; margin-block-end: 9px; margin-block-start: 2px; margin-bottom: 9px; margin-inline-end: 10px; margin-inline-start: 4px; margin-left: 4px; margin-right: 10px; margin-top: 2px; perspective-origin: 384px 21px; text-align: left; transform-origin: 384px 21px; white-space: pre-wrap; margin-left: 4px; margin-top: 2px; margin-bottom: 9px; margin-right: 10px; "><span style="block-size: auto; display: inline; margin-block-end: 0px; margin-block-start: 0px; margin-bottom: 0px; margin-inline-end: 0px; margin-inline-start: 0px; margin-left: 0px; margin-right: 0px; margin-top: 0px; perspective-origin: 384px 8px; transform-origin: 384px 8px; unicode-bidi: normal; "><span style="">Usage of matlab java math can be seen in the Test Suite. A function zcombvec is given in the function template to facilitate creation of all vectors that only use the 3/7/9 digits. Usage of zcombvec is not required.</span></span></div><div style="block-size: 21px; font-family: Helvetica, Arial, sans-serif; line-height: 21px; margin-block-end: 9px; margin-block-start: 2px; margin-bottom: 9px; margin-inline-end: 10px; margin-inline-start: 4px; margin-left: 4px; margin-right: 10px; margin-top: 2px; perspective-origin: 384px 10.5px; text-align: left; transform-origin: 384px 10.5px; white-space: pre-wrap; margin-left: 4px; margin-top: 2px; margin-bottom: 9px; margin-right: 10px; "><span style="block-size: auto; display: inline; margin-block-end: 0px; margin-block-start: 0px; margin-bottom: 0px; margin-inline-end: 0px; margin-inline-start: 0px; margin-left: 0px; margin-right: 0px; margin-top: 0px; perspective-origin: 330px 8px; transform-origin: 330px 8px; unicode-bidi: normal; "><span style="">M=OddlyTri_379(N,Q) where N=digit length, Q=number of solutions, M is a double vector of the Q values.</span></span></div></div></div>

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 is step two of the steps and processing types to find Rokicki's result.
This challenge is to find a solution subset with lengths 8 and 9 that only use the digits 3/7/9 in M. The sum(1:M(i)) may only use odd digits. Normal double variables will not suffice for the N=9 solution as the eps is 8 for the sum. There are 8 length 8 solutions if all odd digits are allowed. Rokicki focused on patterns using only 3/7/9 to reduce his search space.
Usage of matlab java math can be seen in the Test Suite. A function zcombvec is given in the function template to facilitate creation of all vectors that only use the 3/7/9 digits. Usage of zcombvec is not required.
M=OddlyTri_379(N,Q) where N=digit length, Q=number of solutions, M is a double vector of the Q values.

Solve

Solution Stats

6 Solutions
5 Solvers

Last Solution submitted on Sep 25, 2022

Last 200 Solutions

Solution Comments

Show comments

Problem Recent Solvers5

Problem Tags

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!

Problem 55695. AZPC Oddly Triangular: N=8/9 Digits 3/7/9 Part 2 of 5

Solution Stats

Last 200 Solutions

Solution Comments

Problem Recent Solvers5

Suggested Problems

More from this Author293

Problem Tags

Community Treasure Hunt

Problem 55695. AZPC Oddly Triangular: N=8/9 Digits 3/7/9 Part 2 of 5

Solution Stats

Last 200 Solutions

Solution Comments

Problem Recent Solvers5

Suggested Problems

More from this Author293

Problem Tags

Community Treasure Hunt

Players