Sfdwhf

How do I reattach a shelf to the wall when it ripped out of the wall?

Can I criticise the more senior developers around me for not writing clean code?

"Whatever a Russian does, they end up making the Kalashnikov gun"? Are there any similar proverbs in English?

What makes accurate emulation of old systems a difficult task?

What to do with someone that cheated their way through university and a PhD program?

Find the identical rows in a matrix

Unknown code in script

Apply a different color ramp to subset of categorized symbols in QGIS?

Prove that the countable union of countable sets is also countable

`microtype`: Set Minimum Width of a Space

Do I need to watch Ant-Man and the Wasp and Captain Marvel before watching Avengers: Endgame?

Will I lose my paid in full property

std::unique_ptr of base class holding reference of derived class does not show warning in gcc compiler while naked pointer shows it. Why?

Double-nominative constructions and “von”

How bug prioritization works in agile projects vs non agile

Which big number is bigger?

Nails holding drywall

How to have a sharp product image?

Island of Knights, Knaves and Spies

A ​Note ​on ​N!

What is the term for a person whose job is to place products on shelves in stores?

Check if a string is entirely made of the same substring

Why do distances seem to matter in the Foundation world?

Is it acceptable to use working hours to read general interest books?

Rolling a die $1000$ times, there is a time interval such that the product of all the results in that interval is a cube of $3$.

How many positive integers N are there such that the least common multiple of N and 1000 is 1000?What is the probability of covering all $6$ faces of a die after rolling it $14$ times or less?What is the chance of rolling a die and getting the number six three times at exactly 10 rolls?$n$-sided die thrown $n$ times. Probability that sum of results equals sum of prime factors of $n$.Maximum number of integers $(m,n)$ in $Atimes B$ such that $|m-n|leq 1000$Rolling a die 100 times and probability of product of resultsHow many order triple (a,b,c) are there such that $a.b.c le 1000$Probability that the minimum is $2$ and the maximum is $5$ after rolling a die $4$ timesRolling a fair $k$-side die $n$ times, what is the expected number of distinct outcomes?Rolling $4$ dice and multiplying the results. What is the probability that the product is divisible by $5$ or has $5$ as the least significant digit?

2

3

$begingroup$

Each of the six faces of a die is marked with an integer, not necessarily positive. The die is rolled $1000$ times. Show that there is a time interval such that the product of all rolls in this interval is a cube of an integer. (For example, it could happen that the product of all outcomes between 5th and 20th throws is a cube; obviously, the interval has to include at least one throw!)

