E=qF ϕE=∫E⋅dA ϕB=∫B⋅dl ε=∮LqFonchargeq⋅dl ΔV=−∫ABE⋅dl if ∮LE⋅dl=0E created by charges
Maxwell’s Equations
Gauss’s Law
∮E⋅dA=ε0qenclosed → charges make E, which is path-independent ∮B⋅dA=0 → there is no magnetic monopole
Ampere’s Law
∮B⋅dl=μ0I+μ0ε0dtdϕE → current and changing electric fulx make B
Faraday’s Law
ε=−dtdϕB → changing magnetic flux makes emf
EMF
ε=∮LoopqFonchargeq⋅dl
If Fonchargeq comes from:
B, then
it is a motional emf
e.g.
A rectangular conductor with length L is moving in a uniform magnetic field, then charges on the conductor would separate by magnetic for and creates a electric field inside the conductor. The charges would keep separating until ∣FE∣=∣FB∣ FE=FB qE=qvB ∴E=vB
So, by ΔV=−∫ABE⋅dl,
Get ΔV=vBL
E, then
it is a tranformer emf
In which ∮LE⋅dl=0, so by the Faraday’s Law, ∮LE⋅dl=−dtd(∫B⋅dA) changing B makes E (i.e. changing B induces I). Ehere depends on path
Yet it seems that these two types of emf are different phenomena, both of them could be concluded by Faraday’s Law (i.e. changing magnetic flux)
Why E created by charges guarantees ∮LE⋅dl=0
path A to B: E∥dl so, we have ∫ABkq/r2dl on path A to B
with the same logic, we have ∫ABkq/r2(−dl) on path C to D
On path B to C and path D to A, since E⊥dl , integrations on those two path would be zero.
So, ∮LE⋅dl=∫ABkq/r2dl+∫ABkq/r2(−dl)=0
By contrast, for E created by changing B,
since E∥dl, ∮LE⋅dl=0
Problem here Problem Petya loves lucky numbers. Everybody knows that lucky numbers are positive integers whose decimal representation contains only the lucky digits 4 and 7 . For example, numbers 47 , 744 , 4 are lucky and 5 , 17 , 467 are not. Petya calls a number almost lucky if it could be evenly divided by some lucky number. Help him find out if the given number n is almost lucky. Input The single line contains an integer n (1 ≤ n ≤ 1000) — the number that needs to be checked. Output In the only line print “ YES " (without the quotes), if number n is almost lucky. Otherwise, print “ NO " (without the quotes). Sample test(s) input 47 output YES input 16 output YES input 78 output NO Note Note that all lucky numbers are almost lucky as any number is evenly divisible by itself. In the first sample...
Problem here Problem The Fibonacci numbers (0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, …) are defined by the recurrence: eqnarray20 Write a program to calculate the Fibonacci Numbers. INPUT&OUTPUT The input to your program would be a sequence of numbers smaller or equal than 5000, each on a separate line, specifying which Fibonacci number to calculate. Your program should output the Fibonacci number for each input value, one per line. Sample input 5 7 11 output The Fibonacci number for 5 is 5 The Fibonacci number for 7 is 13 The Fibonacci number for 11 is 89 Solution 這題要用大數加法才不會WA #include <iostream> using namespace std ; int f[ 5001 ][ 5001 ] = { 0 }; int main(){ f[ 1 ][ 0 ] = 1 ; for ( int i = 2 ; i <= 5000 ; i++){ for ( int j = 0 ; j < 5001 ; j++){ f[i][j] += f[i- 1 ][j] + f[i- 2 ][j]; f[i][j+ 1 ] += f[i][j]/ 10 ; f[i][j] %= 10 ; } } int ...
Comments
Post a Comment