khaled

Coulomb's law: m < 10^-14 eV with upper bound of: m < 3 x 10^-27 eV which was already proved,

(( )) (( )) (( )) (( )) :::: ( ........ ( ** atoms ** ) electrons ) -------- particles ------------------- black hole --------- i hope someone explain if I'm wrong .., or right,

i think he this is about Meta-Physics,

Heat [math]\propto[/math] Pressure also, Speed [math]\propto[/math] Pressure gas inside the balloon escapes High-Pressure, but if the balloon is kept under the water, it won't lose gas from its pressure, but because the high pressure of the water causes it to press on the balloon and enforce its gas to escape, but gas won't escape it if the container is solid ...

since electricity is the movement of electrons, when one has excessive electrons they can lose in continuous exchange, which is electricity ...

1/ when a photon lose energy it's ,in other words, transforming from its form to other forms, "gone" is not a defined word in physics 2/ notice that photons come from sun, they do not come in "Void" ,do they ?! no .. they reflect and get through every particle of air/dust/water/..etc through the atmosphere, and all of that until it gets to us on the earth surface ! thanx

physics is progressive, impassive, dynamic ... ------------------------------ I'm still writing a Science-Fiction novel called "Dark Nano", although it's fictional but i get ideas from scientific facts, here is a part of it, " the impact was high, as the wonder impression on the solider's face asking "how possible ?!!" as the answer came from dark-euclid saying " beyond the element resistance, we have the nano-level arrangement that can give us more defense .. we call it NANO SENTINEL !!" " ------------------------------------------

let's say for example you draw pixels through iterations from the left-side of the screen to the right side, simple example: void pixelIterator(integer X, integer Y, integer colorIndex) { if(Y >= screen-width) return; // STOP drawPixel(X,Y,colorIndex); pixelIterator(X+1, Y, colorIndex+1); } output: |-------------------| itr 1 |-------------------| itr 2 |-------------------| itr 3 complex example: void pixelRecursive(integer X, integer Y, integer factor) { if(Y >= screen-width OR X >= screen-height) return; // STOP drawPixel(X,Y, getPixelColorIndex()+factor); // color = color + 1 pixelRecursive(X+1, Y, factor+1); pixelRecursive(X+1, Y+1, factor); pixelRecursive(X, Y+1, factor-1); } this last example will create gradiant depending on parameters and initial conditions,

im not the one who suggest using terrible approximations .. i use general fraction

f(n) = 2^(2^n), P(n) = n*log(n) f(0) = 1,.. P(0) = 0 ..(initial condition TRUE) f(1) = 4,... P(1) = 0 f(2) = 16,... P(2) = 1.4 f(3) = 256,.... P(3) = 3.3 ... f(10) = 309.8, P(10) = 23 P(n) is less than f(n) for n <= k, now let's prove it for n = k+1 f(k+1) = 2^(2^k+1) = 2^(2^k) * 2^(2^1) = f(k) * 2^2 P(k+1) = (k+1) * log(k+1) = k * log(k+1) + log(k+1) .. = k * log(k+1) + log(k+1) ..(i'll consider log(k+1) = log(k) + epsilon) ... = k * log(k) + epsilon + log(k+1) .... = P(k) + (epsilon + log(k+1)) growth rate of f(k) = f(k) * 2^2 / f(k) * 100 % = 400% growth rate of P(k) = P(k) + epi + log(k+1) / P(k) * 100% .. = P(k)/P(k) + epi/P(k) + log(k+1)/P(k) * 100% ... = 1 + 0 (canceled) + log(k+1)/k * log(k) .... = log(k) + epi /k * log(k) = log(k)/k * log(k) + epi/P(k) * 100% ..... = 1/k + 0 * 100% ...... = 1/k * 100% = 100 k^-1 % since, f(K) > P(K) and, growth rate of f(k) >> 100% > growth rate of P(k) then f(K+1) > P(K+1) is TRUE also,

magic numbers, sometimes, i think that magic numbers can with some ways lead to lucky streams,

my answer is simple, Geometry is the Visual version of Algebra