I looked at abcdef as a possible product , somehow $1000$ of these 'terms' no matter how we shuffle them , a product like ababab or adadad or acdacdacd will be in the string but i cant prove how :(

combinatorics

share|cite|improve this question

edited 13 hours ago

Asaf Karagila♦

309k33441775

asked 19 hours ago

Randin DRandin D

776

$endgroup$

add a comment | 

2

3

$begingroup$

Each of the six faces of a die is marked with an integer, not necessarily positive. The die is rolled $1000$ times. Show that there is a time interval such that the product of all rolls in this interval is a cube of an integer. (For example, it could happen that the product of all outcomes between 5th and 20th throws is a cube; obviously, the interval has to include at least one throw!)

I looked at abcdef as a possible product , somehow $1000$ of these 'terms' no matter how we shuffle them , a product like ababab or adadad or acdacdacd will be in the string but i cant prove how :(

combinatorics

share|cite|improve this question

edited 13 hours ago

Asaf Karagila♦

309k33441775

asked 19 hours ago

Randin DRandin D

776

$endgroup$

add a comment | 

$begingroup$

Each of the six faces of a die is marked with an integer, not necessarily positive. The die is rolled $1000$ times. Show that there is a time interval such that the product of all rolls in this interval is a cube of an integer. (For example, it could happen that the product of all outcomes between 5th and 20th throws is a cube; obviously, the interval has to include at least one throw!)

I looked at abcdef as a possible product , somehow $1000$ of these 'terms' no matter how we shuffle them , a product like ababab or adadad or acdacdacd will be in the string but i cant prove how :(

combinatorics

share|cite|improve this question

edited 13 hours ago

Asaf Karagila♦

309k33441775

asked 19 hours ago

Randin DRandin D

776

$endgroup$

share|cite|improve this question

edited 13 hours ago

Asaf Karagila♦

309k33441775

asked 19 hours ago

Randin DRandin D

776

share|cite|improve this question

edited 13 hours ago

Asaf Karagila♦

309k33441775

asked 19 hours ago

Randin DRandin D

776

edited 13 hours ago

Asaf Karagila♦

309k33441775

edited 13 hours ago

Asaf Karagila♦

309k33441775

asked 19 hours ago

Randin DRandin D

776

asked 19 hours ago

Randin DRandin D

776

2 Answers
2

active

oldest

votes

10

$begingroup$

We can show something stronger; there exists an interval of rolls where each side has appeared a number of times which is a multiple of $3$.

For each $i=1,2,dots,1000$, let $a_i$ be number of times that the first face has appeared in rolls numbered $1,2,dots,i$. Same for $b_i,c_i,d_i,e_i,f_i$. Consider the $1000$ ordered six-tuples of values $T_i:=(a_i,b_i,dots,f_i)$, where each coordinate is only recorded modulo $3$. There are $3^6=729$ possible six-tuples, and there are $1000$ rolls, so by the pigeonhole principle, there are two indices $i<j$ for which $T_i=T_j$. This implies that among rolls numbered $i+1,i+2,dots,j$, each face appears a number of times which is a multiple of three.

share|cite|improve this answer

answered 18 hours ago

Mike EarnestMike Earnest

28.6k22255

$endgroup$

• 
  
  
  

  
  

  
  
  
  
  
  

  
  $begingroup$
  i dont get it, how again can u use pigeonhole? and how does this work for cubes not 3k
  $endgroup$
  – Randin D
  18 hours ago
  

  
  
  
  


• 
  
  
  

  
  

  
  
  
  
  
  

  
  $begingroup$
  (a) There are $1000$ numbers $iin{1,2,dots,1000}$, and $729$ possible tuples. $1000$ pigeons in $729$ holes. (b) If each face appears a multiple of three times, and the numbers of the faces are $x,y,z,w,s,t$, then the product of the numbers in that interval $[i+1,j]$ is $x^{3i}y^{3j}cdots t^{3k}$, which is the cube of $x^iy^jcdots t^k$.
  $endgroup$
  – Mike Earnest
  18 hours ago
  

  
  
  
  


• 
  
  
  

  
  

  
  
  
  
  
  

  
  $begingroup$
  i get pigeonhole ..1000 into 729 means 3 will be in one pigeonhole right? and thats the cube?
  $endgroup$
  – Randin D
  18 hours ago
  

  
  
  
  


• 
  
  
  

  
  

  
  
  
  
  
  

  
  $begingroup$
  how do u get the 729 again?
  $endgroup$
  – Randin D
  18 hours ago
  

  
  
  
  


• 
  
  
  

  
  

  
  
  
  
  
  

  
  $begingroup$
  Do you understand my sentence that starts with “Consider...”? We keep track of the remainder of the number of times each face appears in the first $i$ rolls modulo 3. There are three possible remainders, and six faces, so $3^6$. The reason this is helpful is because if the number of times the $a$ face appears in the first $i$ rolls is $3m+r$, and in the first $j$ rolls is $3n+r$, then subtracting, the number of times $a$ appears after $i$ and up to $j$ is $3(n-m)$, which is a multiple of $3$.
  $endgroup$
  – Mike Earnest
  7 hours ago
  

  
  
  
  

 | 
show 1 more comment

1

$begingroup$

Strengthening the result another way:

For each $i=1,dots,1000$ let $2^{a_i}cdot 3^{b_i}cdot 5^{c_i}$ be the product of the first $i$ rolls. Then there are only $3^3=27$ possible values for the 3-tuple $(a_ibmod 3, b_ibmod 3, c_ibmod 3)$, so, by a pigeonhole principle argument similar to Mike Earnest's in his answer, a cube must appear if there are more than 27 rolls.

share|cite|improve this answer

answered 14 hours ago

Rosie FRosie F

1,456416

$endgroup$

• 
  
  
  

  
  

  
  
  
  
  
  

  
  $begingroup$
  The question specifies that the sides of the die might be numbered with any integers, not necessarily just 1, 2, 3, 4, 5 and 6. I believe the worst case would be one where each side is numbered with a distinct prime.
  $endgroup$
  – Ilmari Karonen
  13 hours ago
  

  
  
  
  


• 
  
  
  

  
  

  
  
  
  
  
  

  
  $begingroup$
  @IlmariKaronen OK, good point, now that I see that in the OP.
  $endgroup$
  – Rosie F
  13 hours ago
  

  
  
  
  


• 
  
  
  

  
  

  
  
  
  
  
  

  
  $begingroup$
  duh i saw that too. you cant just assume the product will be with a 2 , 3 and a 5
  $endgroup$
  – Randin D
  10 hours ago
  

  
  
  
  

add a comment | 

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


}
});

