Other than iterating n and testing against x, is there a particular method in SAGE to find the largest 2^n less than a specified integer?
Thanks CL
Revision history [back]
 | 1 | initial version |
| | 1 | initial version |
Other than iterating n and testing against x, is there a particular method in SAGE to find the largest 2^n less than a specified integer?
Thanks CL
Copyright Sage, 2010. Some rights reserved under creative commons license. Content on this site is licensed under a Creative Commons Attribution Share Alike 3.0 license.