My Math Forum Some problems in elementary arithmetic functions

 Number Theory Number Theory Math Forum

 November 4th, 2017, 07:14 AM #1 Newbie   Joined: Oct 2017 From: sweden Posts: 20 Thanks: 0 Some problems in elementary arithmetic functions Hello, I ran in to this problem and I cant seem to show this although it seems intuitively correct: Given any positive integer $n>1$, prove that there are infinitely many integers $x$ satisfying $d(x)=n$. Where $d(n)$ is the number of positive divisors of $n$. I will appreciate the help.
 November 4th, 2017, 08:57 AM #2 Senior Member   Joined: May 2016 From: USA Posts: 1,206 Thanks: 494 Consider the set of integers that consists of all primes raised to the first power. How many distinct divisors does each number in that set contain? How many numbers does that set contain? Now consider the set of integers that consists of all primes raised to the second power. How many distinct divisors does each number in that set contain? How many numbers does that set contain? Can you build a proof by induction from those clues? Thanks from topsquark and heinsbergrelatz
 November 11th, 2017, 10:00 PM #3 Newbie   Joined: Oct 2017 From: sweden Posts: 20 Thanks: 0 That was very helpful! thank you, and yes I managed to solve it .

 Thread Tools Display Modes Linear Mode

 Similar Threads Thread Thread Starter Forum Replies Last Post pirateprogrammer Complex Analysis 3 September 11th, 2016 04:46 PM joseph95 Differential Equations 3 February 13th, 2014 01:56 PM JamesTr Elementary Math 2 January 3rd, 2014 10:06 PM mathbalarka Real Analysis 2 August 30th, 2012 05:37 AM earth Number Theory 5 October 9th, 2010 06:54 AM

 Contact - Home - Forums - Cryptocurrency Forum - Top