Question 2: Part 1: Show that it is not possible to choose a uniform positive integer...
Eight rooks are placed randomly on a chess board. What is the probability that none of the rooks can capture any of the other rooks? Translation for those who are not familiar with chess: pick 8 unit squares at random from an 8 × 8 square grid. What is the probability that no two chosen squares share a row or a column? Hint. You can think of placing the rooks both with or without order, both approaches work.
Problem 1. How many ways are there to place 8 rooks on a chess board in such a way that they cannot capture each other? Just in case some of you do not know the rules of chess, this is the same as: how many ways can we pick 8 points on an 8x8 grid such that every row and every column has at most one point on it?)
Problem 1. How many ways are there to place 8 rooks...
4. Eight rooks are placed randomly on a chess board. What is the probability that none of the rooks can capture any of the other rooks? (In non-chess terms: Randomly pick 8 unit squares from an 8 x 8 square grid. What is the probability that no two squares share a row or a column?) Hint: How many choices do you have to place rooks in the first row? After you have made your choice, how many choices do you...
answer all questions
7. (4 points) What is the probability that an integer from 1 to 1000, inclusive, chosen at random, is a multiple of 3 or a multiple of 7? 8. Eight people, including Joe and Ellen, are going to the movies and will sit in a row of 8 chairs. (a) (3 points) In how many ways can the eight people seat themselves? (b) (4 points) In how many ways can they seat themselves if Joe and Ellen...
Question 5. Let r, n be positive integers. 1. (6 pts) Consider the random binary r n matrix M , where each entry is equal to 0 or 1 with probability 1/2 (so each entry follows the Bernoulli random variable with parameter 1/2), and these entries are (jointly) independent random variables. What is the probability that each column in M has at most one entry with 1? 1 2. (*, 4 pts) Let S1, . . . , Srbe identically...
please explain/ comment
3. Eight Queens Write a program that places eight queens on a chessboard (8 x 8 board) such that no queen is "attacking" another. Queens in chess can move vertically, horizontally, or diagonally. How you solve this problem is entirely up to you. You may choose to write a recursive program or an iterative (i.e., non-recursive) program. You will not be penalized/rewarded for choosing one method or another. Do what is easiest for you. 3.1. Output Below...
You are going to be implementing the classic computer science
simulation, Conway's Game of Life.
Conway's Life is played on a matrix of cells, kind of like a
chess board but theoretically extending infinitely in every
direction. Each individual cell in the matrix can either be alive
or dead. A live cell in the matrix is shown in our simulation by
printing an asterisk (*) to the screen. A dead cell is shown by
leaving that area of the matrix...
i need a help pleassssse?
5. What is the probability that the sum of the numbers on two dice is even when they are rolled? 6. What is the probability that a card selected at random from a standard deck of 52 cards is an ace or a heart? What is the probability that a positive integer not exceed- 100 selected at random is divisible by 5 or 7? nd the probability of winning a lottery by selecting the t...
1. Negative O 2. Positive O 3. Unable to determine Submit answer Question (part 1 of 2) A small 1.02 g plastic ball is suspended by a 21.8 cm long string at an angle of 10.7 in a uniform electric field of 1530 N/C, as shown. 10.7 1530 N/C \21,8 cm 1.02 g Is the ball's charge positive or negative? Question (part 2 of 2) Submit answer Your response... If the ball is in equilibrium when the string makes a...
Assignment 2 In this assignment, you will write two short programs to solve problems using recursion. 1. Initial Setup Log in to Unix. Run the setup script for Assignment 2 by typing: setup 2 2. Towers of Hanoi Legend has it that in a temple in the Far East, priests are attempting to move a stack of disks from one peg to another. The initial stack had 64 disks threaded onto one peg and arranged from bottom to top by...