Calculate the de broglie wavelength

Reference no: EM13163988

Calculate the de Broglie wavelength for each of the following.a 57 g ball with a velocity of 35. m/s b an electron with a velocity 12% the speed of light.

Reference no: EM13163988

Questions Cloud

What is the vapor pressure of this solution : A solution is prepared by dissolving 396 g of sucrose (C12H22O11) in 624 g of water. What is the vapor pressure of this solution at 30°C? (The vapor pressure of water is 31.8 mmHg at 30°C.)

How much h2o is needed : Acetylene gas (C2H2) is produced as a result of the reaction CaC2(s)+2H2O(l)-> C2H2(g)+Ca(HO)2(aq) if 13g of CaC2 are consumed in this reaction, how much H2O is needed?

How many moles of sodium phospahte were present : A student mixed 5.00 mL of a nickel(2) chloride solution with 5.00 mL of .100M sodium phosphate and a precipitate formed. How many moles of sodium phospahte were present in 5.00 mL of the solution?

How many moles of cn- ions will be contained : A 270 mL stock solution contains 0.9 M Ca(CN)2. When 103 mL of the stock solution is diluted to 130 mL, how many moles of CN- ions will be contained in the dilute solution?

Calculate the de broglie wavelength : Calculate the de Broglie wavelength for each of the following.a 57 g ball with a velocity of 35. m/s b an electron with a velocity 12% the speed of light.

Emulates the behavior of a bus : Write a program that emulates the behavior of a bus. The bus must have a schedule ( a finite number of times for it to stop) and a certain capacity (number of passengers). In this program the bus has two states: stopped and going.

What objectives and political philosophies did he advocate : Who was Eugene V. Debs and what objectives and political philosophies did he advocate? What did he accomplish in 1912?

Method that receives an array and returns with no duplicate : Write a program that contrains a method that receives an array and returns a new array with no duplicates.

The knight''s tour problem : The knight's tour problem is as follows: given an initial position for a single knight on an otherwise empty chessboard, find a sequence of 64 moves that will make the knight visit every square on the board exactly once

User Account

All Pages