Problem 1 – Prove that every natural number n, co-prime with 10, has a multiple of who consists, when written in the decimal system, entirely of the digit 1 (is a so-called repunit)
Problem 2 – Prove that the sum of all totitives of n (numbers less than n and co-prime with n) of a number n is ½* n* (n)

Solution PreviewSolution Preview

These solutions may offer step-by-step problem-solving explanations or good writing examples that include modern styles of formatting and construction of bibliographies out of text citations and references. Students may use these solutions for personal skill-building and practice. Unethical use is strictly forbidden.

The first observation we do is that if we fix a totative k for n, then n-k is also a totative. The proof is straightforward. Since k is totative => (k,n)=1. Assuming that (n-k, n) is not 1=> we assume there is d a divisor >1 for both n-k and n...

By purchasing this solution you'll be able to access the following files:

for this solution

or FREE if you
register a new account!

PayPal, G Pay, ApplePay, Amazon Pay, and all major credit cards accepted.

Find A Tutor

View available Number Theory Tutors

Get College Homework Help.

Are you sure you don't want to upload any files?

Fast tutor response requires as much info as possible.

Upload a file
Continue without uploading

We couldn't find that subject.
Please select the best match from the list below.

We'll send you an email right away. If it's not in your inbox, check your spam folder.

  • 1
  • 2
  • 3
Live Chats