# Proof Question

Printable View

• August 29th 2006, 09:18 AM
nortonKM
Proof Question
Hi,

I have been trying to solve this problem but I cannot figure out a way to solve it.

Show that: For every n in Z+, n can be written as the power of 2 and an odd integer.

Thanks
• August 29th 2006, 09:56 AM
Glaysher
Suppose $n$ is even

Then $n = 2^0 + (n - 1)$ where $n - 1$ is odd

Suppose $n$ is odd

Suppose positive integer $x \ne 0$ is such that $2^x < n$

Then $2^x$ is even and you need to add an odd number to get equal to $n$
All times are GMT -8. The time now is 11:56 AM.
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 0, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 8, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 10, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "plain"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "english_confidence": 0.9562470316886902, "perplexity_flag": "middle"}