What is the quickest way to find all whole or near-whole numbers solutions on any number-line of S size? Announcing the arrival of Valued Associate #679: Cesar Manara Planned maintenance scheduled April 17/18, 2019 at 00:00UTC (8:00pm US/Eastern)Confusion related to the definition of NP problemsA computer's memory is finite, so how can there be languages more powerful than regular?Kolmogorov complexity, no description mechanism can improve on additively optimal/universal one infinitely oftenHow we decide for a given context free grammar generate an infinite number of strings?How many possible phone words exist for a phone number of length N when also counting words less than length N within that phone number?A communication complexity problem for finding near matchesA practical algorithm for finding distances of a set of strings?Attempted algorithm to find which shortest permutation of a string out of “hard.”Finding the numerical listed string to the center algorithm.Closest string attempted algorithm.
Can I cast Passwall to drop an enemy into a 20-foot pit?
Sci-Fi book where patients in a coma ward all live in a subconscious world linked together
Coloring maths inside a tcolorbox
When were vectors invented?
Why aren't air breathing engines used as small first stages
What exactly is a "Meth" in Altered Carbon?
Naming the result of a source block
Denied boarding although I have proper visa and documentation. To whom should I make a complaint?
Check which numbers satisfy the condition [A*B*C = A! + B! + C!]
Why is my conclusion inconsistent with the van't Hoff equation?
Single word antonym of "flightless"
How widely used is the term Treppenwitz? Is it something that most Germans know?
Identifying polygons that intersect with another layer using QGIS?
When do you get frequent flier miles - when you buy, or when you fly?
How to find out what spells would be useless to a blind NPC spellcaster?
Error "illegal generic type for instanceof" when using local classes
How to call a function with default parameter through a pointer to function that is the return of another function?
What does the "x" in "x86" represent?
Should I discuss the type of campaign with my players?
Using audio cues to encourage good posture
Why do people hide their license plates in the EU?
Withdrew £2800, but only £2000 shows as withdrawn on online banking; what are my obligations?
Why didn't this character "real die" when they blew their stack out in Altered Carbon?
What is Arya's weapon design?
What is the quickest way to find all whole or near-whole numbers solutions on any number-line of S size?
Announcing the arrival of Valued Associate #679: Cesar Manara
Planned maintenance scheduled April 17/18, 2019 at 00:00UTC (8:00pm US/Eastern)Confusion related to the definition of NP problemsA computer's memory is finite, so how can there be languages more powerful than regular?Kolmogorov complexity, no description mechanism can improve on additively optimal/universal one infinitely oftenHow we decide for a given context free grammar generate an infinite number of strings?How many possible phone words exist for a phone number of length N when also counting words less than length N within that phone number?A communication complexity problem for finding near matchesA practical algorithm for finding distances of a set of strings?Attempted algorithm to find which shortest permutation of a string out of “hard.”Finding the numerical listed string to the center algorithm.Closest string attempted algorithm.
$begingroup$
z = X(d^d+L)
S=Z/D is the number line's length
L=length of string
X=how many strings
d=hamming distance
S / RT = custom choice for 1st farthest string(eg. enter 1) and 2nd farthest string (eg. 2 for 2nd farthest, etc)
The script is simple.
1 INPUT "LENGTH OF STRING";L
2 INPUT "X FOR HOW MANY";X
3 INPUT "D FOR HAMMING DISTANCE";D
4 Z = X*(d^d+L)
5 S = Z / D
6 INPUT "ENTER # FOR NEXT STRING";RT
7 PRINT"YOUR CLOSEST STRING"RT, S / RT
8 INPUT "WOULD YOU LIKE TO GO BACK FOR MORE STRING?";M
9 IF M=1 THEN GOTO 6 ELSE GOTO 10
10 PRINT"GAME OVER"
You take the data output if its a whole or near whole number and write it on a paper number line. I have a picture at the end of the question to prevent confusion.
Rules of Game.
Rounds are based on length of string. Round 2 is 2 character strings. Assuming d is fixed or increases
Never go over the line's number limit.
(eg. never go over 30!)
The game has unlimited rounds and data is recorded written down on a chart of strings that are numerically listed
Points gathered up and winner is selected.
The objective of the game is to keep playing until its to hard and just quit.
All strings are alphabetically organized. You try to find all the strings that are listed by finding a whole or near whole coefficient.
You enter 2 then 3 and so on to find the 1st farthest string and so on within 30 and so on strings permutated. Each round gets harder and harder as the length of the number line gets bigger. So its hard to find more strings.
The purpose of the formula is based on a script that I written. The game is known as "Numberline" and the idea is to strike all the strings and show arithmetic work for human to understand.
The game gets exponentially more difficult as each number line grows in length with each new round.
You place all whole coefficients for S on a number line. The more whole numbers you find by dividing the more the number line gets filled up. All strings are alphabetically organized. So do not mistake this as the closest string problem.
You place all whole coefficients for S on a number line
(The reason being that you might not get a string if you have a
non-whole number) The graph below shows to the lower right that when
you enter 1 you get the first farthest string and enter 2 and so on.
Integers that are near wholes are okay.)
To get an idea here's a a list of permuated strings. The goal of the game is to find all numerically listed strings that have whole or near whole S and mark them on the number line paper.
01 aa
02 ab
03 ac
04 ad
05 ae
06 af
etc ..... ag, ah, & az...
Shortened string with whole number list out of S .
15 ao - 15th letter o S/RT = 2
10 aj - 10th letter j S/RT = 3
03 ac - 3rd letter c S/RT = 10
Overall, what is the quickest way to find all whole or near-whole numbers solutions on any number-line of S size?
computational-complexity np-complete
asked Mar 26 at 17:28
Travis WellsTravis Wells
196
$endgroup$
|
show 6 more comments
$begingroup$
z = X(d^d+L)
S=Z/D is the number line's length
L=length of string
X=how many strings
d=hamming distance
S / RT = custom choice for 1st farthest string(eg. enter 1) and 2nd farthest string (eg. 2 for 2nd farthest, etc)
The script is simple.
1 INPUT "LENGTH OF STRING";L
2 INPUT "X FOR HOW MANY";X
3 INPUT "D FOR HAMMING DISTANCE";D
4 Z = X*(d^d+L)
5 S = Z / D
6 INPUT "ENTER # FOR NEXT STRING";RT
7 PRINT"YOUR CLOSEST STRING"RT, S / RT
8 INPUT "WOULD YOU LIKE TO GO BACK FOR MORE STRING?";M
9 IF M=1 THEN GOTO 6 ELSE GOTO 10
10 PRINT"GAME OVER"
You take the data output if its a whole or near whole number and write it on a paper number line. I have a picture at the end of the question to prevent confusion.
Rules of Game.
Rounds are based on length of string. Round 2 is 2 character strings. Assuming d is fixed or increases
Never go over the line's number limit.
(eg. never go over 30!)
The game has unlimited rounds and data is recorded written down on a chart of strings that are numerically listed
Points gathered up and winner is selected.
The objective of the game is to keep playing until its to hard and just quit.
All strings are alphabetically organized. You try to find all the strings that are listed by finding a whole or near whole coefficient.
You enter 2 then 3 and so on to find the 1st farthest string and so on within 30 and so on strings permutated. Each round gets harder and harder as the length of the number line gets bigger. So its hard to find more strings.
The purpose of the formula is based on a script that I written. The game is known as "Numberline" and the idea is to strike all the strings and show arithmetic work for human to understand.
The game gets exponentially more difficult as each number line grows in length with each new round.
You place all whole coefficients for S on a number line. The more whole numbers you find by dividing the more the number line gets filled up. All strings are alphabetically organized. So do not mistake this as the closest string problem.
You place all whole coefficients for S on a number line
(The reason being that you might not get a string if you have a
non-whole number) The graph below shows to the lower right that when
you enter 1 you get the first farthest string and enter 2 and so on.
Integers that are near wholes are okay.)
To get an idea here's a a list of permuated strings. The goal of the game is to find all numerically listed strings that have whole or near whole S and mark them on the number line paper.
01 aa
02 ab
03 ac
04 ad
05 ae
06 af
etc ..... ag, ah, & az...
Shortened string with whole number list out of S .
15 ao - 15th letter o S/RT = 2
10 aj - 10th letter j S/RT = 3
03 ac - 3rd letter c S/RT = 10
Overall, what is the quickest way to find all whole or near-whole numbers solutions on any number-line of S size?
computational-complexity np-complete
asked Mar 26 at 17:28
Travis WellsTravis Wells
196
$endgroup$
$begingroup$
Hi, I have a couple suggestions to help make this question more clear. First, can you can you define what exactly you mean by "near-whole number"? Does the values in the number line correspond to Hamming weights, or are they indices from a list? Second, when you say solutions, are you referring to strings? Third, can you work through a simpler example?
$endgroup$
– Alexander Gruber♦
Mar 26 at 22:56
$begingroup$
Once I understand how your game works, I can help you reword this question to be more parsable by others. It sounds interesting but I'm not quite sure what you're looking for yet.
$endgroup$
– Alexander Gruber♦
Mar 26 at 22:58
$begingroup$
@AlexanderGruber The closest thing might be trying a prime factorization calculator. However, I don't know how to implement an algorithm that accepts a single input. If I find the prime factors it would help find the composite numbers and then the line is completed. Although, implementing a one time input would defeat the purpose of the game. Making it easy. calculatorsoup.com/calculators/math/prime-factors.php
$endgroup$
– Travis Wells
Mar 26 at 23:19
$begingroup$
@AlexanderGruber "near-whole numbers" are returned data by the script that is 9.9, 1.8, 2.9. 9.9 would be considered a 10 and 1.8 a 2 and 2.9 a 3
$endgroup$
– Travis Wells
Mar 26 at 23:22
$begingroup$
@AlexanderGruber The solutions is being able to manually write the strings based on their line # from the list on the line. I can then manipulate those composite numbers out of the listed strings with some command. Then completing the line.
$endgroup$
– Travis Wells
Mar 26 at 23:31
|
show 6 more comments
$begingroup$
z = X(d^d+L)
S=Z/D is the number line's length
L=length of string
X=how many strings
d=hamming distance
S / RT = custom choice for 1st farthest string(eg. enter 1) and 2nd farthest string (eg. 2 for 2nd farthest, etc)
The script is simple.
1 INPUT "LENGTH OF STRING";L
2 INPUT "X FOR HOW MANY";X
3 INPUT "D FOR HAMMING DISTANCE";D
4 Z = X*(d^d+L)
5 S = Z / D
6 INPUT "ENTER # FOR NEXT STRING";RT
7 PRINT"YOUR CLOSEST STRING"RT, S / RT
8 INPUT "WOULD YOU LIKE TO GO BACK FOR MORE STRING?";M
9 IF M=1 THEN GOTO 6 ELSE GOTO 10
10 PRINT"GAME OVER"
You take the data output if its a whole or near whole number and write it on a paper number line. I have a picture at the end of the question to prevent confusion.
Rules of Game.
Rounds are based on length of string. Round 2 is 2 character strings. Assuming d is fixed or increases
Never go over the line's number limit.
(eg. never go over 30!)
The game has unlimited rounds and data is recorded written down on a chart of strings that are numerically listed
Points gathered up and winner is selected.
The objective of the game is to keep playing until its to hard and just quit.
All strings are alphabetically organized. You try to find all the strings that are listed by finding a whole or near whole coefficient.
You enter 2 then 3 and so on to find the 1st farthest string and so on within 30 and so on strings permutated. Each round gets harder and harder as the length of the number line gets bigger. So its hard to find more strings.
The purpose of the formula is based on a script that I written. The game is known as "Numberline" and the idea is to strike all the strings and show arithmetic work for human to understand.
The game gets exponentially more difficult as each number line grows in length with each new round.
You place all whole coefficients for S on a number line. The more whole numbers you find by dividing the more the number line gets filled up. All strings are alphabetically organized. So do not mistake this as the closest string problem.
You place all whole coefficients for S on a number line
(The reason being that you might not get a string if you have a
non-whole number) The graph below shows to the lower right that when
you enter 1 you get the first farthest string and enter 2 and so on.
Integers that are near wholes are okay.)
To get an idea here's a a list of permuated strings. The goal of the game is to find all numerically listed strings that have whole or near whole S and mark them on the number line paper.
01 aa
02 ab
03 ac
04 ad
05 ae
06 af
etc ..... ag, ah, & az...
Shortened string with whole number list out of S .
15 ao - 15th letter o S/RT = 2
10 aj - 10th letter j S/RT = 3
03 ac - 3rd letter c S/RT = 10
Overall, what is the quickest way to find all whole or near-whole numbers solutions on any number-line of S size?
computational-complexity np-complete
asked Mar 26 at 17:28
Travis WellsTravis Wells
196
$endgroup$
z = X(d^d+L)
S=Z/D is the number line's length
L=length of string
X=how many strings
d=hamming distance
S / RT = custom choice for 1st farthest string(eg. enter 1) and 2nd farthest string (eg. 2 for 2nd farthest, etc)
The script is simple.
1 INPUT "LENGTH OF STRING";L
2 INPUT "X FOR HOW MANY";X
3 INPUT "D FOR HAMMING DISTANCE";D
4 Z = X*(d^d+L)
5 S = Z / D
6 INPUT "ENTER # FOR NEXT STRING";RT
7 PRINT"YOUR CLOSEST STRING"RT, S / RT
8 INPUT "WOULD YOU LIKE TO GO BACK FOR MORE STRING?";M
9 IF M=1 THEN GOTO 6 ELSE GOTO 10
10 PRINT"GAME OVER"
You take the data output if its a whole or near whole number and write it on a paper number line. I have a picture at the end of the question to prevent confusion.
Rules of Game.
Rounds are based on length of string. Round 2 is 2 character strings. Assuming d is fixed or increases
Never go over the line's number limit.
(eg. never go over 30!)
The game has unlimited rounds and data is recorded written down on a chart of strings that are numerically listed
Points gathered up and winner is selected.
The objective of the game is to keep playing until its to hard and just quit.
All strings are alphabetically organized. You try to find all the strings that are listed by finding a whole or near whole coefficient.
You enter 2 then 3 and so on to find the 1st farthest string and so on within 30 and so on strings permutated. Each round gets harder and harder as the length of the number line gets bigger. So its hard to find more strings.
The purpose of the formula is based on a script that I written. The game is known as "Numberline" and the idea is to strike all the strings and show arithmetic work for human to understand.
The game gets exponentially more difficult as each number line grows in length with each new round.
You place all whole coefficients for S on a number line. The more whole numbers you find by dividing the more the number line gets filled up. All strings are alphabetically organized. So do not mistake this as the closest string problem.
You place all whole coefficients for S on a number line
(The reason being that you might not get a string if you have a
non-whole number) The graph below shows to the lower right that when
you enter 1 you get the first farthest string and enter 2 and so on.
Integers that are near wholes are okay.)
To get an idea here's a a list of permuated strings. The goal of the game is to find all numerically listed strings that have whole or near whole S and mark them on the number line paper.
01 aa
02 ab
03 ac
04 ad
05 ae
06 af
etc ..... ag, ah, & az...
Shortened string with whole number list out of S .
15 ao - 15th letter o S/RT = 2
10 aj - 10th letter j S/RT = 3
03 ac - 3rd letter c S/RT = 10
Overall, what is the quickest way to find all whole or near-whole numbers solutions on any number-line of S size?
computational-complexity np-complete
computational-complexity np-complete
asked Mar 26 at 17:28
Travis WellsTravis Wells
196
asked Mar 26 at 17:28
Travis WellsTravis Wells
196
edited Mar 26 at 23:41
Travis Wells
asked Mar 26 at 17:28
Travis WellsTravis Wells
196
asked Mar 26 at 17:28
Travis WellsTravis Wells
196
asked Mar 26 at 17:28
Travis WellsTravis Wells
196
196
$begingroup$
Hi, I have a couple suggestions to help make this question more clear. First, can you can you define what exactly you mean by "near-whole number"? Does the values in the number line correspond to Hamming weights, or are they indices from a list? Second, when you say solutions, are you referring to strings? Third, can you work through a simpler example?
$endgroup$
– Alexander Gruber♦
Mar 26 at 22:56
$begingroup$
Once I understand how your game works, I can help you reword this question to be more parsable by others. It sounds interesting but I'm not quite sure what you're looking for yet.
$endgroup$
– Alexander Gruber♦
Mar 26 at 22:58
$begingroup$
@AlexanderGruber The closest thing might be trying a prime factorization calculator. However, I don't know how to implement an algorithm that accepts a single input. If I find the prime factors it would help find the composite numbers and then the line is completed. Although, implementing a one time input would defeat the purpose of the game. Making it easy. calculatorsoup.com/calculators/math/prime-factors.php
$endgroup$
– Travis Wells
Mar 26 at 23:19
$begingroup$
@AlexanderGruber "near-whole numbers" are returned data by the script that is 9.9, 1.8, 2.9. 9.9 would be considered a 10 and 1.8 a 2 and 2.9 a 3
$endgroup$
– Travis Wells
Mar 26 at 23:22
$begingroup$
@AlexanderGruber The solutions is being able to manually write the strings based on their line # from the list on the line. I can then manipulate those composite numbers out of the listed strings with some command. Then completing the line.
$endgroup$
– Travis Wells
Mar 26 at 23:31
|
show 6 more comments
$begingroup$
Hi, I have a couple suggestions to help make this question more clear. First, can you can you define what exactly you mean by "near-whole number"? Does the values in the number line correspond to Hamming weights, or are they indices from a list? Second, when you say solutions, are you referring to strings? Third, can you work through a simpler example?
$endgroup$
– Alexander Gruber♦
Mar 26 at 22:56
$begingroup$
Once I understand how your game works, I can help you reword this question to be more parsable by others. It sounds interesting but I'm not quite sure what you're looking for yet.
$endgroup$
– Alexander Gruber♦
Mar 26 at 22:58
$begingroup$
@AlexanderGruber The closest thing might be trying a prime factorization calculator. However, I don't know how to implement an algorithm that accepts a single input. If I find the prime factors it would help find the composite numbers and then the line is completed. Although, implementing a one time input would defeat the purpose of the game. Making it easy. calculatorsoup.com/calculators/math/prime-factors.php
$endgroup$
– Travis Wells
Mar 26 at 23:19
$begingroup$
@AlexanderGruber "near-whole numbers" are returned data by the script that is 9.9, 1.8, 2.9. 9.9 would be considered a 10 and 1.8 a 2 and 2.9 a 3
$endgroup$
– Travis Wells
Mar 26 at 23:22
$begingroup$
@AlexanderGruber The solutions is being able to manually write the strings based on their line # from the list on the line. I can then manipulate those composite numbers out of the listed strings with some command. Then completing the line.
$endgroup$
– Travis Wells
Mar 26 at 23:31
$begingroup$
Hi, I have a couple suggestions to help make this question more clear. First, can you can you define what exactly you mean by "near-whole number"? Does the values in the number line correspond to Hamming weights, or are they indices from a list? Second, when you say solutions, are you referring to strings? Third, can you work through a simpler example?
$endgroup$
– Alexander Gruber♦
Mar 26 at 22:56
$begingroup$
Hi, I have a couple suggestions to help make this question more clear. First, can you can you define what exactly you mean by "near-whole number"? Does the values in the number line correspond to Hamming weights, or are they indices from a list? Second, when you say solutions, are you referring to strings? Third, can you work through a simpler example?
$endgroup$
– Alexander Gruber♦
Mar 26 at 22:56
$begingroup$
Once I understand how your game works, I can help you reword this question to be more parsable by others. It sounds interesting but I'm not quite sure what you're looking for yet.
$endgroup$
– Alexander Gruber♦
Mar 26 at 22:58
$begingroup$
Once I understand how your game works, I can help you reword this question to be more parsable by others. It sounds interesting but I'm not quite sure what you're looking for yet.
$endgroup$
– Alexander Gruber♦
Mar 26 at 22:58
$begingroup$
@AlexanderGruber The closest thing might be trying a prime factorization calculator. However, I don't know how to implement an algorithm that accepts a single input. If I find the prime factors it would help find the composite numbers and then the line is completed. Although, implementing a one time input would defeat the purpose of the game. Making it easy. calculatorsoup.com/calculators/math/prime-factors.php
$endgroup$
– Travis Wells
Mar 26 at 23:19
$begingroup$
@AlexanderGruber The closest thing might be trying a prime factorization calculator. However, I don't know how to implement an algorithm that accepts a single input. If I find the prime factors it would help find the composite numbers and then the line is completed. Although, implementing a one time input would defeat the purpose of the game. Making it easy. calculatorsoup.com/calculators/math/prime-factors.php
$endgroup$
– Travis Wells
Mar 26 at 23:19
$begingroup$
@AlexanderGruber "near-whole numbers" are returned data by the script that is 9.9, 1.8, 2.9. 9.9 would be considered a 10 and 1.8 a 2 and 2.9 a 3
$endgroup$
– Travis Wells
Mar 26 at 23:22
$begingroup$
@AlexanderGruber "near-whole numbers" are returned data by the script that is 9.9, 1.8, 2.9. 9.9 would be considered a 10 and 1.8 a 2 and 2.9 a 3
$endgroup$
– Travis Wells
Mar 26 at 23:22
$begingroup$
@AlexanderGruber The solutions is being able to manually write the strings based on their line # from the list on the line. I can then manipulate those composite numbers out of the listed strings with some command. Then completing the line.
$endgroup$
– Travis Wells
Mar 26 at 23:31
$begingroup$
@AlexanderGruber The solutions is being able to manually write the strings based on their line # from the list on the line. I can then manipulate those composite numbers out of the listed strings with some command. Then completing the line.
$endgroup$
– Travis Wells
Mar 26 at 23:31
|
show 6 more comments
0
active
oldest
votes
Your Answer
StackExchange.ready(function()
var channelOptions =
tags: "".split(" "),
id: "69"
;
initTagRenderer("".split(" "), "".split(" "), channelOptions);
StackExchange.using("externalEditor", function()
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled)
StackExchange.using("snippets", function()
createEditor();
);
else
createEditor();
);
function createEditor()
StackExchange.prepareEditor(
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: true,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
bindNavPrevention: true,
postfix: "",
imageUploader:
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
,
noCode: true, onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
);
);
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3163503%2fwhat-is-the-quickest-way-to-find-all-whole-or-near-whole-numbers-solutions-on-an%23new-answer', 'question_page');
);
Post as a guest
Required, but never shown
0
active
oldest
votes
0
active
oldest
votes
active
oldest
votes
active
oldest
votes
Thanks for contributing an answer to Mathematics Stack Exchange!
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
Use MathJax to format equations. MathJax reference.
To learn more, see our tips on writing great answers.
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3163503%2fwhat-is-the-quickest-way-to-find-all-whole-or-near-whole-numbers-solutions-on-an%23new-answer', 'question_page');
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
$begingroup$
Hi, I have a couple suggestions to help make this question more clear. First, can you can you define what exactly you mean by "near-whole number"? Does the values in the number line correspond to Hamming weights, or are they indices from a list? Second, when you say solutions, are you referring to strings? Third, can you work through a simpler example?
$endgroup$
– Alexander Gruber♦
Mar 26 at 22:56
$begingroup$
Once I understand how your game works, I can help you reword this question to be more parsable by others. It sounds interesting but I'm not quite sure what you're looking for yet.
$endgroup$
– Alexander Gruber♦
Mar 26 at 22:58
$begingroup$
@AlexanderGruber The closest thing might be trying a prime factorization calculator. However, I don't know how to implement an algorithm that accepts a single input. If I find the prime factors it would help find the composite numbers and then the line is completed. Although, implementing a one time input would defeat the purpose of the game. Making it easy. calculatorsoup.com/calculators/math/prime-factors.php
$endgroup$
– Travis Wells
Mar 26 at 23:19
$begingroup$
@AlexanderGruber "near-whole numbers" are returned data by the script that is 9.9, 1.8, 2.9. 9.9 would be considered a 10 and 1.8 a 2 and 2.9 a 3
$endgroup$
– Travis Wells
Mar 26 at 23:22
$begingroup$
@AlexanderGruber The solutions is being able to manually write the strings based on their line # from the list on the line. I can then manipulate those composite numbers out of the listed strings with some command. Then completing the line.
$endgroup$
– Travis Wells
Mar 26 at 23:31