Physics Forums

## inquisitive minds

if a number is a cube and a square the only forms will be 9k or 9k+1. any suggestions as to how to vaidate this?? would the 8 cases work? from 9k to 9k+8? what does everyone else think?

yet another...

10 divides z if and only if (10,z) does not = 1.

PhysOrg.com  science news on PhysOrg.com  >> Front-row seats to climate change>> Attacking MRSA with metals from antibacterial clays>> New formula invented for microscope viewing, substitutes for federally controlled drug

10 divides z if and only if (10,z) does not = 1.
Obviously if 10 divides z, then (10, z) is not 1 (it must be at least 10). But the converse is not true, consider z = 2...

that really doesn't help much, i kind of thought of that.  this is one of those proofs that need to show one way then the other.  that is all i am coming up with.

## inquisitive minds

this is one of those proofs that need to show one way then the other.
But, uh, didn't I just give a counterexample to the other implication? And thus, it's false?

so if i have the left hand side saying that if you choose n = 1, then that says that (10,n) cannot = 1.  with = to 2, it says the same thing, so it would work for all n except for 10, and that would givbe you 1.  the right hand side would say that (10,n) not = 1.  could i assume that it DOES = 1 and show a contradiction?  would that be valid for this type of proof?

does anyone have any suggestions on the first question?  would showing the 8 cases be the easiest way to p[rove this?  i am thinking so, just square them and cube at the same time, or should i square them first THEN cube?

Recognitions:      Gold Member        Science  Advisor     Staff Emeritus  For a number, k, to be a square and a cube, it needs to be the 6th power of another number. This is evident from the prime factorization of k. So, we need to show that  $$k = n^{6m} \equiv 0 or 1 (mod 9)$$  So we need consider only the nine cases n=0,1,2,...,8  $$0^{6} = 0 \equiv 0 (mod 9)$$  $$1^{6} = 1 \equiv 1 (mod 9)$$  $$2^{6} = 64 \equiv 1 (mod 9)$$  $$3^{6} \equiv 6^{6m} \equiv 0 (mod 9)$$  $$4^{6} = 2^{12} \equiv 1 (mod 9)$$  $$5^{6} \equiv (-4)^6 = 4^6 \equiv 1 (mod 9)$$  $$7^{6} \equiv (-2)^6 = 2^6 \equiv 1 (mod 9)$$ and   $$8^{6} \equiv (-1)^6 = 1 (mod 9)$$  And of course, 0^m = 0 and 1^m = 1, so that completes the proof.

Thread Tools

|                                        |                    |         |
|----------------------------------------|--------------------|---------|
| Similar Threads for: inquisitive minds |                    |         |
| Thread                                 | Forum              | Replies |
|                                        | Quantum Physics    | 2       |
|                                        | General Discussion | 1       |
|                                        | Current Events     | 67      |
|                                        | General Discussion | 8       |
{"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": 9, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "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": "github"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "english_confidence": 0.9335921406745911, "perplexity_flag": "middle"}