[seqfan] Re: 2^k - prime(p) or prime(p) - 2^k ?

Charles Greathouse charles.greathouse at case.edu
Wed Apr 10 21:01:11 CEST 2013


I see, I was interpreting the sequence differently.

Charles Greathouse
Analyst/Programmer
Case Western Reserve University


On Wed, Apr 10, 2013 at 2:33 PM, <israel at math.ubc.ca> wrote:

> It seems to me that the criterion is that p + ithprime(p) is a power of 2.
> Thus 503 is prime, the 503'th prime is 3593, and 503 + 3593 = 2^12.
> No others past 503 in the first 10000 primes.
>
> Robert Israel
> University of British Columbia
>
>
> On Apr 10 2013, Charles Greathouse wrote:
>
>  Hello, SegFans, Primes p of the form 2^k - prime(p) for some k:  3, 5,
>>>
>> 503,...?
>>
>> How would you prove the absence of a term? And what about 11 = 16 - 5, 13
>> =
>> 16 - 3, 19 = 128 - 109, 23 = 64 - 41, 29 = 32 - 3, and so forth?
>>
>> Charles Greathouse
>> Analyst/Programmer
>> Case Western Reserve University
>>
>>
>> On Tue, Apr 9, 2013 at 5:21 AM, юрий герасимов <2stepan at rambler.ru>
>> wrote:
>>
>>
>>> Hello, SegFans, Primes p of the form 2^k - prime(p) for some k:  3, 5,
>>> 503,...? or Primes p of the form prime(p) - 2^k for some  k:  2, 3,...?
>>> Best regards, JSG.
>>>
>>> ______________________________****_________________
>>>
>>>
>>> Seqfan Mailing list - http://list.seqfan.eu/
>>>
>>>
>> ______________________________**_________________
>>
>> Seqfan Mailing list - http://list.seqfan.eu/
>>
>>
>>
> ______________________________**_________________
>
> Seqfan Mailing list - http://list.seqfan.eu/
>


More information about the SeqFan mailing list