Search the whole station

# 计算数论作业代写 Mth 440/540代写 数学作业代写 数学代写

330

## Mth 440/540 Homework

### (1) Part I

a.) Use Mathematica to determine the 100th prime, the 1000th prime, and the 10,000th prime.

b.) Use Mathematica to determine the prime factorization of 2022.

c.) Mathematica uses PrimePi[x] to denote the function π(x), giving the number of primes less than or equal to x. It uses LogIntegral[x] to denote the logarithmic integral li(x).

Using Mathematica, fifirst plot on the same graph π(x), li(x), and x/ log(x) for x ∈ [2, 100], then repeat with x ∈ [2, 10000].

### (2) Part II

1. Suppose m ∈ N and a, b ∈ Z. Show that if a ≡ b (mod m) then gcd(a, m) = gcd(b, m).

2. Fix n ∈ N and suppose a, b ∈ Z such that gcd(a, b) = 1. Show that there exists some x ∈ Z such that gcd(ax+b, n) = 1.

(Hint: as a first step consider the prime divisors pi of n, and thereafter use the Chinese Remainder Theorem.)

3. Prove that a natural number n is prime if and only if Ø(n) = n − 1.

### (3) Part III 计算数论作业代写

For this, your web browser will need to invoke the OSU library proxy. Open this OSU library page and click on MathSciNet there. This should bring you to http://www.ams.org/mathscinet/search after perhaps requiring that you sign in with your OSU account.

1.) In the Title box, type “Chinese remainder theorem”, then click on Search. How many articles with these words in the title are reviewed?

2.) Go back to the search page. Find the review of an article entitled A centennial history of the prime number theorem.

What is the final sentence of the review?

3) Go back to the search page. Delete the title entry, and in-sert “shoup, v*” in the author field. Find the review of (the first edition) the textbook we are using. What is the first sentence of the fourth paragraph of the review?

4) Now choose your own topic and use the Search to find something of interest. Explain.

### (4) Part IV. 计算数论作业代写

You must clearly comment your code — any fellow student should be able to understand the logic of your code. For functions that you write, clearly indicate what type of input is expected and the form of the output.

1. Find the first 20 primes found by the classical proof of the infinitude of the set of primes. That is: begin with P = {2};

then form, m, the sum of 1 with the product over all elements of P. Place the smallest prime factor of m into P and repeat.

(For this problem, you may wish to use FactorInteger.)

2. A Wilson prime is a prime p such that

(p 1)! ≡ −1 mod p2 .

Write a procedure which determines all Wilson primes less than 104 .

### Related recommendations

• #### 线性代数代写 数学代写 考试代写 EXAM代写

789

MAT224H5Y EXAM 线性代数代写 Question 1. (40 Marks) This question consists of 20 multiple choice questions. Answer each question and put your answer in the table below. Question 1. (40 Marks...

View details
• #### 数学概率作业代写 数学概率代写 数学作业代写 概率作业代写

322

4. Probability on finite sample spaces. 数学概率作业代写 1. Are the following events A, B ⊂ Ωroulette independent? Find P(A|B) and P(B|A) in each case. a) A = Red, B = Even, 1. Are the fol...

View details
• #### 离散数学与图论代写 图论代写 离散数学代写 数学作业代写

277

Discrete Mathematics and Graph Theory 离散数学与图论代写 Practice Class 4 1. Give recursive definitions of the following sequences. (a) The sequence of powers of 2: 20 = 1, and for n ≥ 1, _ ...

View details
• #### 数学考试代做 Math 2415代写 数学期末代写 数学作业代写

509

Math 2415 Final Exam 数学考试代做 To get full credit you must show ALL your work. The problems must be solved without any assistance of others or the usage of unauthorized material To get fu...

View details
1