Proth number

English Etymology After French mathematician François Proth (1852-1879). Noun en number theory Any number of the form k·2n + 1, where k is odd, n is a positive integer, and 2n > k. 2006, B. Grégoire, L. Théry, B. Werner, A Computational Approach to Pocklington Certificates, Masami Hagiya, Philip Wadler (editors), Functional and Logic Programming: 8th International Symposium, Proceedings, Springer, Lecture Notes in Computer Science LNCS 3945, page 109, To generate Pocklington certificates for Proth number we add a new entry to the oracle: pocklington -proth k p. en 2016 Abhijit Das Computational Number Theory Taylor & Francis (CRC Press / Chapman & Hall) https://books.google.com.au/books?id=tX_SBQAAQBAJ&pg=PA295&dq=%22Proth+number%22%7C%22Proth+numbers%22&hl=en&sa=X&ved=0ahUKEwiz2b617ujiAhVCz1QKHUVOA_MQ6AEIKDAA#v=onepage&q=%22Proth%20number%22%7C%22Proth%20numbers%22&f=false 295 Suppose that a Proth number satisfies the condition that for some integer . Prove that is prime. en 2014 w:Adam Spencer Adam Spencer's Big Book of Numbers Brio Books https://books.google.com.au/books?id=u5oVBQAAQBAJ&pg=PA388&dq=%22Proth+number%22%7C%22Proth+numbers%22&hl=en&sa=X&ved=0ahUKEwiz2b617ujiAhVCz1QKHUVOA_MQ6AEIMzAC#v=onepage&q=%22Proth%20number%22%7C%22Proth%20numbers%22&f=false 388 If a Proth number is prime, we call it a Proth prime. Hyponyms en Cullen number en Proth prime Translations number of the form k×2^n + 1 Italian: it numero di Proth m See also en Sierpinski number Further reading Sequence A080075 on the On-Line Encyclopedia of Integer Sequences en eponyms