sci.math Google Group

redefiner

2010-09-09T09:51:49Z

I am looking for a vehicle that can move a Hilbert subspace through an infinite dimensional separatable Hilbert space. A unitary transform cannot move its own eigenfunctions and its eigenfunctions form a complete orthonormal base for the Hilbert space. So, it always has some eigenfunctions in a multidimensional subspace. That makes it unsuitable to move subspaces. However it may move the subspace over an infinitesimal distance. If that is possible, then a trail of infinitesimal unitary transforms of which the elements all have different sets of eigenfunctions can move a subspace over a significant distance. Is this trail a valid concept? If not, does a valid alternative exist that moves subspaces but leaves eigenvectors of normal operators untouched?

Re: FUNDAMENTAL DOUBLETHINK IN EINSTEINIANA

2010-09-09T09:58:07Z

If rationality in the era of Postscientism were not so irreversibly
devastated, this could be a nice clue to disentagling part of
Einsteiniana's doublethink:
[link]
"In 1911 Einstein published the paper "On the Influence of Gravitation

Re: JAMES RANDI $1,000,000 OFFER TO ANY "PSYCHICS" OUT THERE!

2010-09-09T09:34:21Z

Am 09.09.2010 08:03, schrieb The Man From Havana:
. . spoken like a true intellectual . .

Re: If there is a circle, there is also another

2010-09-09T09:35:54Z

Excuse me, there is a translation of the text:
"c_1 is the circle through E and F and tangent to the lines
AB and BC. Let G and H the points of contact. On the half-lines
DA and DC we take points I, J so that:
Being of a parallelogram ABCD and G and H be points of contact
c_1 with the tangents from B, you have to |DI| = |DJ|.

Re: If there is a circle, there is also another

2010-09-09T09:23:19Z

[link]
The problem was from Taiwan national olympiad of 1993. Its also was propose
in India national olympiad of 1998, with a slightly different enunciate.
The truth is that "in retrospect" does not seem so complicated ...

sequence that combines both Factorial and Binomial #909 Correcting Math

2010-09-09T09:07:03Z

Now we probably all learned the binomial probability and the factorial
probability via the examples of arranging N things is N! and the
example of
taking a test of multiply choice true or false, with N questions is
2^N.
Now in mathematics probability theory they usually split up these two
permutations but I like to think of them as both the "outcome space"

Re: DYNAMIC EQUILIBRIUM AND THE SECOND LAW OF THERMODYNAMICS

2010-09-09T08:31:24Z

In his 1824 memoire Carnot dealt with two reversible heat engines
which DID NOT INTERACT. In 1850 Clausius used NON-INTERACTING heat
engines again:
[link]
"Ueber die bewegende Kraft der Warme" 1850 Rudolf Clausius: "Carnot
assumed, as has already been mentioned, that the equivalent of the

Re: Euclid's Proof of Infinite Primes

2010-09-09T08:27:44Z

Good example.
Yes even in N you can define the primes to be
{2,3}. 1 is still a unit, 4 is still composite
but 7 is a unit and 10 is a (associate) prime, (2 is prime 5 is a
unit).
More importantly, it is no longer true that every n >1
has prime divisor.

Re: JSH: Using composites to understand the arguments

2010-09-09T08:01:46Z

As if that makes a difference.
Because you are wrong at so many levels.
You've abandoned the thread at
[link]
... where a substantial refutation of your work has been posted.
Try addressing that, rather than pretending it doesn't exist.

Re: FLT : (2x+1)^p + 2^p y^p = (2y+1)^p

2010-09-09T08:47:00Z

On Thu, 9 Sep 2010 00:11:39 -0700 (PDT), achille
Very nice.
quasi

Re: FLT : (2x+1)^p + 2^p y^p = (2y+1)^p

2010-09-09T07:11:39Z

I think I have a proof x = 0 mod p^2 independent of
whether y = 0 mod p or not. Let a = 2x+1, b = 2y, c = (2y+1),
we know p | x => p not | a.
Case 1: p not | bc, then as racy claims:
c^p/(a+b) is a product of factors of form (pn+1)^p
=> c^p/(a+b) = 1 mod(p^2)
=> c^p = (a+b) mod(p^2)
Similarly

