I am not terribly familiar with Python, but am currently authoring an integer
sequence for www.oeis.org and was wondering if anyone in the community could
help me with authoring a Python program that outputs, "Composite numbers that
are one less than a composite number."
Thanks!
Musatov
--
htt
Thank you very much! Do you also know how I might slightly alter to composite
numbers that are one less than twice a composite number?
15 would be the first number
Since 8 is composite then
2*8=16
16 - 1=15 Is composite
--
https://mail.python.org/mailman/listinfo/python-list
Thanks, I think that is an interesting tactic. From there what might the
language look like to filter out the composites that are not one less than
twice another composite number?
--
https://mail.python.org/mailman/listinfo/python-list
DATA
15, 27, 35, 39, 49, 50, 51, 55, 63, 65, 69, 75, 77, 87, 91, 95, 99, 111, 115,
119, 123, 125, 129, 135, 143, 147, 153, 155, 159, 161, 169, 171, 175, 183, 185,
187, 189, 195, 203, 207, 209, 215, 219, 221
--
https://mail.python.org/mailman/listinfo/python-list
I'm sorry I did not correctly state the subset I was after:
"Composite numbers that are one less than twice a composite."
The output would begin:
DATA
15, 27, 35, 39, 49, 50, 51, 55, 63, 65, 69, 75, 77, 87, 91, 95, 99, 111, 115,
119, 123, 125, 129, 135, 143, 147, 153, 155, 159, 161, 169, 17
Yes, I will try it! Thank you kindly.
--
https://mail.python.org/mailman/listinfo/python-list
I am looking for a program able to output a set of integers meeting the
following requirement:
a(n) is the minimum k > 0 such that n*2^k - 3 is prime, or 0 if no such k exists
Could anyone get me started? (I am an amateur)
Thanks,
Musatov
--
https://mail.python.org/mailman/listinfo/python-lis
On Saturday, August 25, 2018 at 9:46:21 AM UTC-5, Richard Damon wrote:
> On 8/25/18 10:27 AM, Dennis Lee Bieber wrote:
> > On Sat, 25 Aug 2018 03:56:28 + (UTC), Steven D'Aprano
> > declaimed the following:
> >
> >> On Fri, 24 Aug 2018 14:40:00 -0700, tomus
