subject
Mathematics, 11.07.2019 18:20 esnyderquintero

Let $b$ be an integer greater than 2, and let $n_b = 1_b + 2_b + \cdots + 100_b$ (the sum contains all valid base $b$ numbers up to $100_b$). compute the number of values of $b$ for which the sum of the squares of the base $b$ digits of $n_b$ is at most 512.

ansver
Answers: 3

Another question on Mathematics

question
Mathematics, 21.06.2019 21:40
Astudy was interested in determining if eating milk chocolate lowered someone's cholesterol levels.ten people's cholesterol was measured. then, each of these individuals were told to eat 100g of milk chocolate every day and to eat as they normally did. after two weeks, their cholesterol levels were measured again. is there evidence to support that their cholesterol levels went down? how should we write the alternative hypothesis? (mud = the population mean difference= before - after)a. ha: mud = 0b. ha: mud > 0c. ha: mud < 0d. ha: mud does not equal 0
Answers: 1
question
Mathematics, 21.06.2019 23:00
Find the dimensions of the circle. area = 64π in.² r= in.
Answers: 1
question
Mathematics, 22.06.2019 00:20
Biggest exam of the which of the following are polynomial functions?
Answers: 1
question
Mathematics, 22.06.2019 00:40
Compute the standard deviation of the following set of data to the nearest whole number. 10, 10, 15, 20, 25
Answers: 3
You know the right answer?
Let $b$ be an integer greater than 2, and let $n_b = 1_b + 2_b + \cdots + 100_b$ (the sum contains a...
Questions
question
Mathematics, 05.10.2019 09:30
question
Biology, 05.10.2019 09:30