using an algorithm to generate a picture is not useful, pictures we know are no pattern but, chaos algorithm is good to simulate cosmic unreachable events ... it's because we may give initial conditions (sometimes random), because the random chaos simulation is the best choice for anonymous events, but about what you mentioned of "repeating N times can go infinite", it means a computer can run infinite, means you won't be able to wait until it stops but like the non-terminating decimal numbers, you round up to some level and when the N algorithm is running on a computer, it shows current results at the moment, you study current to its past, like a doctor who diagnoses a patient ... that's all i can guess,

but in the end, this solution does not solve the main problem saving space .. no, 0 = __ 1 = {} 2 = {}{} 3 = {}{}{} 4 = {}{}{}{} 5 = {}{}{}{}{} 6 = {}{}{}{}{}{} 7 = {}{}{}{}{}{}{} 8 = {}{}{}{}{}{}{}{} 9 = {}{}{}{}{}{}{}{}{} i think i should waste time on more beneficiary ...

i did read your post, and if you really read my second post, you'd realize that i started a new idea ...

so we have, density 14.5 * 10³kg m³ and, Density = mass/volume so, mass = density * volume ..and.. volume = mass / density ... mass = 14.5 * 10³ * volume ..&.. volume = mass / 14.5 * 10³ UNIT mass = 14.5 * 10³ * 1 kg ..for volume = 14.5 * 10³ m³ UNIT volume = 1 m³ / (14.5 * 10³) = 6.8965517241379310344827586206897e-5 UNIT volume (round) = 6.9 but the question is, how did you estimated the density in the first place, .. what are you working on, explain your geometrical work space ...

geometric representation can let you notice possible relations easily, geometric representation allows transformation,scaling,..etc sometimes translating one formula into different field expand its enhancement scope,

it's true that if x = 3y + 5 then, 1. change sides x = 3y + 5 y = x/3 - 5/3 2. validation x = 3(x/3 - 5/3) + 5 = 3x/3 - 3*5/3 + 5 = x -5+5 y = (3y + 5)/3 - 5/3 = 3y/3 + 5/3 - 5/3 = y +5-5 = y

also, let's not forget the possibility of inserting the pi value as fraction into the formula, for example, formula: (X + 2[math]X^2{}[/math]) = r Result = [math]r^2{}[/math] * pi A: r^2 * (22/7) B: (X + 2 X^2) * (X + 2 X^2) * (22/7) = (X^2 + 4 X^3 + 4 X^4) * (22/7) ....... = (22 X^2 / 7) + (88 X^3 / 7) + (88 X^4 / 7) i guess that such process can give better solutions to particular formula

when we want to tell the computer "for example" to do calculation like calculating the circle's area, we may give the following instruction in different versions, A: Result = [math]r^2{}[/math] * 3.14 B: Result = [math]r^2{}[/math] * 3.1416 C: Result = [math]r^2{}[/math] * 3.14159265 example, input: r = 100000 A: Result = 31400000000 B: Result = 31416000000 C: Result = 31415926500 but yet when we go with real numbers, it start to be worse ... so the best solution would to be, let the machine shows you the best it can do ! this means, let the computer do the division ... and this would be my version of Circle Area Calc .. in C, long double Circle_Area ( double r ) { double pi = (double)22.0/(double)7.0; long double Result = r * r * pi; return Result; }

irrational numbers, with continues non-repeating decimal representation, we round the value for use,

here is a way to make this theory fits for real numbers, i just thought of it, n > 0 0 = ..{ } 1 = { { } } 2 = { { }, {{}} } 3 = { { }, {{},{{}}} } 4 = { { }, {{},{{},{{}}}} } guess you notice that there is always a single empty set at the beginning of the global set so, we can use it to define precision as follows, note: i used ,{} to distinguish 0 from 1 ... 0.0 = { } 0.1 = { ,{} } 0.2 = { ,{},{} } 0.03 = { ,{ {},{},{} } } 0.004 = { ,{{ {},{},{},{} }} example: 3.1235 = { { {}, { {},{}, { {},{},{}, { {},{},{},{},{} }}}}, {{},{{}}} } ................. DECIMAL ..................... INTEGER .... so degree of precision is specified in levels of { }'s into the single set PS, i should get a certification for this, you know

the integral logo is my vote, <logo> [ .l` f(n) ] ScienceForums.Net