Prove any prime number is irrational, Mathematics

Assignment Help:

1. Show that there do not exist integers x and y for which 110x + 315y = 12.

2. If a and b are odd integers, prove that a2 +b2 is divisible by 2 but is NOT divisible by 4. Hint:

Any odd number can be written 2k + 1 for some integer k.

3. Prove that for any prime number p, √ p is irrational. Hint: Follow the same method that was used to prove √ 2 is irrational, by first supposing √ p can be expressed as a=b.

 


Related Discussions:- Prove any prime number is irrational

Profits and loss, what does 1000/q in the ATC equation represent economical...

what does 1000/q in the ATC equation represent economically?

Problem word solving, Mrs. Jones and Mr. Graham had the same amount of mone...

Mrs. Jones and Mr. Graham had the same amount of money at first. After Mrs. Jones bought a computer that cost $2,055, she had 1/4 as much money as Mr. Graham. How much money di

Graphs, How do I graph a round robin pool tournment with 6 players using gr...

How do I graph a round robin pool tournment with 6 players using graph theory

Right-handed limit, Right-handed limit We say provided we can m...

Right-handed limit We say provided we can make f(x) as close to L as we desire for all x sufficiently close to a and x>a without in fact letting x be a.

Toplogy, Let 0 ! V1 !    ! Vk ! 0 be a long exact sequence of vector spa...

Let 0 ! V1 !    ! Vk ! 0 be a long exact sequence of vector spaces with linear maps. Show that P (??1)i dim Vi = 0.

Comparison-types of word problems related to subtraction, Comparison - the...

Comparison - the difference between two groups or numbers, namely, how much one is greater than the other, how much more is in one group than in the other. (e.g., if Munna has

Percentage, how do you you find 40% if you 35 out of 40

how do you you find 40% if you 35 out of 40

Prove that prims algorithm produces a minimum spanning tree, Prove that Pri...

Prove that Prim's algorithm produces a minimum spanning tree of a connected weighted graph. Ans: Suppose G be a connected, weighted graph. At each iteration of Prim's algorithm

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd