left-trunctable prime SCHEMEruby method for atom? in schemeScheme, stopping my recursionRotate a list to the left in Scheme/RacketUsing conditionals in SchemeScheme prime numbersIssues with conditionals in SchemeScheme getting error is not a functionWrite a stream of sexy prime pairs in SCHEMEScheme Function (DrRacket)Scheme: + is not a procedure?
What do you call something that goes against the spirit of the law, but is legal when interpreting the law to the letter?
When blogging recipes, how can I support both readers who want the narrative/journey and ones who want the printer-friendly recipe?
Need help identifying/translating a plaque in Tangier, Morocco
Is there a way to make member function NOT callable from constructor?
What do the Banks children have against barley water?
extract characters between two commas?
Is it legal to have the "// (c) 2019 John Smith" header in all files when there are hundreds of contributors?
What is the command to reset a PC without deleting any files
Re-submission of rejected manuscript without informing co-authors
Denied boarding due to overcrowding, Sparpreis ticket. What are my rights?
Is "plugging out" electronic devices an American expression?
How do I create uniquely male characters?
New order #4: World
Pristine Bit Checking
COUNT(*) or MAX(id) - which is faster?
Manga about a female worker who got dragged into another world together with this high school girl and she was just told she's not needed anymore
Can the Produce Flame cantrip be used to grapple, or as an unarmed strike, in the right circumstances?
Why is my log file so massive? 22gb. I am running log backups
aging parents with no investments
Was there ever an axiom rendered a theorem?
Unbreakable Formation vs. Cry of the Carnarium
Why do UK politicians seemingly ignore opinion polls on Brexit?
What does "enim et" mean?
What is it called when one voice type sings a 'solo'?
left-trunctable prime SCHEME
ruby method for atom? in schemeScheme, stopping my recursionRotate a list to the left in Scheme/RacketUsing conditionals in SchemeScheme prime numbersIssues with conditionals in SchemeScheme getting error is not a functionWrite a stream of sexy prime pairs in SCHEMEScheme Function (DrRacket)Scheme: + is not a procedure?
.everyoneloves__top-leaderboard:empty,.everyoneloves__mid-leaderboard:empty,.everyoneloves__bot-mid-leaderboard:empty height:90px;width:728px;box-sizing:border-box;
I am trying to define a variable in SCHEME that has 1 integer argument, and evaluates to #t if the inputted argument is a left-truncatable prime number, and false otherwise. An example of a left-truncatable prime number is 137, since 137, 37, and 7 are all prime. Thanks!
scheme
asked Mar 22 at 1:44
JacobJacob
1
add a comment |
I am trying to define a variable in SCHEME that has 1 integer argument, and evaluates to #t if the inputted argument is a left-truncatable prime number, and false otherwise. An example of a left-truncatable prime number is 137, since 137, 37, and 7 are all prime. Thanks!
scheme
asked Mar 22 at 1:44
JacobJacob
1
Start with writing a function that left-truncates a number. That is, if you give it137, it gives you37, and if you give it37, it gives you7. (This is probably the trickiest part.)
– molbdnilo
Mar 22 at 10:12
No; Thank you. I have never heard of a left truncatable prime. You might want to read How to ask though. While you post was informative it is off topic to post non questions. I do not tell people here that I'm in a bus looking out of the window and stuff and if people started making posts about stuff they did and not programming questions they have imagine the bigger size SO hard drives need to be and that actual programming related questions would be like finding whole numbers in the set of real numbers.
– Sylwester
Mar 23 at 22:44
add a comment |
I am trying to define a variable in SCHEME that has 1 integer argument, and evaluates to #t if the inputted argument is a left-truncatable prime number, and false otherwise. An example of a left-truncatable prime number is 137, since 137, 37, and 7 are all prime. Thanks!
scheme
asked Mar 22 at 1:44
JacobJacob
1
I am trying to define a variable in SCHEME that has 1 integer argument, and evaluates to #t if the inputted argument is a left-truncatable prime number, and false otherwise. An example of a left-truncatable prime number is 137, since 137, 37, and 7 are all prime. Thanks!
scheme
scheme
asked Mar 22 at 1:44
JacobJacob
1
asked Mar 22 at 1:44
JacobJacob
1
asked Mar 22 at 1:44
JacobJacob
1
asked Mar 22 at 1:44
JacobJacob
1
asked Mar 22 at 1:44
JacobJacob
1
1
Start with writing a function that left-truncates a number. That is, if you give it137, it gives you37, and if you give it37, it gives you7. (This is probably the trickiest part.)
– molbdnilo
Mar 22 at 10:12
No; Thank you. I have never heard of a left truncatable prime. You might want to read How to ask though. While you post was informative it is off topic to post non questions. I do not tell people here that I'm in a bus looking out of the window and stuff and if people started making posts about stuff they did and not programming questions they have imagine the bigger size SO hard drives need to be and that actual programming related questions would be like finding whole numbers in the set of real numbers.
– Sylwester
Mar 23 at 22:44
add a comment |
Start with writing a function that left-truncates a number. That is, if you give it137, it gives you37, and if you give it37, it gives you7. (This is probably the trickiest part.)
– molbdnilo
Mar 22 at 10:12
No; Thank you. I have never heard of a left truncatable prime. You might want to read How to ask though. While you post was informative it is off topic to post non questions. I do not tell people here that I'm in a bus looking out of the window and stuff and if people started making posts about stuff they did and not programming questions they have imagine the bigger size SO hard drives need to be and that actual programming related questions would be like finding whole numbers in the set of real numbers.
– Sylwester
Mar 23 at 22:44
Start with writing a function that left-truncates a number. That is, if you give it
137, it gives you 37, and if you give it 37, it gives you 7. (This is probably the trickiest part.)– molbdnilo
Mar 22 at 10:12
Start with writing a function that left-truncates a number. That is, if you give it
137, it gives you 37, and if you give it 37, it gives you 7. (This is probably the trickiest part.)– molbdnilo
Mar 22 at 10:12
No; Thank you. I have never heard of a left truncatable prime. You might want to read How to ask though. While you post was informative it is off topic to post non questions. I do not tell people here that I'm in a bus looking out of the window and stuff and if people started making posts about stuff they did and not programming questions they have imagine the bigger size SO hard drives need to be and that actual programming related questions would be like finding whole numbers in the set of real numbers.
– Sylwester
Mar 23 at 22:44
No; Thank you. I have never heard of a left truncatable prime. You might want to read How to ask though. While you post was informative it is off topic to post non questions. I do not tell people here that I'm in a bus looking out of the window and stuff and if people started making posts about stuff they did and not programming questions they have imagine the bigger size SO hard drives need to be and that actual programming related questions would be like finding whole numbers in the set of real numbers.
– Sylwester
Mar 23 at 22:44
add a comment |
0
active
oldest
votes
Your Answer
StackExchange.ifUsing("editor", function ()
StackExchange.using("externalEditor", function ()
StackExchange.using("snippets", function ()
StackExchange.snippets.init();
);
);
, "code-snippets");
StackExchange.ready(function()
var channelOptions =
tags: "".split(" "),
id: "1"
;
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
,
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%2fstackoverflow.com%2fquestions%2f55291711%2fleft-trunctable-prime-scheme%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 Stack Overflow!
- 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.
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%2fstackoverflow.com%2fquestions%2f55291711%2fleft-trunctable-prime-scheme%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
Start with writing a function that left-truncates a number. That is, if you give it
137, it gives you37, and if you give it37, it gives you7. (This is probably the trickiest part.)– molbdnilo
Mar 22 at 10:12
No; Thank you. I have never heard of a left truncatable prime. You might want to read How to ask though. While you post was informative it is off topic to post non questions. I do not tell people here that I'm in a bus looking out of the window and stuff and if people started making posts about stuff they did and not programming questions they have imagine the bigger size SO hard drives need to be and that actual programming related questions would be like finding whole numbers in the set of real numbers.
– Sylwester
Mar 23 at 22:44