draft saved

draft discarded

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

Name

Email

Required, but never shown

StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3201389%2frolling-a-die-1000-times-there-is-a-time-interval-such-that-the-product-of-al%23new-answer', 'question_page');
}
);

Post as a guest

Name

Email

Required, but never shown

10

$begingroup$

We can show something stronger; there exists an interval of rolls where each side has appeared a number of times which is a multiple of $3$.

For each $i=1,2,dots,1000$, let $a_i$ be number of times that the first face has appeared in rolls numbered $1,2,dots,i$. Same for $b_i,c_i,d_i,e_i,f_i$. Consider the $1000$ ordered six-tuples of values $T_i:=(a_i,b_i,dots,f_i)$, where each coordinate is only recorded modulo $3$. There are $3^6=729$ possible six-tuples, and there are $1000$ rolls, so by the pigeonhole principle, there are two indices $i<j$ for which $T_i=T_j$. This implies that among rolls numbered $i+1,i+2,dots,j$, each face appears a number of times which is a multiple of three.

share|cite|improve this answer

answered 18 hours ago

Mike EarnestMike Earnest

28.6k22255

$endgroup$

• 
  
  
  

  
  

  
  
  
  
  
  

  
  $begingroup$
  i dont get it, how again can u use pigeonhole? and how does this work for cubes not 3k
  $endgroup$
  – Randin D
  18 hours ago
  

  
  
  
  


• 
  
  
  

  
  

  
  
  
  
  
  

  
  $begingroup$
  (a) There are $1000$ numbers $iin{1,2,dots,1000}$, and $729$ possible tuples. $1000$ pigeons in $729$ holes. (b) If each face appears a multiple of three times, and the numbers of the faces are $x,y,z,w,s,t$, then the product of the numbers in that interval $[i+1,j]$ is $x^{3i}y^{3j}cdots t^{3k}$, which is the cube of $x^iy^jcdots t^k$.
  $endgroup$
  – Mike Earnest
  18 hours ago
  

  
  
  
  


• 
  
  
  

  
  

  
  
  
  
  
  

  
  $begingroup$
  i get pigeonhole ..1000 into 729 means 3 will be in one pigeonhole right? and thats the cube?
  $endgroup$
  – Randin D
  18 hours ago
  

  
  
  
  


• 
  
  
  

  
  

  
  
  
  
  
  

  
  $begingroup$
  how do u get the 729 again?
  $endgroup$
  – Randin D
  18 hours ago
  

  
  
  
  


• 
  
  
  

  
  

  
  
  
  
  
  

  
  $begingroup$
  Do you understand my sentence that starts with “Consider...”? We keep track of the remainder of the number of times each face appears in the first $i$ rolls modulo 3. There are three possible remainders, and six faces, so $3^6$. The reason this is helpful is because if the number of times the $a$ face appears in the first $i$ rolls is $3m+r$, and in the first $j$ rolls is $3n+r$, then subtracting, the number of times $a$ appears after $i$ and up to $j$ is $3(n-m)$, which is a multiple of $3$.
  $endgroup$
  – Mike Earnest
  7 hours ago
  

  
  
  
  

 | 
