|
|
|
|
|
|
|
|
|
#56 by Michael De Vlieger at Thu Apr 20 09:02:52 EDT 2023
|
|
|
|
|
|
|
|
#55 by Peter Luschny at Thu Apr 20 04:43:35 EDT 2023
|
|
|
|
|
|
Discussion
|
| Thu Apr 20
| 09:02
| Michael De Vlieger: I think so long as defined, notation introduced is understandable, even if as a convenience. Thanks BTW for direction on [sic] in another edit, will use.
|
|
|
|
|
|
|
#54 by Peter Luschny at Thu Apr 20 04:42:46 EDT 2023
|
|
| FORMULA
|
T(n, k) = (n // 2^k) mod 2, for 0 <= k <= log[2](n) and n > 0; T(0, 0) = 0. ('//' denotes integer division). - Peter Luschny, Apr 20 2023
|
|
| STATUS
|
approved
editing
|
|
|
|
|
Discussion
|
| Thu Apr 20
| 04:43
| Peter Luschny: Although announced in the name and in the keywords as a table, no T(n, k) formula is given; instead, bits are chased, tested and reversed as if there are no mathematical notions.
|
|
| 04:43
| Peter Luschny: I continue to promote the notation '//' for integer division, as announced.
|
|
|
|
|
|
|
#53 by Susanna Cuyler at Fri Jun 25 23:11:06 EDT 2021
|
|
|
|
|
|
|
|
#52 by Jon E. Schoenfield at Fri Jun 25 22:08:52 EDT 2021
|
|
|
|
|
|
|
|
#51 by Jon E. Schoenfield at Fri Jun 25 22:08:50 EDT 2021
|
|
| COMMENTS
|
This is the quite common, so-called "bittest" function, see PariPARI code. - M. F. Hasler, Jul 21 2013
|
|
| STATUS
|
approved
editing
|
|
|
|
|
|
|
#50 by Michel Marcus at Tue May 12 07:50:58 EDT 2020
|
|
|
|
|
|
|
|
#49 by Joerg Arndt at Tue May 12 07:06:26 EDT 2020
|
|
|
|
|
|
|
|
#48 by F. Chapoton at Tue May 12 07:04:18 EDT 2020
|
|
|
|
|
|
|
|
#47 by F. Chapoton at Tue May 12 07:04:11 EDT 2020
|
|
| PROG
|
(Python) for n in range(0, 20): print list(map(([int, (z) for z in str(bin(n)[2:])[::-1])) # _]]) # _Indranil Ghosh_, Mar 31 2017
|
|
| STATUS
|
approved
editing
|
|
|
|
|
Discussion
|
| Tue May 12
| 07:04
| F. Chapoton: details in python code
|
|
|
|
|
|