Re: two sums involving Fibonacci numbers

2010-09-09T06:32:51Z

On Wed, 8 Sep 2010 10:23:09 -0700 (PDT), hanrahan...@yahoo.co.uk
wrote:
see [link]

Solution manual to Linear Algebra and its Applications 3rd ed - D. Lay

2010-09-09T06:24:56Z

Solutions Manual, Solution Manual, Test Bank, Instructor Manual
I have the following solutions manual.
To get the solution manual you want, just send email to me.
My email address is smtbsupport(at)gmail.com
please replace (at) to @ , if the solutions manual or test bank you
want is not in the following list, you can also send email to me.

Chapt 11 layered age of Cosmos at 6.5 billion years old yet galaxies of the Uranium Atom Totality 20.2 billion years old #307 ATOM TOTALITY

2010-09-09T06:15:53Z

Chapter 11
the Uranium Atom Totality layer at 20 billion years old
This is the 4th edition of this book and I need to consolidate
the age layers of the Cosmos. Not only do we find galaxies
belonging to different age layers but we find stars within
galaxies as belonging to different age layers and finally,

Re: Euclid's Proof of Infinite Primes

2010-09-09T06:15:57Z

I think we are misunderstanding each other. I was trying to
to show you that one can in fact set up Euclid's proof so that
it does deduce true things in rings with finitely many primes.
I read your original remark as saying that the statement was
deduced trivially - in the sense that anything can be inferred

Re: JAMES RANDI $1,000,000 OFFER TO ANY "PSYCHICS" OUT THERE!

2010-09-09T06:03:28Z

Put a gun to your head you spamming obese cunt.

Re: FLT : (2x+1)^p + 2^p y^p = (2y+1)^p

2010-09-09T06:57:30Z

On Wed, 8 Sep 2010 20:34:29 -0700 (PDT), achille
I'm only sure that whatever I thought I saw was an illusion.
I realized right after leaving the house that my argument was
nonsense, but I had no time to go back and retract it.
But thanks for challenging it -- it needed to be challenged.
quasi

Re: How can one find such a number?

2010-09-09T05:48:19Z

If you take logs of all the numbers involved so that you're adding
rather than multiplying, it looks very closely related to the Knapsack
problem. I suspect that there isn't a polynomial-time algorithm.
- Tim

Chapter (11) layered age of Cosmos with 6.5 billion years new Cosmos yet old galaxies of the Uranium Atom Totality 20.2 billion years old #306 ATOM TOTALITY

2010-09-09T05:45:48Z

Controversy".
Above, I have used the best age of the alpha
decay modes of Thorium and
Uranium. There is no problem of thorium with
20.2 billion years
matching the oldest stars and that is exactly
where Sandage was going.
Going for the 20 billion year mark for the
oldest stars.
However there is a problem with Uranium in

Re: How can one find such a number?

2010-09-09T05:01:18Z

Am 09.09.2010 02:20 schrieb mike3:
Two questions -
a) is it allowed to use the factorization of the given integer n?
b) does the given list of factors L contain only primes or does it
contain composites too?
Gottfried

Re: How can one find such a number?

2010-09-09T04:40:46Z

Is this what you're asking?
Let n in N be a positive interger,
and F the set of positive factors of n.
How does one find the smallest number k >= n,
that's a product of some subset of F?
Clearly 1 and n in F. Thus k = 1 * n = n.

JAMES RANDI $1,000,000 OFFER TO ANY "PSYCHICS" OUT THERE!

2010-09-09T04:39:36Z

James Randi will pay $1,000,000 for evidence of any Occult, Paranormal or Supernatural
demonstration under proper scientific testing conditions... but he mostly just tells psychics to F off
Herc

Re: two sums involving Fibonacci numbers

2010-09-09T04:39:26Z

