Matt C Anderson

60 Reputation

6 Badges

3 years, 144 days

MaplePrimes Activity


These are questions asked by Matt C Anderson

Hi Maple experts and others,

We want to make a graph with 6 vertical lines.  One end of every vertical line will be on the x axis.  The other end of the vertical lines will be on integers of data points.

 


 

3+2

5

(1)

ab := Vector[row](6); cd := Vector[row](6)

ab := Vector[row](6, {(1) = 5, (2) = 8, (3) = 11, (4) = 14, (5) = 17, (6) = 20})

 

cd := Vector[row](6, {(1) = 1, (2) = 2, (3) = 3, (4) = 4, (5) = 5, (6) = 6})

(2)

for count to 6 do ab[count] := 3*count+2; cd[count] := count end do;

5

 

1

 

8

 

2

 

11

 

3

 

14

 

4

 

17

 

5

 

20

 

6

(3)

ab

Vector[row]([5, 8, 11, 14, 17, 20])

(4)

cd

Vector[row]([1, 2, 3, 4, 5, 6])

(5)

``


 

Download a_try.mw

Please assist us.

Regards,

Matt

 

Hi Maple Experts and all,

 

There is a conjecture from a book written in 1986.

This conjecture states that

"Given any four consecutive integers greater than 11, there is at least one of them that is divisible by a prime greater than 11."
 

Is anyone willing to write Maple code to test this up to a reasonable numerical limit?

See a discussion thread

https://mersenneforum.org/showthread.php?p=518300#post518300

I imagine the ifactor() command and loops.  I'm not that good at coding.

 

Regards,

Matt

Hi all,

For what its worth,
I want to make a graph of data.
Attached is file to show how far I got.

multiplication_table_list_to_graph.mw

 

multiplication_table_list_to_graph.pdf

 

Regards,
Matthew
 

HI all,

 

Let all variables be integers here.

I am trying to search 3 variables , "A","B",and "C" so that f(A*x2+B*x+C) factors into two binomials.

Here, f(y) = y2+y+19.

Choose a search space of 0<A<10 and 0<B<30 and 0<C<100.  

I am having some trouble with my Maple code.

Here is how far I got - 

Maple_coefficient_search_broken.mw

Maple_coefficient_search_broken.pdf

Regards,

Matt

 

We conjecture that the polynomial h(n) = n^2 + n + 41 is prime for an infinite number of values n.
We furthur conjecture that p(n) = n^2 + 1 is prime an infinite number of times.

I have shown that the set (x,y) with h(y) mod x is congruent to 0 can be written down.  It is p(x,y).  p(x,y) is the set of all divisors of h(n).  See

https://sites.google.com/site/primeproducingpolynomial/

landau.mw

Regards,

Matt

1 2 3 4 Page 1 of 4