show 1 more comment

10

$begingroup$

We can show something stronger; there exists an interval of rolls where each side has appeared a number of times which is a multiple of $3$.

For each $i=1,2,dots,1000$, let $a_i$ be number of times that the first face has appeared in rolls numbered $1,2,dots,i$. Same for $b_i,c_i,d_i,e_i,f_i$. Consider the $1000$ ordered six-tuples of values $T_i:=(a_i,b_i,dots,f_i)$, where each coordinate is only recorded modulo $3$. There are $3^6=729$ possible six-tuples, and there are $1000$ rolls, so by the pigeonhole principle, there are two indices $i<j$ for which $T_i=T_j$. This implies that among rolls numbered $i+1,i+2,dots,j$, each face appears a number of times which is a multiple of three.

share|cite|improve this answer

answered 18 hours ago

Mike EarnestMike Earnest

28.6k22255

$endgroup$

• 
  
  
  

  
  

  
  
  
  
  
  

  
  $begingroup$
  i dont get it, how again can u use pigeonhole? and how does this work for cubes not 3k
  $endgroup$
  – Randin D
  18 hours ago
  

  
  
  
  


• 
  
  
  

  
  

  
  
  
  
  
  

  
  $begingroup$
  (a) There are $1000$ numbers $iin{1,2,dots,1000}$, and $729$ possible tuples. $1000$ pigeons in $729$ holes. (b) If each face appears a multiple of three times, and the numbers of the faces are $x,y,z,w,s,t$, then the product of the numbers in that interval $[i+1,j]$ is $x^{3i}y^{3j}cdots t^{3k}$, which is the cube of $x^iy^jcdots t^k$.
  $endgroup$
  – Mike Earnest
  18 hours ago
  

  
  
  
  


• 
  
  
  

  
  

  
  
  
  
  
  

  
  $begingroup$
  i get pigeonhole ..1000 into 729 means 3 will be in one pigeonhole right? and thats the cube?
  $endgroup$
  – Randin D
  18 hours ago
  

  
  
  
  


• 
  
  
  

  
  

  
  
  
  
  
  

  
  $begingroup$
  how do u get the 729 again?
  $endgroup$
  – Randin D
  18 hours ago
  

  
  
  
  


• 
  
  
  

  
  

  
  
  
  
  
  

  
  $begingroup$
  Do you understand my sentence that starts with “Consider...”? We keep track of the remainder of the number of times each face appears in the first $i$ rolls modulo 3. There are three possible remainders, and six faces, so $3^6$. The reason this is helpful is because if the number of times the $a$ face appears in the first $i$ rolls is $3m+r$, and in the first $j$ rolls is $3n+r$, then subtracting, the number of times $a$ appears after $i$ and up to $j$ is $3(n-m)$, which is a multiple of $3$.
  $endgroup$
  – Mike Earnest
  7 hours ago
  

  
  
  
  

 | 
show 1 more comment

$begingroup$

We can show something stronger; there exists an interval of rolls where each side has appeared a number of times which is a multiple of $3$.

For each $i=1,2,dots,1000$, let $a_i$ be number of times that the first face has appeared in rolls numbered $1,2,dots,i$. Same for $b_i,c_i,d_i,e_i,f_i$. Consider the $1000$ ordered six-tuples of values $T_i:=(a_i,b_i,dots,f_i)$, where each coordinate is only recorded modulo $3$. There are $3^6=729$ possible six-tuples, and there are $1000$ rolls, so by the pigeonhole principle, there are two indices $i<j$ for which $T_i=T_j$. This implies that among rolls numbered $i+1,i+2,dots,j$, each face appears a number of times which is a multiple of three.

share|cite|improve this answer

answered 18 hours ago

