Question

In: Advanced Math

Use the method of exhaustion to prove the following statement: “For every prime number p between...

Use the method of exhaustion to prove the following statement: “For every prime number p between 30 and 58, 10 does not divide p − 9.”
Prove that 0.17461461 . . . is rational (digits 461 in the fractional part are periodically repeated forever).

Expert Solution

First question:

Primes between and are

These are primes because and has no divisor other than (neither of divides ) implies is a prime, and has no divisor other than (neither of divides ) implies is a prime, and has no divisor other than (neither of divides ) implies is a prime, and has no divisor other than (neither of divides ) implies is a prime, and has no divisor other than (neither of divides 47) implies 47 is a prime, and has no divisor other than (neither of divides ) implies is a prime.

Now, for , we have

and divides none of . This proves the desired statement.

Second question:

We have

The series in the parenthesis is a geometric series with common ratio

Therefore,

which is a rational number.

Colby Messinger answered 2 years ago

Suppose a is a positive integer and p is a prime/ Prove that p|a if and...

Suppose a is a positive integer and p is a prime/ Prove that p|a if and only if the prime factorization of a contains p. Can someone please show a full proof to this, thank you.

Prove or disprove each of the following statements. (a) There exists a prime number x such...

Prove or disprove each of the following statements. (a) There exists a prime number x such that x + 16 and x + 32 are also prime numbers. (b) ∀a, b, c, m ∈ Z +, if a ≡ b (mod m), then c a ≡ c b (mod m). (c) For any positive odd integer n, 3|n or n 2 ≡ 1 (mod 12). (d) There exist 100 consecutive composite integers.

use Python The assertion that every even number is the sum of two prime numbers is...

use Python The assertion that every even number is the sum of two prime numbers is called Goldbach’s conjecture. You will write a program that asks the user for an integer number, then checks if the integer is even, and finally determines two prime numbers that sum to the user’s entered integer number. Assignment Requirements Three functions are required: get_input(): This function takes no parameters, but will ask the user for an integer number. It will return a valid integer....

Let p be an integer other than 0, ±1. (a) Prove that p is prime if...

Let p be an integer other than 0, ±1. (a) Prove that p is prime if and only if it has the property that whenever r and s are integers such that p = rs, then either r = ±1 or s = ±1. (b) Prove that p is prime if and only if it has the property that whenever b and c are integers such that p | bc, then either p | b or p | c.

Let p be an odd prime. (a) (*) Prove that there is a primitive root modulo...

Let p be an odd prime. (a) (*) Prove that there is a primitive root modulo p2 . (Hint: Use that if a, b have orders n, m, with gcd(n, m) = 1, then ab has order nm.) (b) Prove that for any n, there is a primitive root modulo pn. (c) Explicitly find a primitive root modulo 125. Please do all parts. Thank you in advance

L= {w belongs to {0,1}* | the number of 0's is a prime number} . Prove...

L= {w belongs to {0,1}* | the number of 0's is a prime number} . Prove that the language L is not regular.

For p a given prime number, define the p-adic norm | * |p as follows on...

For p a given prime number, define the p-adic norm | * |p as follows on Q: Given q in Q, we can write it as a product q = (p^m)(a/b) with a,b integers which are not divisible by p, and m an integer which is uniquely determined by q (check that m is indeed uniquely determined by q). Then define |q|p = p^(-m). Check that Q with distance dp(q1,q2) = |q1 - q2|p is a metric space (here q1-q2...

Question

Use the method of exhaustion to prove the following statement: “For every prime number p between...

Solutions

Expert Solution

Related Solutions