Off the bottom of my bottom, for the first, I would write F_n in terms
of phi (F_n = phi^n - phi^-n times something), expand 1/F_n in a
series, and see what you could do with that.
For the second, I have seen a proof but, like Argentine Tango, I can't
remember it.

Re: How can one find such a number?

2010-09-09T04:35:25Z

IIRC, either Hamming or Dijkstra (probably D) had a discussion on the
problem of successively generating all the integers that were
divisible only by 2, 3, or 5 (i.e., numbers of the form 2^a 3^b 5^c
with a, b, c being non-negative integers). There was a nice algorithm.
If you can find this and generalize, this might do what you want.

Re: Euclid's Proof of Infinite Primes

2010-09-09T04:28:58Z

How is 1 + the product of all primes is a unit consistent
with 1 + the product of all primes is a prime? (It's not.)
Perhaps you should give the "true theorem" whose conclusion
is that 1 plus product of all finitely many primes is a
prime. Then I will give you the contradiction. Deal?
regards, chip

Re: number of generators in HNN extensions

2010-09-09T03:48:46Z

You mean... a group H that is not-cyclic, 2-generated, subgroups A and
B such that H=/=<A,B>, A isomorphic to B, and with the corresponding
HNN extension 2-generated?
Take H = Z x Z, A = <(1,0)>, B = <(0,2)>. Then H is not generated by A
and B. If t is the stable element in the HNN extension, though, then

Re: FLT : (2x+1)^p + 2^p y^p = (2y+1)^p

2010-09-09T03:34:29Z

Are you sure??? (2y+1)^p = (2y)^p + (2py+1) mod p^2.

Re: Why Insulation is a Good Investment

2010-09-09T03:31:25Z

you are right but I can certainly do without your advice. Anybody with more
than one neuron would know that I used the wrong word (Unfortunately we
can't edit our posts). Only those with half a neuron will point it out
because they want to show that they know their english.

boundary between finite and infinite using Factorial Sequence 19^(22x22) #908 Correcting Math; #305 ATOM TOTALITY

2010-09-09T03:20:58Z

Alright, I am waiting for the confirmation that the Factorial Sequence
with its whirling morphed
triangles of squares and the canyon channel pattern allows log-spirals
to exist in that condition until about 301! or that vicinity of
19^(22x22).
In case no log spiral can exist in that Factorial Sequence of morphed

Re: Euclid's Proof of Infinite Primes

2010-09-09T03:06:04Z

Not true. While one can in fact deduce whatever one desires
after deducing a contradiction, that is not what occurs above.
Said result is deduced from the hypothesis that there are only
finitely many primes, and the true theorem that I stated above.
In a UFD with finitely many primes the same proof does yield

Re: JSH: Broken symmetry and algebraic integers

2010-09-09T01:48:27Z

Guesses? Really? You make such wonderful use of the web, such sweeping
generalities on the behaviors of college students, and you only *GUESS*
at where they may be in course material?
Now, if you have attended a major institution in the last, oh, at least
5 years, you would see that guessing is not necessary. Or perhaps you

Re: 0/0 = 1, Axiom. By Aiya-Oba

2010-09-09T01:35:46Z

I'am sorry for that.
The question is for the OP.

Re: How can one find such a number?

2010-09-09T01:25:28Z

In article <9aa4c149-f365-4ea2-ba82-0b62a 1e072e7
@s17g2000prh.googlegroups.com> , mike4...@yahoo.com says...
Brute force.
Lots of things can speed it up, of course. No need to try factors
bigger than the square root of your positive integer twice in the
series.
You can take the logs of all the numbers in your list and then find out

Re: Comprehensive Solution Manual for Textbooks

2010-09-09T01:25:28Z

NEW BOOKS!!!
I have the comprehensive SOLUTIONS MANUAL the following textbooks. The
solutions manual are comprehensive with answers to both even & odd
problems in the text.
The methods of payment is through PAYPAL (It is easy, safe, and you
can use debit or credit card to pay even if you don't have an

Re: 0/0 = 1, Axiom. By Aiya-Oba

2010-09-09T01:14:26Z

Tain't my axiom, though you responded to my post. I was merely
channeling another.

Re: JSH: Using composites to understand the arguments

2010-09-09T01:14:50Z

No. This does not follow.
We need to be clear about what it means to say "Either f_1 or f_2 has
9 as a factor." To give meaning to the phrase "has 9 as a factor" we
need to specify what ring of functions we are working in. To say "the
function f has 9 as a factor" means that there exists a function g in

Re: JSH: Using composites to understand the arguments

2010-09-09T01:01:41Z

I need some clarification. What ring are f_1 f_2 g_1 and g_2 in? You
mention factoring so are they integers or algebraic integers or
something else?
Thanks, Michael W.

Re: A question on alephs

2010-09-09T00:58:21Z

Yes but that's a pretty specific definition of general.
Here maybe we can extract Aatu's meaning about Aleph_1. Aleph_1 is a
greater cardinal than the cardinal Aleph_0. Whether Aleph_1 = c, the
cardinality of the continuum (which is the Continuum Hypothesis), that
the cardinality of the continuum is the only cardinality next to the

Re: An Alternative to Standard Arithmetic

2010-09-09T00:53:39Z

I'm not sure making subtraction indeterminate is equivalent to ruling
out additive inverses. Positive and negative numbers n still exist.
The question is really "What kind of additive identity is acceptable
when inverses are added?" Just what does mark out an additive identity
element? What attributes or characteristics of the number zero

Solution manual to Vector Mechanics for Engineers; Dynamics 8th edition Beer Johnston

2010-09-09T00:52:05Z

Re: JSH: Using composites to understand the arguments

2010-09-09T00:50:42Z

NO !!!!!!! 7 IS THE NUMBER, not 9. 9 is a flipping square! 9 is even
a prime!
Use 1 instead of 9 or 7. That works much better.
OR use INT(+- SQRT(-1))
[ hint: instead of 7 or 9 or 3, try using "n" a variable ]
If 9 dosent work, try 11. or go back to 7. Perhaps 5 ?

Test bank and Solution manual to Intermediate Accounting 13e Kieso Weygant Warfield

2010-09-09T00:51:33Z

Solution manual to Accounting Information Systems 11th edition, romney, steinbart

2010-09-09T00:49:46Z

Solution manual to Cost Accounting A Managerial Emphasis 13th edition by Charles T. Horngren

2010-09-09T00:49:12Z

Re: 0/0 = 1, Axiom. By Aiya-Oba

2010-09-09T00:48:18Z

By your 'axiom 0/0=1', we have:
n*0/0=n
or
(n*0)/0=n
0/0=n
My question:
0/0 is 1 or n ?

JSH: Using composites to understand the arguments

2010-09-09T00:24:20Z

For years I've used 7 as my favorite constant with equations that I
use to try and show a remarkable problem with established number
theory, which has for years left open the door for posters to claim
that primeness is critical, so here's an explanation with composites!
The 7 will be replaced by 9.
Consider:

Re: JSH: Understanding the arguments

2010-09-09T00:20:31Z

I didn't need to use that assumption.
Obviously the statement remains true with that additional assumption,
provided the ring of functions you are working in is Z[x].
Yes, with your additional assumption the statement remains true.
Provided the ring of functions we are working in is Z[x]. If the ring

How can one find such a number?

2010-09-09T00:20:06Z

Hi.
How can one do this? Given a positive integer number, and a list of
positive integer factors, how can one find the smallest number greater
than or equal to the given that is a product of factors from that
list?

Cool astrophotography

2010-09-09T00:18:17Z

Stunning photos of northern lights.
[link]

Re: JSH: Broken symmetry and algebraic integers

2010-09-09T00:10:52Z

It's my research, like I said. I kind of like my own work!!! And
Usenet is a practice zone for me anyway, where now I'm brainstorming
more areas as I try to figure out a test of what meaning I can give to
all those hits from other countries according to Google Analytics.
All that web data gives me endless areas to try and figure things out