how can i prove $sum_{t=1}^T a_t.n_t > sum_{t=1}^T a_t.n'_t $?












0












$begingroup$


in partitioning of numbers (ways of writing a positive integer as a sum of positive integers) .
suppose that$ P $and $Q$ are two partitions of $N in mathbb N$.



$n_t$:=the number of times that a number is used in partitioning $P$ .
$n′_t$:=the number of times that a number is used in partitioning $q$ .
if $ T$ be a largest number in every partiotioning , and $forall t : 1leq tleq T$ , $ $ $a_t =frac{N^{T-t} (T-1)! }{(t-1)!} $ .is this true?



if $n_T>n'_T$ then $sum_{t=1}^T a_t.n_t > sum_{t=1}^T a_t.n'_t $



In all the examples I tested, the inequality was correct .but i don't know how can i prove it.



my try:



according to the defenition of $a_t$ we have $a_T=1$. then we must to prove the following:



$n_T+sum_{t=1}^{T -1}a_t.n_t > n'_T +sum_{t=1}^{T -1} a_t.n'_t $



This sum is composed of two parts. The first part is right according to the assumption. I think No matter how the value of second part is big, this value does not go to the value of the first part.
Is it Right?



How do I start proof?










share|cite|improve this question











$endgroup$












  • $begingroup$
    Is $a_t$ the same thing as $w_t?$
    $endgroup$
    – saulspatz
    Dec 7 '18 at 13:11










  • $begingroup$
    @saulspatz , yes , I forgot to correct it .I edited it. Thanks
    $endgroup$
    – yaodao vang
    Dec 7 '18 at 13:12












  • $begingroup$
    Is this supposed to say that if $n_tge n'_t$ for $1le tle T$ then the conclusion is true? What you have written is clearly false.
    $endgroup$
    – saulspatz
    Dec 7 '18 at 13:17










  • $begingroup$
    What if $n_1=1, n'_1=10^{100}$ Why should the conclusion follow just because $n_T>n'_T$ for some $T?$
    $endgroup$
    – saulspatz
    Dec 7 '18 at 13:26












  • $begingroup$
    I don't understand. This whole question seems very confused to me.
    $endgroup$
    – saulspatz
    Dec 7 '18 at 14:48
















0












$begingroup$


in partitioning of numbers (ways of writing a positive integer as a sum of positive integers) .
suppose that$ P $and $Q$ are two partitions of $N in mathbb N$.



$n_t$:=the number of times that a number is used in partitioning $P$ .
$n′_t$:=the number of times that a number is used in partitioning $q$ .
if $ T$ be a largest number in every partiotioning , and $forall t : 1leq tleq T$ , $ $ $a_t =frac{N^{T-t} (T-1)! }{(t-1)!} $ .is this true?



if $n_T>n'_T$ then $sum_{t=1}^T a_t.n_t > sum_{t=1}^T a_t.n'_t $



In all the examples I tested, the inequality was correct .but i don't know how can i prove it.



my try:



according to the defenition of $a_t$ we have $a_T=1$. then we must to prove the following:



$n_T+sum_{t=1}^{T -1}a_t.n_t > n'_T +sum_{t=1}^{T -1} a_t.n'_t $



This sum is composed of two parts. The first part is right according to the assumption. I think No matter how the value of second part is big, this value does not go to the value of the first part.
Is it Right?



How do I start proof?










share|cite|improve this question











$endgroup$












  • $begingroup$
    Is $a_t$ the same thing as $w_t?$
    $endgroup$
    – saulspatz
    Dec 7 '18 at 13:11










  • $begingroup$
    @saulspatz , yes , I forgot to correct it .I edited it. Thanks
    $endgroup$
    – yaodao vang
    Dec 7 '18 at 13:12












  • $begingroup$
    Is this supposed to say that if $n_tge n'_t$ for $1le tle T$ then the conclusion is true? What you have written is clearly false.
    $endgroup$
    – saulspatz
    Dec 7 '18 at 13:17










  • $begingroup$
    What if $n_1=1, n'_1=10^{100}$ Why should the conclusion follow just because $n_T>n'_T$ for some $T?$
    $endgroup$
    – saulspatz
    Dec 7 '18 at 13:26












  • $begingroup$
    I don't understand. This whole question seems very confused to me.
    $endgroup$
    – saulspatz
    Dec 7 '18 at 14:48














0












0








0





$begingroup$


in partitioning of numbers (ways of writing a positive integer as a sum of positive integers) .
suppose that$ P $and $Q$ are two partitions of $N in mathbb N$.



$n_t$:=the number of times that a number is used in partitioning $P$ .
$n′_t$:=the number of times that a number is used in partitioning $q$ .
if $ T$ be a largest number in every partiotioning , and $forall t : 1leq tleq T$ , $ $ $a_t =frac{N^{T-t} (T-1)! }{(t-1)!} $ .is this true?



if $n_T>n'_T$ then $sum_{t=1}^T a_t.n_t > sum_{t=1}^T a_t.n'_t $



In all the examples I tested, the inequality was correct .but i don't know how can i prove it.



my try:



according to the defenition of $a_t$ we have $a_T=1$. then we must to prove the following:



$n_T+sum_{t=1}^{T -1}a_t.n_t > n'_T +sum_{t=1}^{T -1} a_t.n'_t $



This sum is composed of two parts. The first part is right according to the assumption. I think No matter how the value of second part is big, this value does not go to the value of the first part.
Is it Right?



How do I start proof?










share|cite|improve this question











$endgroup$




in partitioning of numbers (ways of writing a positive integer as a sum of positive integers) .
suppose that$ P $and $Q$ are two partitions of $N in mathbb N$.



