Talk:Primes whose first and last number is 3: Difference between revisions

From Rosetta Code
Content added Content deleted
m (add some comments.)
m (added some comments.)
Line 5: Line 5:
and a base converter like [[Non-decimal_radices/Convert]]<BR> 05:41, 24 July 2021 (UTC)
and a base converter like [[Non-decimal_radices/Convert]]<BR> 05:41, 24 July 2021 (UTC)


: I did add a stretch goal to this (draft) task, &nbsp; but only for the upper limit. &nbsp; I thought the adding of which leading and trailing decimal digit &nbsp; (other than using the specific digit &nbsp; '''3''') &nbsp; would/might invalidate those existing computer programming solutions what made special tests when using a customized range start, &nbsp; and/or a special increment. &nbsp; For instance, one option could/would be to search for primes from &nbsp; 3 &nbsp; to &nbsp; 4000-1 &nbsp; by &nbsp; 10. &nbsp; &nbsp; &nbsp; Another customization would be to also check for the leading digit and incorporate special handling so as to bump the range to the next &nbsp; &nbsp; 10, &nbsp; 100, &nbsp; 1000, ... &nbsp; &nbsp; &nbsp; range of integers. &nbsp; &nbsp; -- [[User:Gerard Schildberger|Gerard Schildberger]] ([[User talk:Gerard Schildberger|talk]])
: I did add a stretch goal to this (draft) task, &nbsp; but only for the upper limit. &nbsp; I thought the adding of which leading and trailing decimal digit &nbsp; (other than using the specific digit &nbsp; '''3''') &nbsp; would/might invalidate those existing computer programming solutions what made special tests when using a customized range start, &nbsp; and/or a special increment. &nbsp; Certainly, &nbsp; the adding of any &nbsp; radix (base)&nbsp; to be used would add complexity to the requirements and invalidate all existing programming entries. &nbsp; &nbsp; For instance, one option could/would be to search for primes from &nbsp; 3 &nbsp; to &nbsp; 4000-1 &nbsp; by &nbsp; 10. &nbsp; &nbsp; &nbsp; Another customization would be to also check for the leading digit and incorporate special handling so as to bump the range to the next &nbsp; &nbsp; 10, &nbsp; 100, &nbsp; 1000, ... &nbsp; &nbsp; &nbsp; range of integers. &nbsp; &nbsp; -- [[User:Gerard Schildberger|Gerard Schildberger]] ([[User talk:Gerard Schildberger|talk]])

Revision as of 13:09, 24 July 2021

Why don't extend the task. Primes in base X ending and starting in digit Y

So one needs only put together the already best known:
getting primes Sieve_of_Eratosthenes or Primality_by_trial_division
and a base converter like Non-decimal_radices/Convert
05:41, 24 July 2021 (UTC)

I did add a stretch goal to this (draft) task,   but only for the upper limit.   I thought the adding of which leading and trailing decimal digit   (other than using the specific digit   3)   would/might invalidate those existing computer programming solutions what made special tests when using a customized range start,   and/or a special increment.   Certainly,   the adding of any   radix (base)  to be used would add complexity to the requirements and invalidate all existing programming entries.     For instance, one option could/would be to search for primes from   3   to   4000-1   by   10.       Another customization would be to also check for the leading digit and incorporate special handling so as to bump the range to the next     10,   100,   1000, ...       range of integers.     -- Gerard Schildberger (talk)
Retrieved from "https://rosettacode.org/wiki/Talk:Primes_whose_first_and_last_number_is_3?oldid=313905"