Re: Generating a specific list of integers
On Saturday, August 25, 2018 at 12:07:14 PM UTC-5, Musatov wrote: > 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, tomusatov wrote: > > >> > > >>> 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) > > >> > > >> That's more a maths question than a programming question. Find out how > > >> to > > >> tackle it mathematically, and then we can code it. > > > I'd want more punctuation in that just to ensure I'm interpreting it > > > properly -- I'm presuming it is meant to be parsed as: > > > (n * (2 ^ k)) - 3 > > > > > > Suspect this needs to be attacked in the reverse direction -- generate > > > a list of primes, add 3, determine if it is a multiple of powers of two. > > > Though in that case, k = 1 would fit all since if it is a multiple 2^2 (4) > > > it would also be a multiple of 2^1 (2), for all greater powers of 2.. > > > > > > prime 5 > > > + 3 => 8 > > > log_2 8 => 3<<< integral k > > > 8 => 1 * (2 ^ 3) > > >2 * (2 ^ 2) > > > 4 * (2 ^ 1) > > > > > > n=4, k=1 > > > > > > OTOH, if it is supposed to be (n*2) ^ k, or even worse (n*2) ^ (k-3) > > > the solution becomes more difficult. > > > > > > > > I think the issue is given n, find k. > > > > a(1): 1*2-3=-1 no, 1*4-3=1 no, 1*8-3 - 5 YES, a(1) = 3 > > > > a(2) 2*2-3 = 1, no 2*4-3=5 YES a(2) = 2 > > > > a(3) 3*2-3 - 3 YES, a(3) = 1 > > > > and so on. > > > > One path to solution is to just count up the k values and test each > > result for being prime, except that will never return 0 to say no such k > > exists. That will require some higher level of math to detect (or an > > arbitrary cap on k, and we say we can say 0 if the only k is too big, > > but with big nums, that would be VERY large and take a very long time. > > > > -- > > Richard Damon > Here is a sample output: > 3, 2, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 2, 0, 1, 1, 0, 2, 1, 0, 1, 1, 0, 1, 2, > 0, 1, 2, 0, 1, 1, 0, 3, 1, 0, 1, 1, 0, 2, 1, 0, 1, 2, 0, 1, 1, 0, 2, 1, 0, 1, > 1, 0, 1, 1, 0, 1, 2, 0, 2, 1, 0, 3, 1, 0, 1, 2, 0, 1, 1, 0, 5, 2, 0, 1, 1, 0, > 2, 1, 0, 3, 1, 0, 1 -- https://mail.python.org/mailman/listinfo/python-list
Re: Generating a specific list of intsgers
On Saturday, August 25, 2018 at 1:52:17 PM UTC-5, Oscar Benjamin wrote: > On Sat, 25 Aug 2018 at 18:12, wrote: > > > > 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, tomusatov wrote: > > > >> > > > >>> 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) > > > >> > > > >> That's more a maths question than a programming question. Find out how > > > >> to > > > >> tackle it mathematically, and then we can code it. > > > > I'd want more punctuation in that just to ensure I'm interpreting it > > > > properly -- I'm presuming it is meant to be parsed as: > > > > (n * (2 ^ k)) - 3 > > > > > > > > Suspect this needs to be attacked in the reverse direction -- > > > > generate > > > > a list of primes, add 3, determine if it is a multiple of powers of two. > > > > Though in that case, k = 1 would fit all since if it is a multiple 2^2 > > > > (4) > > > > it would also be a multiple of 2^1 (2), for all greater powers of 2.. > > > > > > > > prime 5 > > > > + 3 => 8 > > > > log_2 8 => 3<<< integral k > > > > 8 => 1 * (2 ^ 3) > > > > 2 * (2 ^ 2) > > > > 4 * (2 ^ 1) > > > > > > > > n=4, k=1 > > > > > > > > OTOH, if it is supposed to be (n*2) ^ k, or even worse (n*2) ^ (k-3) > > > > the solution becomes more difficult. > > > > > > > > > > > I think the issue is given n, find k. > > > > > > a(1): 1*2-3=-1 no, 1*4-3=1 no, 1*8-3 - 5 YES, a(1) = 3 > > > > > > a(2) 2*2-3 = 1, no 2*4-3=5 YES a(2) = 2 > > > > > > a(3) 3*2-3 - 3 YES, a(3) = 1 > > > > > > and so on. > > > > > > One path to solution is to just count up the k values and test each > > > result for being prime, except that will never return 0 to say no such k > > > exists. That will require some higher level of math to detect (or an > > > arbitrary cap on k, and we say we can say 0 if the only k is too big, > > > but with big nums, that would be VERY large and take a very long time. > > > > > > -- > > > Richard Damon > > Here is a sample output: > > 3, 2, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 2, 0, 1, 1, 0, 2, 1, 0, 1, 1, 0, 1, > > 2, 0, 1, 2, 0, 1, 1, 0, 3, 1, 0, 1, 1, 0, 2, 1, 0, 1, 2, 0, 1, 1, 0, 2, 1, > > 0, 1, 1, 0, 1, 1, 0, 1, 2, 0, 2, 1, 0, 3, 1, 0, 1, 2, 0, 1, 1, 0, 5, 2, 0, > > 1, 1, 0, 2, 1, 0, 3, 1, 0, 1 > > Looks like it's zero for any multiple of 3 (apart from 3 itself). This > makes sense since if n is a equal to b*3 for some integer b then > n*2^k - 3 = b*3*2^k - 3 = (b*2^k - 1)*3 > which can only be prime if > b*2^k - 1 = 1 > which can only be true if b=1 (since k>0) implying that n=3. So for > any *other* multiple of 3 you must necessarily have a(n) = 0. > > The above means that you can handle all multiples of 3 but how do you > know that you won't hit an infinite loop when n is not a multiple of > 3? such n is 72726958979572419805016319140106929109473069209 (which is not divisible by 3) For that you need the converse of the above: > whenever n is not a multiple of 3 then a(n) != 0 > I haven't put much thought into it but that might be easy to prove. > > -- > Oscar -- https://mail.python.org/mailman/listinfo/python-list
Re: Generating a specific list of intsgers
On Saturday, August 25, 2018 at 2:18:09 PM UTC-5, Musatov wrote: > On Saturday, August 25, 2018 at 1:52:17 PM UTC-5, Oscar Benjamin wrote: > > On Sat, 25 Aug 2018 at 18:12, wrote: > > > > > > 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, tomusatov wrote: > > > > >> > > > > >>> 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) > > > > >> > > > > >> That's more a maths question than a programming question. Find out > > > > >> how to > > > > >> tackle it mathematically, and then we can code it. > > > > > I'd want more punctuation in that just to ensure I'm interpreting > > > > > it > > > > > properly -- I'm presuming it is meant to be parsed as: > > > > > (n * (2 ^ k)) - 3 > > > > > > > > > > Suspect this needs to be attacked in the reverse direction -- > > > > > generate > > > > > a list of primes, add 3, determine if it is a multiple of powers of > > > > > two. > > > > > Though in that case, k = 1 would fit all since if it is a multiple > > > > > 2^2 (4) > > > > > it would also be a multiple of 2^1 (2), for all greater powers of 2.. > > > > > > > > > > prime 5 > > > > > + 3 => 8 > > > > > log_2 8 => 3<<< integral k > > > > > 8 => 1 * (2 ^ 3) > > > > > 2 * (2 ^ 2) > > > > > 4 * (2 ^ 1) > > > > > > > > > > n=4, k=1 > > > > > > > > > > OTOH, if it is supposed to be (n*2) ^ k, or even worse (n*2) ^ > > > > > (k-3) > > > > > the solution becomes more difficult. > > > > > > > > > > > > > > I think the issue is given n, find k. > > > > > > > > a(1): 1*2-3=-1 no, 1*4-3=1 no, 1*8-3 - 5 YES, a(1) = 3 > > > > > > > > a(2) 2*2-3 = 1, no 2*4-3=5 YES a(2) = 2 > > > > > > > > a(3) 3*2-3 - 3 YES, a(3) = 1 > > > > > > > > and so on. > > > > > > > > One path to solution is to just count up the k values and test each > > > > result for being prime, except that will never return 0 to say no such k > > > > exists. That will require some higher level of math to detect (or an > > > > arbitrary cap on k, and we say we can say 0 if the only k is too big, > > > > but with big nums, that would be VERY large and take a very long time. > > > > > > > > -- > > > > Richard Damon > > > Here is a sample output: > > > 3, 2, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 2, 0, 1, 1, 0, 2, 1, 0, 1, 1, 0, > > > 1, 2, 0, 1, 2, 0, 1, 1, 0, 3, 1, 0, 1, 1, 0, 2, 1, 0, 1, 2, 0, 1, 1, 0, > > > 2, 1, 0, 1, 1, 0, 1, 1, 0, 1, 2, 0, 2, 1, 0, 3, 1, 0, 1, 2, 0, 1, 1, 0, > > > 5, 2, 0, 1, 1, 0, 2, 1, 0, 3, 1, 0, 1 > > > > Looks like it's zero for any multiple of 3 (apart from 3 itself). This > > makes sense since if n is a equal to b*3 for some integer b then > > n*2^k - 3 = b*3*2^k - 3 = (b*2^k - 1)*3 > > which can only be prime if > > b*2^k - 1 = 1 > > which can only be true if b=1 (since k>0) implying that n=3. So for > > any *other* multiple of 3 you must necessarily have a(n) = 0. > > > > The above means that you can handle all multiples of 3 but how do you > > know that you won't hit an infinite loop when n is not a multiple of > > 3? > > Rather, I should say one such n is 72726958979572419805016319140106929109473069209 (which is not divisible by 3) > For that you need the converse of the above: > > whenever n is not a multiple of 3 then a(n) != 0 > > I haven't put much thought into it but that might be easy to prove. > > > > -- > > Oscar -- https://mail.python.org/mailman/listinfo/python-list
Re: Generating a specific list of intsgers
On Friday, August 24, 2018 at 10:59:07 PM UTC-5, Steven D'Aprano wrote: > On Fri, 24 Aug 2018 14:40:00 -0700, tomusatov wrote: > > > 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) > > > That's more a maths question than a programming question. Find out how to > tackle it mathematically, and then we can code it. > > > > -- > Steven D'Aprano > "Ever since I learned about confirmation bias, I've been seeing > it everywhere." -- Jon Ronson Steven, let me know if this will suffice for the maths: a(n) is the minimum k > 0 such that n*2^k - 3 is prime, or 0 if no such k exists Other than multiples of 3, do there exist any numbers n > 3 such that a(n) = 0? The answer is yes. The situation is similar to that of Riesel or Sierpinski numbers. Every integer k is in at least one of the following residue classes: 2 (mod 3) 1 (mod 4) 4 (mod 5) 3 (mod 8) 4 (mod 9) 8 (mod 10) 6 (mod 12) 10 (mod 15) 7 (mod 16) 16 (mod 18) 12 (mod 20) 12 (mod 24) 16 (mod 25) 1 (mod 25) 0 (mod 30) 10 (mod 36) 27 (mod 36) 16 (mod 40) 1 (mod 45) 33 (mod 45) 15 (mod 48) 31 (mod 48) where 3,4,5,...,48 are the multiplicative orders of 2 modulo the primes 7, 5, 31, 17, 73, 11, 13, 151, 257, 19, 41, 241, 1801, 601, 331, 109, 37, 61681, 23311, 631, 673, 97 respectively. Now 7 | n*2^k-3 for k == 2 (mod 3) if n == 6 (mod 7), 5 | n*2^k-3 for k == 1 (mod 4) if n == 4 (mod 5), ..., 97 | n*2^k-3 for k == 31 (mod 48) if n == 75 (mod 97). Using the Chinese remainder theorem, we get infinitely many n for which all these congruences hold, and thus for which n*2^k-3 is always divisible by at least one of those 22 primes. One such n is 72726958979572419805016319140106929109473069209 (which is not divisible by 3). -- https://mail.python.org/mailman/listinfo/python-list
Re: Generating a specific list of intsgers
On Saturday, August 25, 2018 at 2:39:37 PM UTC-5, Musatov wrote: > On Friday, August 24, 2018 at 10:59:07 PM UTC-5, Steven D'Aprano wrote: > > On Fri, 24 Aug 2018 14:40:00 -0700, tomusatov wrote: > > > > > 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) > > > > > > That's more a maths question than a programming question. Find out how to > > tackle it mathematically, and then we can code it. > > > > > > > > -- > > Steven D'Aprano > > "Ever since I learned about confirmation bias, I've been seeing > > it everywhere." -- Jon Ronson > > Steven, let me know if this will suffice for the maths: > > a(n) is the minimum k > 0 such that n*2^k - 3 is prime, or 0 if no such k > exists > > Other than multiples of 3, do there exist any numbers n > 3 such that a(n) = > 0? > > The answer is yes. The situation is similar to that of Riesel or Sierpinski > numbers. > > Every integer k is in at least one of the following residue classes: > >2 (mod 3) > >1 (mod 4) > >4 (mod 5) > >3 (mod 8) > >4 (mod 9) > >8 (mod 10) > >6 (mod 12) > > 10 (mod 15) > >7 (mod 16) > > 16 (mod 18) > > 12 (mod 20) > > 12 (mod 24) > > 16 (mod 25) > >1 (mod 25) > >0 (mod 30) > > 10 (mod 36) > > 27 (mod 36) > > 16 (mod 40) > >1 (mod 45) > > 33 (mod 45) > > 15 (mod 48) > > 31 (mod 48) > > where 3,4,5,...,48 are the multiplicative orders of 2 modulo the primes 7, 5, > 31, 17, 73, 11, 13, 151, 257, 19, 41, 241, 1801, 601, 331, 109, 37, 61681, > 23311, 631, 673, 97 respectively. > > Now 7 | n*2^k-3 for k == 2 (mod 3) if n == 6 (mod 7), > > 5 | n*2^k-3 for k == 1 (mod 4) if n == 4 (mod 5), ..., > >97 | n*2^k-3 for k == 31 (mod 48) if n == 75 (mod 97). > > Using the Chinese remainder theorem, we get infinitely many n for which all > these congruences hold, and thus for which n*2^k-3 is always divisible by at > least one of those 22 primes. > > One such n is 72726958979572419805016319140106929109473069209 (which is not > divisible by 3). In the interest of full disclosure, I only asked the question and received the answer. -- https://mail.python.org/mailman/listinfo/python-list
Writing a program to illustrate a fractal
I have an integer sequence of a fractal nature and want to know if it is possible to write a program to illustrate it in a manner similar to the many animated Mandelbrot illustrations. The sequence is defined by: For 1 <= n <= 3, a(n) = n; thereafter, a(2n) = a(n) + a(n+1), a(2n-1) = a(n) + a(n-2). Output begins: 1, 2, 3, 5, 4, 8, 7, 9, 7, 12, 13, 15, 11, 16, 17, 16, 14, 19, 21, 25, 20, 28, 27, 26, 24, 27, 31, 33... -- https://mail.python.org/mailman/listinfo/python-list
Re: Writing a program to illustrate a fractal
On Sunday, August 26, 2018 at 12:49:16 PM UTC-5, Richard Damon wrote: > On 8/26/18 12:48 PM, Dennis Lee Bieber wrote: > >> The sequence is defined by: > >> > >> For 1 <= n <= 3, a(n) = n; thereafter, a(2n) = a(n) + a(n+1), a(2n-1) = > >> a(n) + a(n-2). > >> > > Confusing explanation -- do you really mean that for n>=4 you are > > returning TWO values? For a(4)..a(19) we have that: 2+3=5, 1+3=4, 3+5=8, 2+5=7, 5+4=9, 3+4=7, 4+8=12, 5+8=13, 8+7=15, 4+7=11, 7+9=16, 8+9=17, 9+7=16, 7+7=14, 7+12=19, 9+12=21. If so, it is not a strict function. I'd also write it > > as > > I think they intend that a(n) is defined for n being an integer (or > maybe just the Natural Numbers, since it isn't defined for values below 1) > > The two provided definitions provide the recursive definition for even > and odd values. > > I am not sure what 'fractal' property this sequence has that he wants to > display. I'm sorry, let me try to explain: Here is my output: 1, 2, 3, 5, 4, 8, 7, 9, 7, 12, 13, 15, 11, 16, 17, 16, 14, 19, 21, 25, 20, 28, 27, 26, 24, 27, 31, 33, 28, 33, 32, 30, 31, 33, 35, 40, 35, 46, 44, 45, 41, 48, 53, 55, 47, 53, 54, 50, 51, 51, 53, It is an OEIS sequence. I was told this image of the scatterplot emphasizes the 'fractal nature' of my sequence: https://oeis.org/A292575/a292575.png -- https://mail.python.org/mailman/listinfo/python-list
Re: Generating a specific list of intsgers
On Sunday, August 26, 2018 at 2:14:29 PM UTC-5, Oscar Benjamin wrote: > On Sat, 25 Aug 2018 at 20:27, Musatov wrote: > > > > On Saturday, August 25, 2018 at 2:18:09 PM UTC-5, Musatov wrote: > > > On Saturday, August 25, 2018 at 1:52:17 PM UTC-5, Oscar Benjamin wrote: > > > > > > > > > > > > > >> On Fri, 24 Aug 2018 14:40:00 -0700, tomusatov wrote: > > > > > > >> > > > > > > >>> 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) > > > > > > >> > > > > > > >> That's more a maths question than a programming question. Find > > > > > > >> out how to > > > > > > >> tackle it mathematically, and then we can code it. > > > > > > > > Looks like it's zero for any multiple of 3 (apart from 3 itself). This > > > > makes sense since if n is a equal to b*3 for some integer b then > > > > n*2^k - 3 = b*3*2^k - 3 = (b*2^k - 1)*3 > > > > which can only be prime if > > > > b*2^k - 1 = 1 > > > > which can only be true if b=1 (since k>0) implying that n=3. So for > > > > any *other* multiple of 3 you must necessarily have a(n) = 0. > > > > > > > > The above means that you can handle all multiples of 3 but how do you > > > > know that you won't hit an infinite loop when n is not a multiple of > > > > 3? > > > > Rather, I should say one such n is > > 72726958979572419805016319140106929109473069209 (which is not divisible by > > 3) > > Fair enough. So finding a(n) when a(n)!=0 is straight-forward (simply > loop through testing k=1,2...) but the issue is determining for any > given n whether a(n)=0 i.e. that there does not exist k such that > n*2^k-3 is prime. > > Perhaps if you explain how you know that >a(72726958979572419805016319140106929109473069209) = 0 > then that would suggest a way to code it. > > -- > Oscar Oscar, I simply asked someone and they provided me the number. I know they often use Maple, but I was interested in Python. He also said some of the n are prime by Dirichlet's theorem. One is 8236368172492875810638652252525796530412199592269. -- https://mail.python.org/mailman/listinfo/python-list
Re: Writing a program to illustrate a fractal
On Sunday, August 26, 2018 at 2:35:13 PM UTC-5, Richard Damon wrote: > On 8/26/18 1:58 PM, Musatov wrote: > > On Sunday, August 26, 2018 at 12:49:16 PM UTC-5, Richard Damon wrote: > >> On 8/26/18 12:48 PM, Dennis Lee Bieber wrote: > >>>> The sequence is defined by: > >>>> > >>>> For 1 <= n <= 3, a(n) = n; thereafter, a(2n) = a(n) + a(n+1), a(2n-1) = > >>>> a(n) + a(n-2). > > >>> I am not sure what 'fractal' property this sequence has that he > >>> wants to > >> display. > > I'm sorry, let me try to explain: > > > > Here is my output: > > 1, 2, 3, 5, 4, 8, 7, 9, 7, 12, 13, 15, 11, 16, 17, 16, 14, 19, 21, 25, 20, > > 28, 27, 26, 24, 27, 31, 33, 28, 33, 32, 30, 31, 33, 35, 40, 35, 46, 44, 45, > > 41, 48, 53, 55, 47, 53, 54, 50, 51, 51, 53, > > > > It is an OEIS sequence. > > > > I was told this image of the scatterplot emphasizes the 'fractal nature' of > > my sequence: > > > > https://oeis.org/A292575/a292575.png > > Something is wrong with that image compared to the sequence, as the > sequence is always positive, and in fact the lowest the sequence can get > to is always increasing (as it starts always positive, and each term is > the sum of two previous terms),while the graph is going negative. > > (actually going to the definition of the sequence, the plot isn't of > a(n) but a(n)-n, which can go negative) > > I normally think for fractals as a sequence of patterns of increasing > complexity, or a pattern looked at with increasing resolution revealing > the growth pattern. This sequence isn't quite like that, but I suppose > if you think of the sequence a(n) in the interval m <= n <= 2*m, and > then the interval 2*m <= n <= 4*m, that second interval is somewhat like > the first with some recursively added pattern (especially if you include > the -n in the sequence). > > That graph is probably the best way to show that pattern. > > One thing that might help, is to clean up the definition of a(n) to be > more directly computable, and maybe even include the subtraction of n. > > A rewriting of your rules would be: > > a(n) > > n=1,2,3: a(n) = n > > n>3, and even: a(n) = a(n/2) + a(n/2+1) > > n>3 and odd: a(n) = a((n+1)/2) + a(n-3)/2) > > If I have done my math right, this is the same sequence definition, but > always defining what a(n) is equal to. > > If we want to define the sequence b(n) = a(n) - n, we can transform the > above by substitution > > b(n) > > n=1,2,3: b(n) = 0 > > n>3 and even: b(n) = a(n/2)+a(n/2+1)-n > > = b(n/2)+b(n/2+1) + n/2 + n/2+1 -n > > = b(n/2) + b(n/2+1) + 1 > > n>3 and odd: b(n) = a((n+1)/2) + a((n-3)/2) - n > > = b((n+1)/2) + b((n-3)/2) + (n+1)/2 + (n-3)/2 -n > > = b((n+1)/2) + b((n-3)/2) -1 > > -- > Richard Damon Thank you, Richard. If anyone is interested further, even in writing a Python code to generate the sequence or further preparing of an animation I would be delighted. Musatov -- https://mail.python.org/mailman/listinfo/python-list
Re: Generating a specific list of intsgers
On Sunday, August 26, 2018 at 3:07:41 PM UTC-5, Oscar Benjamin wrote: > On Sun, 26 Aug 2018 at 20:32, Musatov wrote: > > > > On Sunday, August 26, 2018 at 2:14:29 PM UTC-5, Oscar Benjamin wrote: > > > > > > > > >> On Fri, 24 Aug 2018 14:40:00 -0700, tomusatov wrote: > > > > > > > > >> > > > > > > > > >>> 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) > > > > > > Fair enough. So finding a(n) when a(n)!=0 is straight-forward (simply > > > loop through testing k=1,2...) but the issue is determining for any > > > given n whether a(n)=0 i.e. that there does not exist k such that > > > n*2^k-3 is prime. > > > > > > Perhaps if you explain how you know that > > >a(72726958979572419805016319140106929109473069209) = 0 > > > then that would suggest a way to code it. > > > > > Oscar, I simply asked someone and they provided me the number. I know they > > often use Maple, but I was interested in Python. > > He also said some of the n are prime by Dirichlet's theorem. One is > > 8236368172492875810638652252525796530412199592269. > > If it is possible at all then it is certainly possible to do this in > Python but only for someone who knows the necessary maths. The purpose > of computers in these kinds of problems is that they are much faster > at number-crunching. You still need to know how (at least in > principle) you would do this by hand in order to program it in Python > or most likely anything else. > > I don't think anyone here knows the answer to the mathematical > question "how do I prove that a(n)=0 for some n?". If you knew the > answer to that question then I'm sure many people could help you write > code for it. > > Without that I think you need to go back to your mathematician friends > or do some more reading. > > Are you sure that the problem you have posed here is solvable (i.e. > that whether or not a(n)=0 is decidable for any n)? > > -- > Oscar My understanding is this: there are an infinite number of n's that are not multiples of three, and yet will always be divisible by at least one of 22 primes for all values of k. i.e. certain n values make the equation produce only composite numbers for all values of k. -- https://mail.python.org/mailman/listinfo/python-list
Re: Writing a program to illustrate a fractal
On Sunday, August 26, 2018 at 3:13:00 PM UTC-5, Oscar Benjamin wrote: > On Sun, 26 Aug 2018 at 20:52, Musatov wrote: > > > > Thank you, Richard. If anyone is interested further, even in writing a > > Python code to generate the sequence or further preparing of an animation I > > would be delighted. > > It would not take long to write code to plot your sequence if you > first cover the basics of Python. What have you tried so far? > > Have you read the python.org tutorial? Here's a page from there that > mentions the Fibonacci sequence incidentally: > https://docs.python.org/3/tutorial/modules.html > > For plotting I suggest matplotlib: > https://matplotlib.org/users/pyplot_tutorial.html > > -- > Oscar I have some learning to do, but if I get stuck I'll write back on this thread. -- https://mail.python.org/mailman/listinfo/python-list
Re: Generating a specific list of intsgers
On Sunday, August 26, 2018 at 3:21:08 PM UTC-5, Musatov wrote: > On Sunday, August 26, 2018 at 3:07:41 PM UTC-5, Oscar Benjamin wrote: > > On Sun, 26 Aug 2018 at 20:32, Musatov wrote: > > > > > > On Sunday, August 26, 2018 at 2:14:29 PM UTC-5, Oscar Benjamin wrote: > > > > > > > > > >> On Fri, 24 Aug 2018 14:40:00 -0700, tomusatov wrote: > > > > > > > > > >> > > > > > > > > > >>> 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) > > > > > > > > Fair enough. So finding a(n) when a(n)!=0 is straight-forward (simply > > > > loop through testing k=1,2...) but the issue is determining for any > > > > given n whether a(n)=0 i.e. that there does not exist k such that > > > > n*2^k-3 is prime. > > > > > > > > Perhaps if you explain how you know that > > > >a(72726958979572419805016319140106929109473069209) = 0 > > > > then that would suggest a way to code it. > > > > > > > Oscar, I simply asked someone and they provided me the number. I know > > > they often use Maple, but I was interested in Python. > > > He also said some of the n are prime by Dirichlet's theorem. One is > > > 8236368172492875810638652252525796530412199592269. > > > > If it is possible at all then it is certainly possible to do this in > > Python but only for someone who knows the necessary maths. The purpose > > of computers in these kinds of problems is that they are much faster > > at number-crunching. You still need to know how (at least in > > principle) you would do this by hand in order to program it in Python > > or most likely anything else. > > > > I don't think anyone here knows the answer to the mathematical > > question "how do I prove that a(n)=0 for some n?". If you knew the > > answer to that question then I'm sure many people could help you write > > code for it. > > > > Without that I think you need to go back to your mathematician friends > > or do some more reading. > > > > Are you sure that the problem you have posed here is solvable (i.e. > > that whether or not a(n)=0 is decidable for any n)? > > > > -- > > Oscar > > My understanding is this: there are an infinite number of n's that are not > multiples of three, and yet will always be divisible by at least one of 22 > primes for all values of k. > > i.e. certain n values make the equation produce only composite numbers for > all values of k. Just to be clear it is not the n I was referring to being composite but the result when certain n are fed into the n*2^k - 3 -- https://mail.python.org/mailman/listinfo/python-list
P = (2^N) - Q
If P is the set of primes, how do I write a program outputting the values of Q as an integer sequence with 1 integer of Q for each N? Let the first prime be P1 P1=2 so if N=0, Q=-1 as 2=(2^0) - (-1) Let the second prime be P2 P2=3 so if N=1, Q=-1 as 3=(2^1) - (-1) Let the third prime be P3 P3=5 so if N=2, Q=-1 as 5=(2^2) - (-1) Let the fourth prime be P4 P4=7 so N=3, Q=1 as 7=(2^3) - (1) etc. I want an integer sequence of Q beginning... -1,-1,-1,1... Does this make sense? -- https://mail.python.org/mailman/listinfo/python-list
Re: P = (2^N) - Q
Sometimes the simplest things... I am wondering about congruences/patterns in Q. -- https://mail.python.org/mailman/listinfo/python-list
Program to find Primes of the form prime(n+2) * prime(n+1) - prime(n) +- 1.
Primes of the form prime(n+2) * prime(n+1) - prime(n) +- 1. DATA 31, 71, 73, 137, 211, 311, 419, 421, 647, 877, 1117, 1487, 1979, 2447, 3079, 3547, 4027, 7307, 7309, 12211, 14243, 18911, 18913, 23557, 25439, 28729, 36683, 37831, 46853, 50411, 53129, 55457, 57367, 60251, 67339, 70489, 74797, 89669, 98909, 98911 EXAMPLE 7*5 - 3 - 1 = 31 11*7 - 5 - 1 = 71 11*7 - 5 + 1 = 73 13*11 - 7 + 1 = 137 Can someone put this in a Python program and post? -- https://mail.python.org/mailman/listinfo/python-list
Re: Program to find Primes of the form prime(n+2) * prime(n+1) - prime(n) +- 1.
On Tuesday, October 2, 2018 at 5:01:43 PM UTC-5, Max Zettlmeißl wrote: > On Tue, Oct 2, 2018 at 10:23 PM, Musatov wrote: > > Primes of the form prime(n+2) * prime(n+1) - prime(n) +- 1. > > DATA > > > > 31, 71, 73, 137, 211, 311, 419, 421, 647, 877, 1117, 1487, 1979, 2447, > > 3079, 3547, 4027, 7307, 7309, 12211, 14243, 18911, 18913, 23557, 25439, > > 28729, 36683, 37831, 46853, 50411, 53129, 55457, 57367, 60251, 67339, > > 70489, 74797, 89669, 98909, 98911 > > > > EXAMPLE > > > > 7*5 - 3 - 1 = 31 > > > > 11*7 - 5 - 1 = 71 > > > > 11*7 - 5 + 1 = 73 > > > > 13*11 - 7 + 1 = 137 > > > > Can someone put this in a Python program and post? > > > > Here you go, my friend: > > #!/usr/bin/env python3 > > primes = """Primes of the form prime(n+2) * prime(n+1) - prime(n) +- 1. > DATA > > 31, 71, 73, 137, 211, 311, 419, 421, 647, 877, 1117, 1487, 1979, 2447, 3079, > 35\ > 47, 4027, 7307, 7309, 12211, 14243, 18911, 18913, 23557, 25439, 28729, 36683, > 3\ > 7831, 46853, 50411, 53129, 55457, 57367, 60251, 67339, 70489, 74797, 89669, > 989\ > 09, 98911 > > EXAMPLE > > 7*5 - 3 - 1 = 31 > > 11*7 - 5 - 1 = 71 > > 11*7 - 5 + 1 = 73 > > 13*11 - 7 + 1 = 137 """ > > if __name__ == "__main__": > print(primes) > > > As soon as you start showing more effort yourself in the form of your > honest attempts to create a program or at least in the form of some > serious ideas, you might get replies which better fit what you > attempted to receive. Hi Max, I think I see the code you made pretty much just outputs the data I already have. At least I learned something. Thanks, Martin -- https://mail.python.org/mailman/listinfo/python-list
Re: Program to find Primes of the form prime(n+2) * prime(n+1) - prime(n) +- 1.
On Tuesday, October 2, 2018 at 6:13:01 PM UTC-5, Rick Johnson wrote: > Musatov wrote: > > > I am drafting a sequence for OEIS. > > And, have you tried your hand at any Python code yet? Or any > tutorials? I am reading this: https://doc.lagout.org/programmation/python/Beginning%20Programming%20with%20Python%20for%20Dummies%20%5BMueller%202014-09-22%5D.pdf > > > I was told Python was most accessible for beginners. > > And you were told correctly! > > However, be warned that if you happen to become the next > victim of one of our overzealous hall monitors[1], there is > probably very little i can do to help you -- except, perhaps > -- to inform you that switching to the "comp.lang.python" > newsgroup (accessible from GoogleGroups or any Usenet > newsreader) will ensure that at least ~some~ of us will see > your messages. > > Since GvR has resigned, the community has been in something > of a turmoil. And for some reason -- thus far unbeknownst to > me, but soon to be unearth by brute force if necessary! -- > the moderators have gone bad-guano crazy and are purging > members who have been sacrificing blood, sweat and tears > for, oh... i dunno... *DECADES*!!! Thus, to say that i'm > both saddened and angered by the current state of affairs, > would be an understatement. > > At this point I'm not sure how ugly this battle may > become... > > But, i can tell you one thing with absolute certainty... > > The people who have invested their lives into this language > and this community, and for all of these many years, are not > about to stand idle as a few hijackers move-in and destroy > everything we've known, experienced and loved about this > community and this language. I saw it finally made #3! Congrats to the community. https://www.tiobe.com/tiobe-index// > > Yes, Guido is gone. And no, i cannot be sure if he will ever > return. But for those of us who _remain_, the fire of > passion still burns in each of our hearts for the little > language that we love so dearly -- AND I'LL BE *DAMNED*! -- > if some puny, little hall-monitor *PUNK*, is going to come > in here and destroy -- with snobbish flicks of his harry > potter wand! -- *ALL* of the blood, sweat and tears that > have been *SACRIFICED* on the alters of progress for a > idealist dream that this little peon wretch couldn't even > fathom! > > > @Ethan Furman: The window for civility is quickly closing. > You, and you _ALONE_, have the power to reverse this toxic > course and sail our ship back into calmer waters before we > have ourselves an outright *MUTINY*. I have called upon the > members of this community to voice their frustrations with > your Captain-Bligh-inspired leadership, and, as a result, > your name and reputation have suffered greatly. However, > there is still time, should you choose to harness it, to ask > for forgiveness and right these wrongs. But i must remind > you, that haste is of the essence. For the hour is late. > THE. HOUR. IS... *LATE*! > > > [1] And be particularly cautious around one who's name > sort-of-rhymes with: "Eatin' Turdcan". -- https://mail.python.org/mailman/listinfo/python-list
Re: Program to find Primes of the form prime(n+2) * prime(n+1) - prime(n) +- 1.
On Tuesday, October 2, 2018 at 3:49:14 PM UTC-5, Rick Johnson wrote: > Musatov wrote: > > > Well you don't know until you ask. > > Fair enough. > > So, uh, have you made any attempt to compose a Python program from this > assignment? > > If so, don't be shy... let's see it! I don't even know where to begin! (I'm reading the Dummies book) -- https://mail.python.org/mailman/listinfo/python-list
Re: Program to find Primes of the form prime(n+2) * prime(n+1) - prime(n) +- 1.
On Wednesday, October 3, 2018 at 11:12:43 AM UTC-5, Michael Torrie wrote: > On 10/03/2018 09:26 AM, Musatov wrote: > > I don't even know where to begin! (I'm reading the Dummies book) > > If you have no experience in computer programming, it's going to be a > steep learning curve. > > But your first step is to learn Python and how to write programs in it. > That book and others will help with that. You'll have to write lots of > simple programs unrelated to primes along the way that help you > understand programming concepts. > > If you already have experience in other languages, the task will be easier. > > Computer programming is quite natural to some (small children seem to > get it much easier than us adults), but I've seen others struggle to > grasp the abstract concepts for years. > > Once you've grasped basic Python programming, you can return top the > original problem at hand. Start by identifying the process or algorithm > that would find these primes. In other words, how would you do it on pen > and paper? Computer programs are not magic. They are only expressions > of human thinking. Often some very smart mathematicians have come up > with powerful algorithms (a step-by-step process) to do these things, > and your job as a programmer is to turn this mathematical process into a > computer program using things like loops and Boolean logic. How would > you find these primes using your pen, paper, and calculator? Literally, how I found them was taking a list of primes and checking if the calculations with the lesser primes resulted in numbers also further along on the list. Another way I guess would be to do the calculations then check if the number is prime. -- https://mail.python.org/mailman/listinfo/python-list
Re: Program to find Primes of the form prime(n+2) * prime(n+1) - prime(n) +- 1.
On Tuesday, October 2, 2018 at 5:54:30 PM UTC-5, Gary Herron wrote: > On 10/02/2018 01:23 PM, [email protected] wrote: > > Primes of the form prime(n+2) * prime(n+1) - prime(n) +- 1. > > DATA > > > > 31, 71, 73, 137, 211, 311, 419, 421, 647, 877, 1117, 1487, 1979, 2447, > > 3079, 3547, 4027, 7307, 7309, 12211, 14243, 18911, 18913, 23557, 25439, > > 28729, 36683, 37831, 46853, 50411, 53129, 55457, 57367, 60251, 67339, > > 70489, 74797, 89669, 98909, 98911 > > > > EXAMPLE > > > > 7*5 - 3 - 1 = 31 > > > > 11*7 - 5 - 1 = 71 > > > > 11*7 - 5 + 1 = 73 > > > > 13*11 - 7 + 1 = 137 > > > > Can someone put this in a Python program and post? > > > No, sorry, but that's not how this works. We're not here to do your > homework for you, and you won't learn anything if we do. You make an > attempt at solving this, asking any specific Python related questions > you need help with, and you'll find this to be prompt, friendly, and > helpful group. > > > Gary Herron > > > -- > Dr. Gary Herron > Professor of Computer Science > DigiPen Institute of Technology > (425) 895-4418 Thank you, Gary. I checked out your program at DigiPen, looks neat. -- https://mail.python.org/mailman/listinfo/python-list
Congratulations to the community!
https://www.tiobe.com/tiobe-index// Python #3 ranked language as of 09/2018 UP from #5 last year Musatov -- https://mail.python.org/mailman/listinfo/python-list
Accessing clipboard through software built on Python
I am wondering if Python could be used to write a program that allows: 1. Highlight some text 2. Ctl+HOTKEY1 stores the string of text somewhere as COPIEDTEXT1 3. Highlight another string of text 4. Ctl+HOTKEY1 stores another string of text somewhere as COPIEDTEXT2 THEN 5. Ctl+HOTKEY2 pastes COPIEDTEXT1 6. Ctl+HOTKEY2 pastes COPIEDTEXT2 I found "pyperclip" and "Tkinter" but I don't know where to start. Thanks, Musatov -- https://mail.python.org/mailman/listinfo/python-list
Re: Accessing clipboard through software built on Python
On Saturday, October 27, 2018 at 10:28:00 AM UTC-5, Michael Torrie wrote: > Couple of questions: > On 10/27/2018 07:17 AM, Musatov wrote: > > I am wondering if Python could be used to write a program that allows: > > > > 1. Highlight some text > > 2. Ctl+HOTKEY1 stores the string of text somewhere as COPIEDTEXT1 > > This text comes from where? Another application? >From a webpage. > > > 3. Highlight another string of text > > 4. Ctl+HOTKEY1 stores another string of text somewhere as COPIEDTEXT2 > > > > THEN > > > > 5. Ctl+HOTKEY2 pastes COPIEDTEXT1 > > Gets pasted where? Unto a savable field on another webpage. > > > 6. Ctl+HOTKEY2 pastes COPIEDTEXT2 > > As far as I know it's not possible for an application to directly yank > highlighted text from another application. The first application would > have to first copy that text to the clipboard (Control-C in that app) > and then the second application could grab it from the clipboard > (ctrl-hotkey1) and then store it in its own variables. Ctrl-hotkey2 > could then push the text back into the clipboard and then you can ctrl-V > paste it in the other application. This type of functionality is known > often found in clipboard manager programs. Yes, I understand but they all involve putting one piece of text unto the clipboard at a time. I want COPYFIELD1 COPYFIELD2 PASTEFIELD1 PASTEFIELD2 Without having to look at the damn clipboard manager! And no more than two hotkey combinations. It would make my job so much easier, and easier for many other workers doing the same job. > > > I found "pyperclip" and "Tkinter" but I don't know where to start. > Here's another file that demonstrates accessing the clipboard on the > Linux, Mac, and Windows: > > https://github.com/Shizmob/clippy/blob/master/clip.py Thank you.> > As for the hotkey stuff, that's also dependent on the operating system. > Google for something like "python global hotkey linux" to get an example > of how to implement that. Ok -- https://mail.python.org/mailman/listinfo/python-list
Re: Accessing clipboard through software built on Python
On Saturday, October 27, 2018 at 11:12:35 AM UTC-5, Marko Rauhamaa wrote: > Michael Torrie : > > As far as I know it's not possible for an application to directly yank > > highlighted text from another application. > > That's an age-old pattern in X11. I don't know if Wayland supports it. > > Application 1 holds a selection (usually highlighted) and Application 2 > wants to copy the selection. No clipboard is needed. Application 2 > simply asks for the selection. The request is relayed to Application 1, > which generates the response: > > https://en.wikipedia.org/wiki/X_Window_selection#Selections> > > > Marko I work from a web database of users and I continually have to copy email address and user ID to two separate fields on a Salesforce.com page. I go to the webpage, highlight email address then copy. Then go to Salesforce page, and paste. Then go back to the webpage, then copy the User ID. Then go back to Salesforce page, and paste. I think it would be much more efficient to: On webpage, copy emailaddress and user ID. Then go to Salesforce and paste email address and user ID. -- https://mail.python.org/mailman/listinfo/python-list
Re: Accessing clipboard through software built on Python
On Saturday, October 27, 2018 at 11:40:57 AM UTC-5, Bob Gailer wrote: > On Oct 27, 2018 9:20 AM, "Musatov" wrote: > > > > I am wondering if Python could be used to write a program that allows: > > > > 1. Highlight some text > > 2. Ctl+HOTKEY1 stores the string of text somewhere as COPIEDTEXT1 > > 3. Highlight another string of text > > 4. Ctl+HOTKEY1 stores another string of text somewhere as COPIEDTEXT2 > > > > THEN > > > > 5. Ctl+HOTKEY2 pastes COPIEDTEXT1 > > 6. Ctl+HOTKEY2 pastes COPIEDTEXT2 > > > > What operating system are you using? If it is Windows I recommend you take > a look at a program called autohotkey. > > I found "pyperclip" and "Tkinter" but I don't know where to start. > > > > Thanks, > > > > Musatov > > -- > > https://mail.python.org/mailman/listinfo/python-list I will look at autohotkey. -- https://mail.python.org/mailman/listinfo/python-list
Re: Accessing clipboard through software built on Python
Yes, same site every time. -- https://mail.python.org/mailman/listinfo/python-list
Program to keep track of success percentage
I am thinking about a program where the only user input is win/loss. The program let's you know if you have won more than 31% of the time or not. Any suggestions about how to approach authoring such a program? Thanks. -- https://mail.python.org/mailman/listinfo/python-list
AP -- MeAmI.org Paces Google
Los Angeles (AP) --MeAmI.org now has users in 50 countries following its adopted use in Pakistan. The search engine has grown in popularity 10,000 fold following its Beta test launch three months ago in April, 2009. Supporters of the site claim it is better than rival Google upon which platform it is based. Controversy arose after MeAmI.org search code allowed users to search other users Google results with no advertising. "It is truly an innovative thing we are doing," said Founder and CEO, Martin Musatov. "Letting users search the results of other Google users immediately results in a level of accuracy and relevance above and beyond Google." Google changed their API following the launch or MeAmI.org and explored the possibility of blocking site access from MeAmI.org to Google search results but was unable to do so. Critics of MeAmI.org say what it is doing is tantamount to intellectual theft. When asked about this topper Musatov exclaimed, "The Internet was made for people, not companies." An analyst at Goldman Sachs says, requesting to remain anonymous, "MeAmI.org has a strong presence in promoting itself as a vehicle for global activism and to tell you the truth, this makes it much more likely an acquisition target than potential intellectual property violator." Google could not be reached for comment. -- http://mail.python.org/mailman/listinfo/python-list
Re: AP -- MeAmI.org Paces Google
On Jul 9, 7:54Â pm, David Bernier wrote: > Musatov wrote: > > Los Angeles (AP) --MeAmI.org now has users in 50 countries following > > its adopted use in Pakistan. Â The search engine has grown in > > popularity 10,000 fold following its Beta test launch three months ago > > in April, 2009. Supporters of the site claim it is better than rival > > Google upon which platform it is based. Controversy arose after > > MeAmI.org search code allowed users to search other users Google > > results with no advertising. "It is truly an innovative thing we are > > doing," said Founder and CEO, Martin Musatov. "Letting users search > > the results of other Google users immediately results in a level of > > accuracy and relevance above and beyond Google." Google changed their > > API following the launch or MeAmI.org and explored the possibility of > > blocking site access from MeAmI.org to Google search results but was > > unable to do so. Critics of MeAmI.org say what it is doing is > > tantamount to intellectual theft. When asked about this topper Musatov > > exclaimed, "The Internet was made for people, not companies." An > > analyst at Goldman Sachs says, requesting to remain anonymous, > > "MeAmI.org has a strong presence in promoting itself as a vehicle for > > global activism and to tell you the truth, this makes it much more > > likely an acquisition target than potential intellectual property > > violator." Google could not be reached for comment. > > Mr. Musatov, Â do you know who originally wrote the > article above? > > Thank you. > > David Bernier- Hide quoted text - > > - Show quoted text - Yes. -- http://mail.python.org/mailman/listinfo/python-list
Re: AP -- MeAmI.org Paces Google
On Jul 9, 11:21 pm, "Bruce C. Baker" wrote: > "Floetry" wrote in message > > news:[email protected]... > On Jul 9, 8:33 pm, "Bruce C. Baker" > wrote: > > > wrote in message > > >news:defacf35-6149-485a-8f03-15472d63d...@a39g2000pre.googlegroups.com... > > > > > > Oh, puh-LEEZ, Martin! A two-year-old wouldn't be fooled by this! > > Any reason "ka"-snip? > > Binomial Theorem: page 3.http://MeAmI.org/pversusnp.pdf > > _ > > Well, *Martin*, since you think I'm dead, it could only have been my "ka" > that did the snipping. Surely a polymath of your vast accomplishments will > have no problem with the religio-historical reference, eh, *Martin*? (I'm > predicting that not only will you *not* recognize it, you'll find it beneath > your notice. No fair googling, *Martin*!) I did not Google. ka in ancient Egypt, the supposed spiritual part of an individual human being or god, which survived (with the soul) after death and could reside in a statue of the person. ELIZABETH KNOWLES. "ka." The Oxford Dictionary of Phrase and Fable. Oxford University Press. 2006. Encyclopedia.com. 10 Jul. 2009 . In a third class of religionâusually heavily interlaced with fetishismâ magic, momentary and special deities, nature gods, and deities personifying natural functions (such as the Egyptian solar god Ra, the Babylonian goddess of fertility Ishtar, the Greek sea-god Poseidon, and the Hindu goddess of death and destruction *Ka*li) emerge and are incorporated into a system of mythology and ritual. Sometimes they take on distinctively human characteristics (see anthropomorphism). The axis of reason - equinox, mass, and time - the orbits of ...Et a basso profundo hashi-hashi-brek-a-time todo ka tiempo. > Vozacka dozvola macarana lambada ... (&â¯&@â®&â±&â®@&â¯&)) P. -- Musatov http://MeAmI.org ... -- http://mail.python.org/mailman/listinfo/python-list
Re: AP -- MeAmI.org Paces Google
François Grondin wrote: > "David Bernier" a �crit dans le message de news: > [email protected]... > > Musatov wrote: > >> On Jul 9, 7:54 pm, David Bernier wrote: > >>> Musatov wrote: > >>>> Los Angeles (AP) --MeAmI.org now has users in 50 countries following > >>>> its adopted use in Pakistan. The search engine has grown in > >>>> popularity 10,000 fold following its Beta test launch three months ago > >>>> in April, 2009. Supporters of the site claim it is better than rival > >>>> Google upon which platform it is based. Controversy arose after > >>>> MeAmI.org search code allowed users to search other users Google > >>>> results with no advertising. "It is truly an innovative thing we are > >>>> doing," said Founder and CEO, Martin Musatov. "Letting users search > >>>> the results of other Google users immediately results in a level of > >>>> accuracy and relevance above and beyond Google." Google changed their > >>>> API following the launch or MeAmI.org and explored the possibility of > >>>> blocking site access from MeAmI.org to Google search results but was > >>>> unable to do so. Critics of MeAmI.org say what it is doing is > >>>> tantamount to intellectual theft. When asked about this topper Musatov > >>>> exclaimed, "The Internet was made for people, not companies." An > >>>> analyst at Goldman Sachs says, requesting to remain anonymous, > >>>> "MeAmI.org has a strong presence in promoting itself as a vehicle for > >>>> global activism and to tell you the truth, this makes it much more > >>>> likely an acquisition target than potential intellectual property > >>>> violator." Google could not be reached for comment. > >>> Mr. Musatov, do you know who originally wrote the > >>> article above? > >>> > >>> Thank you. > >>> > >>> David Bernier- Hide quoted text - > >>> > >>> - Show quoted text - > >> > >> Yes. > > > > Mr. Musatov, do you know the name of the person who > > originally wrote the article above? > > > > Thank you. > > > > David Bernier > > Maybe Mr. Musatov should answer the following questions instead : > 1. Did you write the article above? > 2. If not, who did? And I don't want AP as the answer, but the name of the > journalist. > > David, don't take it bad, but he answered your question with an accurate > answer (yes), You gave him the opportunity to avoid the real answer and he > took it. Based on Musatov's strange behavior and logic, don't expect more > from him. Ask anyone else the same question and you'd get a real answer. > > BTW, my guess for question 2 would be the Masked Logician, Floetry, > scriber77, or Professor X. > > Francois 1. Yes. -- http://mail.python.org/mailman/listinfo/python-list
Re: AP -- MeAmI.org Paces Google
Martin Musatov wrote: David Bernier wrote: > [email protected] wrote: > [...] > > > community. But perhaps he is trying to see things a bit differently > > and is just not getting the feedback he needs, so he is throwing > > tantrums apparently across USENET. > > > > Like I said before, I am just trying to do right by this person who > > contacted me, and seemed to be a decent person with a genuine interest > > in mathematics. He was very respectful. > > > > Alas, I am at a loss on what specific feedback to give him on his > > paper as though I am a professor of Mathematics, Computer Science is > > not my specialty. > > > > I told him I would try to get him some feedback on the equations on > > page 3. Would any of you be so kind to help me? > > > > Here is the paper: http://MeAmI.org/pversusnp.pdf > > > > I do thank you for your time. > > > > Good day, > > > > Professor X > > This is what there is at the bottom of page 3: > > << Conclusion: Binary revisions are allowed given the above formulas. >> > > So I don't understand the proposed solution for the "P = NP" > problem. > > David Bernier P can be equal to N and not P when it is in brackets vs. parantheses. The dots ib the equation in "P = [dots] N (dots) P. The difference between the brackets and the paranthesis represents a margin of time in computation. The dots present in the paper (I am not able to render them here, but they are in the .pdf file) represent a non-deterministic symbolic means of representing language. Thank you for your respone. The conclusion means traditional characters and symbols are not ideal for binary computation. -- http://mail.python.org/mailman/listinfo/python-list
Re: ] returns []
MUSATOV -- http://mail.python.org/mailman/listinfo/python-list
Re: security quirk
On Jan 29, 8:55 pm, RichD wrote: > I read Wall Street Journal, and occasionally check 00commentBegin 01comment 02commentEnd 03 04 (); Open middle Close Open middle Close Open middle Close %% > articles on their Web site. It's mostly free, with some items > available to subscribers only. It seems random, which ones > they block, about 20%. > > Anywho, sometimes I use their search utility, the usual author > or title search, and it blocks, then I look it up on Google, and > link from there, and it loads! ok, Web gurus, what's going on? > > -- > Rich -- http://mail.python.org/mailman/listinfo/python-list
Re: Program to find Primes of the form prime(n+2) * prime(n+1) - prime(n) +- 1.
I am drafting a sequence for OEIS. I was told Python was most accesible for beginners. On Tue, Oct 2, 2018, 4:48 PM Bob Gailer wrote: > On Oct 2, 2018 4:59 PM, "Musatov" wrote: > > > > Primes of the form prime(n+2) * prime(n+1) - prime(n) +- 1. > > DATA > > > > 31, 71, 73, 137, 211, 311, 419, 421, 647, 877, 1117, 1487, 1979, 2447, > 3079, 3547, 4027, 7307, 7309, 12211, 14243, 18911, 18913, 23557, 25439, > 28729, 36683, 37831, 46853, 50411, 53129, 55457, 57367, 60251, 67339, > 70489, 74797, 89669, 98909, 98911 > > > > EXAMPLE > > > > 7*5 - 3 - 1 = 31 > > > > 11*7 - 5 - 1 = 71 > > > > 11*7 - 5 + 1 = 73 > > > > 13*11 - 7 + 1 = 137 > > > > Can someone put this in a Python program and post? > > It is our policy to not write code at others requests. We are glad to help > if you've started writing a program and are stuck. > > Out of curiosity where does this request come from? > > If you want to hire one of us to write the program, in other words pay us > for our time and expertise, that's a different matter. We would be happy to > comply. > > -- > > https://mail.python.org/mailman/listinfo/python-list > -- https://mail.python.org/mailman/listinfo/python-list
Re: AP -- MeAmI.org Paces Google
Thank you. Martin Musatov 2009/7/9 Friðrik Már Jónsson > I'll be the first to admit it. The point of writing a fake story by > Associated Press and publishing it on a programming mailing list is totally > beyond me. > > Confoundedly yours, > Friðrik Már -- http://mail.python.org/mailman/listinfo/python-list
avlhqw avlhqeavlhqino ovfqalmw avlhqei avlhqeaivscunqw
Thanks to technology, a memorandum of understanding (thanks from Tel
Aviva / s, F `u / n (I [I TO rotate HM), and try to think, nature is"
E | .. (no offense to kiloton preparation. .. has C, E (Visor / s
Chest on Tuesday Kin \ 2 I "auto. Hi Lasso, Wilson vest / Na` martin /
NH MW `. brought / \ n VIEW goals WT /" NH, RAN, not (I all, or [that
load / Samoa ...) I think the WT DR 3 Μάη | . gown or some [even
in auto Cayman S (j eventual auto Arabia will not bar / threw / a) "L"
4 Oh, BAG, Gen auto, n (oil. raj Anatole’s auto / threw HM / s (Tao,
she vest (EDA Kai May that | Hall and hold LEIA ovum .. \ 5] 505 A
thru / |? auto / ton, John (avlhqw / DVDs eggs MAY Tues | H, the pH of
WAIT May / U / Eyelet) EN May two | gown or some [aunt EN his / | even
\ "LO 6` EN aunt BAG / | .. I over Ni (Kama’s evoke / NO perinea, U
(and auto [Peripatetic To /) 7 Adelaide (n ovum Ventolin.n akin
graphite, F I '/ S (all Ventolin.n Palau an (10] not PULL arch / s \
"from" H vesting Vent Olin not clear, Greek] is Zhukov PULL arch / d)
eight times a year, Lin Ventolin.n akin No Thanks, I `F u / n (or
[vesting avlhqe.j EN aunt / | .. (EDA Mr. Kai N / A \ [paragraph` t
Scottie (oil. F / 500 .. for avlhqino NH, N DH SIP) Get 9 or "50", BAG
EN WT / ... | wit Chennai is = (oil. ton Adolfo.n auto / miss / s (EN
and / | Scottie |. vest to [WK with RS) agape or 10 "/ n ton Adolfo
auto n / EDA (VA / |. wit I (EDA Yolanda aunt Kai Ski / | ovum
resist ...) The 11-misw / s ton Adolfo.n auto / (EN and / |. of
Scottie | vest (EN and Kai / |. Scottie, |. reputation / (1000 = ovum
want and / u-PA Gay (or [`t Scottie in veto, flues you’d goalmouth
auto / s) 12 degrees , F U "/ (technical., 1 (or [I AVE, entail I` u /
n Martin, all comments. what auto .. N / A 13 °), F U "I / O (open, RE
( or [cover even. PULL arch n / graphite), F MIL `U / N (, SK spin (or
[enrich coverage ton poncho, B) from 14 degrees, F" u / n (payment (or
[I even , violation of ton, CA), Ms. Gray MIL / V (e, RE (or [even.
PULL arch n / d) and covering gray / 500 (rotation of the earth (or [I
chiaroscuro, vest (Okay., May Beautiful / U / u `EN MIL / n, the game
will cover (.. Kai does not enrich poncho n .. n), BR 15 agape / O.
MADE EN dispute a / VA |. SEW PM | ) Eva agape / | ton difference
(ovum times are eggs, the pH can parent / EN aunt J / |. \ 16 or [/ n,
EN VA / |. KB, SEW | (MK pique / and Nark. CK (b pique-Kai, has / the
ovfqalmw N / S (H Kai emblazon "organic unity / straight (and keep ..
ovum EVE, May / June protection. all SAP or requests vest Additional
Protocol to the Agreement), I 17 "He was not, smog parameters, Get
(oil. pique` H, E and auto / \ O `poi / s .. May LAMA / U / read evil
ton avid / N) 18 (escape, O [ RA vest (oil. Kama’s Zhukov, and sat
down, or [O `ante, God. retail (Shoat. / ante there, students Ego
Crista, however, and \ or R [N and gown or some [escape you [PR vest,
n), '19 VEX MW / n vex / lion (San all ovum VEX H = H ', w / w \ AV
garb San VEX = "b, w / w (moment, An Keenan me B MW / n \ all I [/ Na
fawner or sin [e-IT ovum ease net VEX-In. MW / N) 20, I / cry / of
ADM. whales ... digestive ALPO Director / ovum `, (O Kai, gave
permission, s) and -21 000 Gray `u / n (or [O ovum given than all,
wean (all or O [which aunt, N (or Kai. [PA-IT / Tao n / EVE and
avlhqei M / d, and AGE tablespoons ovum). March 22 vesting of Tao, she
(IV US memo avenue # in Visor [u / ovum, hold, or God, or S *, where
he was the Messiah ante vesting (avenue, memo ton GS, I think. HO N)
23 AP / avenue onion. memo is ovule. ton food and energy \ 'O' or
'swimming mellow / s. No, I think. ton food, and RA, ICE) 24 "B / ovum
J] Zhukov, PULL is arch / s or EN / N, I, you) even miles EN` u / n,
New Hampshire | no] PULL arch / d Zhukov ('You / I EN WT / | .. HO
`w / |. EN Kai WT / | .. Heritage Manor / h) 25, I think [Stevie. NH
Evangelic P.D., Ah] and' I. hip hungers auto barn / (no, a thousand
degrees avid help when. N) 26 t / h is the salary my gray / WT / n
plan, known Sat K / day) I think 27 - true / cry / or MA] VELA , Beta
PULL ... auto / EN mail `u / n, we have (CRED VIEW and, and ... [the
color of nature, SH |. children` s / \ Tao salary / M (BRED `Kai caw.
I . C `Q Dale all auto MA / color is finally Skein /, known (oil.
avlhqe, vest (Kai ovum and cry / day (Tourism / DR aunt / |.) 28, I
think now / is not (technically, ( EDA that Nate aunt / |. \ I [or
Narcotics Anonymous [Only fawner / | E Miscellaneous / parish space
(oil. aivscunqw / male PULL auto / (EN and / |. Peruse, | auto /) 29
even avid or and / [u, Kayo, vest (gown, Barker, or [AP / 50 poi / s
than Dionysus, NAN (VEX. auto / Gage, Naphtali) M a r t i n M u s a
t o v 8 1 8 4 3 0 4 5 8 6 S M S m u s a t o v a t a t t d o t n
e t
--
http://mail.python.org/mailman/listinfo/python-list