$n_t$:=the number of times that a number is used in partitioning $P$ .
$n′_t$:=the number of times that a number is used in partitioning $q$ .
if $ T$ be a largest number in every partiotioning , and $forall t : 1leq tleq T$ , $ $ $a_t =frac{N^{T-t} (T-1)! }{(t-1)!} $ .is this true?



if $n_T>n'_T$ then $sum_{t=1}^T a_t.n_t > sum_{t=1}^T a_t.n'_t $



In all the examples I tested, the inequality was correct .but i don't know how can i prove it.



my try:



according to the defenition of $a_t$ we have $a_T=1$. then we must to prove the following:



$n_T+sum_{t=1}^{T -1}a_t.n_t > n'_T +sum_{t=1}^{T -1} a_t.n'_t $



This sum is composed of two parts. The first part is right according to the assumption. I think No matter how the value of second part is big, this value does not go to the value of the first part.
Is it Right?



How do I start proof?







calculus summation proof-writing






share|cite|improve this question















share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited Dec 7 '18 at 15:53







yaodao vang

















asked Dec 7 '18 at 13:00









yaodao vangyaodao vang

686




686












  • $begingroup$
    Is $a_t$ the same thing as $w_t?$
    $endgroup$
    – saulspatz
    Dec 7 '18 at 13:11










  • $begingroup$
    @saulspatz , yes , I forgot to correct it .I edited it. Thanks
    $endgroup$
    – yaodao vang
    Dec 7 '18 at 13:12












  • $begingroup$
    Is this supposed to say that if $n_tge n'_t$ for $1le tle T$ then the conclusion is true? What you have written is clearly false.
    $endgroup$
    – saulspatz
    Dec 7 '18 at 13:17










  • $begingroup$
    What if $n_1=1, n'_1=10^{100}$ Why should the conclusion follow just because $n_T>n'_T$ for some $T?$
    $endgroup$
    – saulspatz
    Dec 7 '18 at 13:26












  • $begingroup$
    I don't understand. This whole question seems very confused to me.
    $endgroup$
    – saulspatz
    Dec 7 '18 at 14:48


















  • $begingroup$
    Is $a_t$ the same thing as $w_t?$
    $endgroup$
    – saulspatz
    Dec 7 '18 at 13:11










  • $begingroup$
    @saulspatz , yes , I forgot to correct it .I edited it. Thanks
    $endgroup$
    – yaodao vang
    Dec 7 '18 at 13:12












  • $begingroup$
    Is this supposed to say that if $n_tge n'_t$ for $1le tle T$ then the conclusion is true? What you have written is clearly false.
    $endgroup$
    – saulspatz
    Dec 7 '18 at 13:17










  • $begingroup$
    What if $n_1=1, n'_1=10^{100}$ Why should the conclusion follow just because $n_T>n'_T$ for some $T?$
    $endgroup$
    – saulspatz
    Dec 7 '18 at 13:26












  • $begingroup$
    I don't understand. This whole question seems very confused to me.
    $endgroup$
    – saulspatz
    Dec 7 '18 at 14:48
















$begingroup$
Is $a_t$ the same thing as $w_t?$
$endgroup$
– saulspatz
Dec 7 '18 at 13:11




$begingroup$
Is $a_t$ the same thing as $w_t?$
$endgroup$
– saulspatz
Dec 7 '18 at 13:11












$begingroup$
@saulspatz , yes , I forgot to correct it .I edited it. Thanks
$endgroup$
– yaodao vang
Dec 7 '18 at 13:12






$begingroup$
@saulspatz , yes , I forgot to correct it .I edited it. Thanks
$endgroup$
– yaodao vang
Dec 7 '18 at 13:12














$begingroup$
Is this supposed to say that if $n_tge n'_t$ for $1le tle T$ then the conclusion is true? What you have written is clearly false.
$endgroup$
– saulspatz
Dec 7 '18 at 13:17




$begingroup$
Is this supposed to say that if $n_tge n'_t$ for $1le tle T$ then the conclusion is true? What you have written is clearly false.
$endgroup$
– saulspatz
Dec 7 '18 at 13:17












$begingroup$
What if $n_1=1, n'_1=10^{100}$ Why should the conclusion follow just because $n_T>n'_T$ for some $T?$
$endgroup$
– saulspatz
Dec 7 '18 at 13:26






$begingroup$
What if $n_1=1, n'_1=10^{100}$ Why should the conclusion follow just because $n_T>n'_T$ for some $T?$
$endgroup$
– saulspatz
Dec 7 '18 at 13:26














$begingroup$
I don't understand. This whole question seems very confused to me.
$endgroup$
– saulspatz
Dec 7 '18 at 14:48




$begingroup$
I don't understand. This whole question seems very confused to me.
$endgroup$
– saulspatz
Dec 7 '18 at 14:48










0






active

oldest

votes











Your Answer





StackExchange.ifUsing("editor", function () {
return StackExchange.using("mathjaxEditing", function () {
StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix) {
StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
});
});
}, "mathjax-editing");

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
});


}
});














draft saved

draft discarded


















StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3029872%2fhow-can-i-prove-sum-t-1t-a-t-n-t-sum-t-1t-a-t-n-t%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
















draft saved

draft discarded




















































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.




draft saved


draft discarded














StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3029872%2fhow-can-i-prove-sum-t-1t-a-t-n-t-sum-t-1t-a-t-n-t%23new-answer', 'question_page');
}
);

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







Popular posts from this blog

To store a contact into the json file from server.js file using a class in NodeJS

Redirect URL with Chrome Remote Debugging Android Devices

Dieringhausen