Non-trivial divisors Announcing the arrival of Valued Associate #679: Cesar Manara Planned maintenance scheduled April 23, 2019 at 23:30 UTC (7:30pm US/Eastern)Are there any non-trivial rational integers in the $p$-adic closure of $1,q,q^2,q^3,…$?The number of positive integers less than 1000 with an odd number of divisorsThe rigorousness of this proof about greatest common divisors.Prove that among any 12 consecutive positive integers there is at least one which is smaller than the sum of its proper divisorsDo all members of this sequence have $8$ divisors?Proper Divisors / Number TheoryConstruct a non trivial homomorphism $mathbb Z_14 tomathbb Z_21$Smallest integer that is divisible by 90 and has exactly 90 distinct positive divisorsInteger divisors of an integerFind all natural numbers $n$, such that polynomial $n^7+n^6+n^5+1$ would have exactly 3 divisors.
What does Turing mean by this statement?
What makes a man succeed?
A letter with no particular backstory
Did Mueller's report provide an evidentiary basis for the claim of Russian govt election interference via social media?
Crossing US/Canada Border for less than 24 hours
How did Fremen produce and carry enough thumpers to use Sandworms as de facto Ubers?
Flash light on something
Misunderstanding of Sylow theory
How does the math work when buying airline miles?
Why does it sometimes sound good to play a grace note as a lead in to a note in a melody?
What is the meaning of 'breadth' in breadth first search?
Random body shuffle every night—can we still function?
How to compare two different files line by line in unix?
Why can't I install Tomboy in Ubuntu Mate 19.04?
If Windows 7 doesn't support WSL, then what is "Subsystem for UNIX-based Applications"?
How often does castling occur in grandmaster games?
Central Vacuuming: Is it worth it, and how does it compare to normal vacuuming?
What would you call this weird metallic apparatus that allows you to lift people?
preposition before coffee
How could we fake a moon landing now?
What does 丫 mean? 丫是什么意思?
Drawing spherical mirrors
In musical terms, what properties are varied by the human voice to produce different words / syllables?
How do I find out the mythology and history of my Fortress?
Non-trivial divisors
Announcing the arrival of Valued Associate #679: Cesar Manara
Planned maintenance scheduled April 23, 2019 at 23:30 UTC (7:30pm US/Eastern)Are there any non-trivial rational integers in the $p$-adic closure of $1,q,q^2,q^3,…$?The number of positive integers less than 1000 with an odd number of divisorsThe rigorousness of this proof about greatest common divisors.Prove that among any 12 consecutive positive integers there is at least one which is smaller than the sum of its proper divisorsDo all members of this sequence have $8$ divisors?Proper Divisors / Number TheoryConstruct a non trivial homomorphism $mathbb Z_14 tomathbb Z_21$Smallest integer that is divisible by 90 and has exactly 90 distinct positive divisorsInteger divisors of an integerFind all natural numbers $n$, such that polynomial $n^7+n^6+n^5+1$ would have exactly 3 divisors.
$begingroup$
I want to find out the number of integers whose biggest non-trivial divisor is exactly $k$ times the smallest non-trivial divisor of that integer.
My thoughts are, that the smallest divisor $n$ has to be prime, otherwise the divisor would have smaller divisors, which would divide the larger integer too.
Also the biggest divisor would be $kn$. Also I believe that the integers have to be in the form $mkn$, and then I would have to exclude some of these integers because the property does not hold, but i am not sure how to prove that.
number-theory elementary-number-theory divisibility
$endgroup$
add a comment |
$begingroup$
I want to find out the number of integers whose biggest non-trivial divisor is exactly $k$ times the smallest non-trivial divisor of that integer.
My thoughts are, that the smallest divisor $n$ has to be prime, otherwise the divisor would have smaller divisors, which would divide the larger integer too.
Also the biggest divisor would be $kn$. Also I believe that the integers have to be in the form $mkn$, and then I would have to exclude some of these integers because the property does not hold, but i am not sure how to prove that.
number-theory elementary-number-theory divisibility
$endgroup$
2
$begingroup$
Note that every number (with at least 1 non-trivial divisor) is the product of their smallest and largest non-trivial divisors. This means your number is $kn^2$ for $n$ prime and $k$ having no prime factors less than $n$.
$endgroup$
– Don Thousand
Apr 2 at 0:46
$begingroup$
so the smallest non-trivial divisor has to be prime, and then I get the integer $kn^2$, but the relationship to the number of such integers still eludes me
$endgroup$
– M-S-R
Apr 2 at 0:59
add a comment |
$begingroup$
I want to find out the number of integers whose biggest non-trivial divisor is exactly $k$ times the smallest non-trivial divisor of that integer.
My thoughts are, that the smallest divisor $n$ has to be prime, otherwise the divisor would have smaller divisors, which would divide the larger integer too.
Also the biggest divisor would be $kn$. Also I believe that the integers have to be in the form $mkn$, and then I would have to exclude some of these integers because the property does not hold, but i am not sure how to prove that.
number-theory elementary-number-theory divisibility
$endgroup$
I want to find out the number of integers whose biggest non-trivial divisor is exactly $k$ times the smallest non-trivial divisor of that integer.
My thoughts are, that the smallest divisor $n$ has to be prime, otherwise the divisor would have smaller divisors, which would divide the larger integer too.
Also the biggest divisor would be $kn$. Also I believe that the integers have to be in the form $mkn$, and then I would have to exclude some of these integers because the property does not hold, but i am not sure how to prove that.
number-theory elementary-number-theory divisibility
number-theory elementary-number-theory divisibility
asked Apr 2 at 0:43
M-S-RM-S-R
505
505
2
$begingroup$
Note that every number (with at least 1 non-trivial divisor) is the product of their smallest and largest non-trivial divisors. This means your number is $kn^2$ for $n$ prime and $k$ having no prime factors less than $n$.
$endgroup$
– Don Thousand
Apr 2 at 0:46
$begingroup$
so the smallest non-trivial divisor has to be prime, and then I get the integer $kn^2$, but the relationship to the number of such integers still eludes me
$endgroup$
– M-S-R
Apr 2 at 0:59
add a comment |
2
$begingroup$
Note that every number (with at least 1 non-trivial divisor) is the product of their smallest and largest non-trivial divisors. This means your number is $kn^2$ for $n$ prime and $k$ having no prime factors less than $n$.
$endgroup$
– Don Thousand
Apr 2 at 0:46
$begingroup$
so the smallest non-trivial divisor has to be prime, and then I get the integer $kn^2$, but the relationship to the number of such integers still eludes me
$endgroup$
– M-S-R
Apr 2 at 0:59
2
2
$begingroup$
Note that every number (with at least 1 non-trivial divisor) is the product of their smallest and largest non-trivial divisors. This means your number is $kn^2$ for $n$ prime and $k$ having no prime factors less than $n$.
$endgroup$
– Don Thousand
Apr 2 at 0:46
$begingroup$
Note that every number (with at least 1 non-trivial divisor) is the product of their smallest and largest non-trivial divisors. This means your number is $kn^2$ for $n$ prime and $k$ having no prime factors less than $n$.
$endgroup$
– Don Thousand
Apr 2 at 0:46
$begingroup$
so the smallest non-trivial divisor has to be prime, and then I get the integer $kn^2$, but the relationship to the number of such integers still eludes me
$endgroup$
– M-S-R
Apr 2 at 0:59
$begingroup$
so the smallest non-trivial divisor has to be prime, and then I get the integer $kn^2$, but the relationship to the number of such integers still eludes me
$endgroup$
– M-S-R
Apr 2 at 0:59
add a comment |
0
active
oldest
votes
Your Answer
StackExchange.ready(function()
var channelOptions =
tags: "".split(" "),
id: "69"
;
initTagRenderer("".split(" "), "".split(" "), channelOptions);
StackExchange.using("externalEditor", function()
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled)
StackExchange.using("snippets", function()
createEditor();
);
else
createEditor();
);
function createEditor()
StackExchange.prepareEditor(
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: true,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
bindNavPrevention: true,
postfix: "",
imageUploader:
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
,
noCode: true, onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
);
);
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3171318%2fnon-trivial-divisors%23new-answer', 'question_page');
);
Post as a guest
Required, but never shown
0
active
oldest
votes
0
active
oldest
votes
active
oldest
votes
active
oldest
votes
Thanks for contributing an answer to Mathematics Stack Exchange!
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
Use MathJax to format equations. MathJax reference.
To learn more, see our tips on writing great answers.
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3171318%2fnon-trivial-divisors%23new-answer', 'question_page');
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
2
$begingroup$
Note that every number (with at least 1 non-trivial divisor) is the product of their smallest and largest non-trivial divisors. This means your number is $kn^2$ for $n$ prime and $k$ having no prime factors less than $n$.
$endgroup$
– Don Thousand
Apr 2 at 0:46
$begingroup$
so the smallest non-trivial divisor has to be prime, and then I get the integer $kn^2$, but the relationship to the number of such integers still eludes me
$endgroup$
– M-S-R
Apr 2 at 0:59