Mike EarnestMike Earnest

28.6k22255

$endgroup$

share|cite|improve this answer

answered 18 hours ago

Mike EarnestMike Earnest

28.6k22255

answered 18 hours ago

Mike EarnestMike Earnest

28.6k22255

answered 18 hours ago

Mike EarnestMike Earnest

28.6k22255

1

$begingroup$

Strengthening the result another way:

For each $i=1,dots,1000$ let $2^{a_i}cdot 3^{b_i}cdot 5^{c_i}$ be the product of the first $i$ rolls. Then there are only $3^3=27$ possible values for the 3-tuple $(a_ibmod 3, b_ibmod 3, c_ibmod 3)$, so, by a pigeonhole principle argument similar to Mike Earnest's in his answer, a cube must appear if there are more than 27 rolls.

share|cite|improve this answer

answered 14 hours ago

Rosie FRosie F

1,456416

$endgroup$

• 
  
  
  

  
  

  
  
  
  
  
  

  
  $begingroup$
  The question specifies that the sides of the die might be numbered with any integers, not necessarily just 1, 2, 3, 4, 5 and 6. I believe the worst case would be one where each side is numbered with a distinct prime.
  $endgroup$
  – Ilmari Karonen
  13 hours ago
  

  
  
  
  


• 
  
  
  

  
  

  
  
  
  
  
  

  
  $begingroup$
  @IlmariKaronen OK, good point, now that I see that in the OP.
  $endgroup$
  – Rosie F
  13 hours ago
  

  
  
  
  


• 
  
  
  

  
  

  
  
  
  
  
  

  
  $begingroup$
  duh i saw that too. you cant just assume the product will be with a 2 , 3 and a 5
  $endgroup$
  – Randin D
  10 hours ago
  

  
  
  
  

add a comment | 

1

$begingroup$

Strengthening the result another way:

For each $i=1,dots,1000$ let $2^{a_i}cdot 3^{b_i}cdot 5^{c_i}$ be the product of the first $i$ rolls. Then there are only $3^3=27$ possible values for the 3-tuple $(a_ibmod 3, b_ibmod 3, c_ibmod 3)$, so, by a pigeonhole principle argument similar to Mike Earnest's in his answer, a cube must appear if there are more than 27 rolls.

share|cite|improve this answer

answered 14 hours ago

Rosie FRosie F

1,456416

$endgroup$

• 
  
  
  

  
  

  
  
  
  
  
  

  
  $begingroup$
  The question specifies that the sides of the die might be numbered with any integers, not necessarily just 1, 2, 3, 4, 5 and 6. I believe the worst case would be one where each side is numbered with a distinct prime.
  $endgroup$
  – Ilmari Karonen
  13 hours ago
  

  
  
  
  


• 
  
  
  

  
  

  
  
  
  
  
  

  
  $begingroup$
  @IlmariKaronen OK, good point, now that I see that in the OP.
  $endgroup$
  – Rosie F
  13 hours ago
  

  
  
  
  


• 
  
  
  

  
  

  
  
  
  
  
  

  
  $begingroup$
  duh i saw that too. you cant just assume the product will be with a 2 , 3 and a 5
  $endgroup$
  – Randin D
  10 hours ago
  

  
  
  
  

add a comment | 

$begingroup$

Strengthening the result another way:

For each $i=1,dots,1000$ let $2^{a_i}cdot 3^{b_i}cdot 5^{c_i}$ be the product of the first $i$ rolls. Then there are only $3^3=27$ possible values for the 3-tuple $(a_ibmod 3, b_ibmod 3, c_ibmod 3)$, so, by a pigeonhole principle argument similar to Mike Earnest's in his answer, a cube must appear if there are more than 27 rolls.

share|cite|improve this answer

answered 14 hours ago

Rosie FRosie F

1,456416

$endgroup$

share|cite|improve this answer

answered 14 hours ago

Rosie FRosie F

1,456416

answered 14 hours ago

Rosie FRosie F

1,456416

answered 14 hours ago

Rosie FRosie F

1,456416