Question

Does the whole Balmer series fall in the visible region? Write and example for n initial...

Does the whole Balmer series fall in the visible region? Write and example for n initial use 7 to demonstrate.

Homework Answers

Answer #1

Not really..

Balmer series will only fall in to visible light in

n = 2,3,4,5,6

for n = 7, there is UV region

proof:

Apply Rydberg Formula

E = R*(1/nf^2 – 1/ni ^2)

R = -2.178*10^-18 J

Nf = final stage/level

Ni = initial stage/level

E = Energy per unit (i.e. J/photon)

E = (-2.178*10^-18)*(1/7^2 – 1/2 ^2)

E = 5.0005*10^-19

For the wavelength:

WL = h c / E

h = Planck Constant = 6.626*10^-34 J s

c = speed of particle (i.e. light) = 3*10^8 m/s

E = energy per particle J/photon

WL = (6.626*10^-34)(3*10^8)/(5.0005*10^-19) =

WL = 3.9752*10^-7 m

to nanometers:

WL = (3.9752*10^-7)(10^9) = 397.52 nm

this is less than 400 nm visible for human eye, this is UV region

Know the answer?
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Not the answer you're looking for?
Ask your own homework help question
Similar Questions
Hydrogen exhibits several series of line spectra in different spectral regions. For example the Lyman series...
Hydrogen exhibits several series of line spectra in different spectral regions. For example the Lyman series (nf = 1 in Balmer-Rydberg equation) occurs in the ultraviolet region while the Balmer (nf = 2) series occurs in the visible range and the Paschen (nf = 3), Brackett (nf = 4) and Pfund ( nf = 5) series all occur in the infrared range. What is the shortest-wavelength (in nm) in the Brackett series?
Infinity Sigma n=1 (n+1 / n^7/3 + sqrt n) Does this series converge or diverge?
Infinity Sigma n=1 (n+1 / n^7/3 + sqrt n) Does this series converge or diverge?
Use the power series method to find the solution of the initial value problem. Write the...
Use the power series method to find the solution of the initial value problem. Write the first eight nonzero terms of the power series centered at x = 0. y′′= e^y, y(0) = 0, y′(0) = −1
Please Write the whole program in assembly i am able to calculate the fibonacci series but...
Please Write the whole program in assembly i am able to calculate the fibonacci series but not sure how to print it in reverse order. Please give a Complete code !! Programming Exercise 1 (10 points): [call it Ass2-Q1.asm] Write an ASM program that reads an integer number N and then displays the first N values of the Fibonacci number sequence, described by: Fib(0) = 0, Fib(1) = 1, Fib(N) = Fib(N-2) + Fib(N-1) Thus, if the input is N...
Question D: i) Write out the first few terms of the series sum 9*0.1^n, n=1 to...
Question D: i) Write out the first few terms of the series sum 9*0.1^n, n=1 to infinity ii) What is the series equal to? iii) What famous math “paradox” does this relate to?
n the figure, an electron with an initial kinetic energy of 3.90 keV enters region 1...
n the figure, an electron with an initial kinetic energy of 3.90 keV enters region 1 at time t = 0. That region contains a uniform magnetic field directed into the page, with magnitude 0.0140 T. The electron goes through a half-circle and then exits region 1, headed toward region 2 across a gap of 23.0 cm. There is an electric potential difference ΔV = 2000 V across the gap, with a polarity such that the electron's speed increases uniformly...
IN C++ AS SIMPLE AS POSSIBLE ______ Re-write the given function, printSeriesSquareFifth,  to use a while loop...
IN C++ AS SIMPLE AS POSSIBLE ______ Re-write the given function, printSeriesSquareFifth,  to use a while loop (instead of for). • The function takes a single integer n as a parameter • The function prints a series between 1 and that parameter, and also prints its result • The result is calculated by summing the numbers between 1 and n (inclusive). If a number is divisible by 5, its square gets added to the result instead. • The function does not...
Write a recursive method public static int sumEveryOther(int n) that takes a positive int as an...
Write a recursive method public static int sumEveryOther(int n) that takes a positive int as an argument and returns the sum of every other int from n down to 1. For example, the call sumEveryOther(10) should return 30, since 10 + 8 + 6 + 4 + 2 = 30. The call sumEveryOther(9) should return 25 since 9 + 7 + 5 + 3 + 1 = 25. Your method must use recursion.
Write a C program that prompts the user to input as many unsigned(n) as the user...
Write a C program that prompts the user to input as many unsigned(n) as the user wants to type, terminated by non negative number You may assume without checking that when the user is supposed to type an unsigned, he nevertypes a double You may assume without checking that when the user is supposed to type an unsigned, he nevertypes a negative number. For each number the user types, output whether that number is prime or not. You won't need...
1. Write 3n + 1 Sequence String Generator function (1 point) In lab5.py complete the function...
1. Write 3n + 1 Sequence String Generator function (1 point) In lab5.py complete the function sequence that takes one parameter: n, which is the initial value of a sequence of integers. The 3n + 1 sequence starts with an integer, n in this case, wherein each successive integer of the sequence is calculated based on these rules: 1. If the current value of n is odd, then the next number in the sequence is three times the current number...