HI MaplePrimes,

Is the Goldbach Weak Conjecture proven?

Consider odd primes p, q, and r.  The question is, Is the sum p+q+r sufficient to reach all odd numbers greater than 9?

See - 

https://en.wikipedia.org/wiki/Goldbach's_weak_conjecture

I tried an example.

looping_for_Goldbach_Weak_Conjecture_8.mw

looping_for_Goldbach_Weak_Conjecture_8.pdf

Regards,

Matt

Hi Maple Primes,

Can this code be improved?

I know that the Goldbach Conjecture has been checked with computer tools above 10^10.

Request for comments.

check_g_conjecture_26_b.mw

check_g_conjecture_26_b.pdf

Regards

Matt

Hi everybody,

So today is 10-28-2016 and I explored Leyland Numbers for the first time, on Maple.  Please see my example file and let me know what your impression is.

x_to_the_yth_power_and_y_to_the_xth_power_take_4.mw

x_to_the_yth_power_and_y_to_the_xth_power_take_4.pdf

I have included a .pdf file so that the caual internet observer can also be aware of this information.

Regards,
Matt

Hi MaplePrimes,

I try again to ask about a procedure I wrote.  Maybee someone can spot my error.

collatz_conjecture_2.mw

Here is the broken procedure - 

cs := proc (n::integer)::integer;
local count;
description "Find the number of steps for a Collatz sequence to reach 1";
count := 1;
while 1 < n do
if `mod`(n, 2) = 0 then n := (1/2)*n else n := 3*n+1 end if;
count := count+1
end do;
return count
end proc

Regards,

Matt

Hi Maple People,

I have this Maple command -

printf("%g",p)

where p is a variable I assign.  My problem is that I want to put a new line in the display.

What is the appropriate command?

Regards,

Matt